Decomposition branch and bound algorithm for optimization problems over efficient sets
From MaRDI portal
Publication:1008773
DOI10.3934/jimo.2008.4.647zbMath1160.90654MaRDI QIDQ1008773
Publication date: 30 March 2009
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2008.4.647
decomposition; nonconvex programming; branch and bound; multi-criteria optimization; reverse convex constraint; optimization over efficient set
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C26: Nonconvex programming, global optimization
90C29: Multi-objective and goal programming
90C05: Linear programming
Related Items
Criteria and dimension reduction of linear multiple criteria optimization problems, Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets, Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection