Abstract
A decomposition-based algorithm is presented in this work for the parametric solution of mixed integer optimization problems and, in extension, the identification of the noninferior solutions in multiobjective optimization problems involving discrete decisions. The initial multiobjective problem is formulated as a parametric mixed integer nonlinear programming problem (pMINLP) and an upper- and lower- bounding method is developed for the construction of the noninferior solution curve in an iterative procedure.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
