Mixed-integer nonlinear programming nonconvexities

Kocis, G. R., and Grossmann, I. E. Global Optimization of Nonconvex Mixed-Integer Nonlinear Programming (MINLP) Problems in Process Synthesis, Ind. Eng. Chem. Res. 27,1407 (1988). 

Kesavan P. and Barton P.l. 2000a. Decomposition algorithms for nonconvex mixed-integer nonlinear programs, Am. Inst. Chem. Eng. Symp. Ser., 96(323), 458-461. 

Tawarmalani M. and Sahinidis N.V. 2002. Convexification and global optimization in continuous and mixed-integer nonlinear programming Theory, algorithms, software, and apphcations. In, Nonconvex Optimization and Its Apphcations Series, Vol. 65. Kluwer Academic Publishers, Dordrecht. 

Both the mixing process and the approximation of the product profiles establish nonconvex nonlinearities. The inclusion of these nonlinearities in the model leads to a relatively precise determination of the product profiles but do not affect the feasibility of the production schedules. A linear representation of both equations will decrease the precision of the objective but it will also eliminate the nonlinearities yielding a mixed-integer linear programming model which is expected to be less expensive to solve. 

---