Search Results - subject:"Polynomial programming"

Narrow search

Optimality conditions for minimizers at infinity in polynomial programming

Phạm, T. S. - In: Mathematics of operations research 44 (2019) 4, pp. 1381-1395

Persistent link: https://ebvufind01.dmz1.zbw.eu/10012128376

On linear programming relaxations for solving polynomial programming problems

Dalkiran, Evrim; Ghalami, Laleh - In: Computers & operations research : and their … 99 (2018), pp. 67-77

Persistent link: https://ebvufind01.dmz1.zbw.eu/10011901562

Global optimization of general nonconvex problems with intermediate polynomial substructures

Zorn, Keith; Sahinidis, Nikolaos - In: Journal of Global Optimization 59 (2014) 2, pp. 673-693

This work considers the global optimization of general nonconvex nonlinear and mixed-integer nonlinear programming problems with underlying polynomial substructures. We incorporate linear cutting planes inspired by reformulation-linearization techniques to produce tight subproblem formulations...

Persistent link: https://ebvufind01.dmz1.zbw.eu/10010994125

Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality

Dalkiran, Evrim; Sherali, Hanif - In: Journal of Global Optimization 57 (2013) 4, pp. 1147-1172

-linearization technique (RLT)-based linear programming (LP) relaxations for solving polynomial programming problems. We establish related …

Persistent link: https://ebvufind01.dmz1.zbw.eu/10010896447