Mixed integer polynomial programming

Vivek Dua
2015 Computers and Chemical Engineering  
The mixed integer polynomial programming problem is reformulated as a multi-parametric programming problem by relaxing integer variables as continuous variables and then treating them as parameters. The optimality conditions for the resulting parametric programming problem are given by a set of simultaneous parametric polynomial equations which are solved analytically to give the parametric optimal solution as a function of the relaxed integer variables. Evaluation of the parametric optimal
more » ... tion for integer variables fixed at their integer values followed by screening of the evaluated solutions gives the optimal solutions.
doi:10.1016/j.compchemeng.2014.07.020 fatcat:pt7rpsmdjzfs7px5ba75islje4