Session details: Iconic programming

This article is based on an idea proposed by C. W. Carroll for transforming a mathematical programming problem into a sequence of unconstrained minimization problems. It describes the theoretical validation of Carroll's proposal for the convex ...

This paper considers mixed-integer quadratic programs in which the objective function is quadratic in the integer and in the continuous variables, and the constraints are linear in the variables of both types. The generalized Benders' decomposition is a ...

• Theoretically compared the tightness of the J-set relaxation with the recursive McCormick relaxations.

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 ...