Decomposition branch and bound algorithm for optimization problems over efficient sets

From MaRDI portal

Revision as of 21:10, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1008773

Jump to:navigation, search

DOI10.3934/jimo.2008.4.647zbMath1160.90654OpenAlexW2324203538MaRDI QIDQ1008773

Nguyen Van Thoai

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

zbMATH Keywords

decomposition nonconvex programming branch and bound multi-criteria optimization reverse convex constraint optimization over efficient set

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Linear programming (90C05)

Related Items (3)

Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets ⋮ Criteria and dimension reduction of linear multiple criteria optimization problems ⋮ Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection

This page was built for publication: Decomposition branch and bound algorithm for optimization problems over efficient sets

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1008773&oldid=13003064"