بایگانی برچسب: بروزترین مقالات مهندسی کامپیوتر

On linear programming relaxations for solving polynomial programming problems

linear

تسهیلات برنامه ریزی خطی برای حل مشکلات برنامه نویسی چند جمله ای This paper studies linear programming (LP) relaxations for solving polynomial programming problems. A polynomial programming problem can be equivalently formulated as a quadratically constrained quadratic program (QCQP) by introducing new variables that represent nonlinear monomials and substituting them …

ادامه مطلب