Decomposition branch and bound algorithm for optimization problems over efficient sets

DOI10.3934/JIMO.2008.4.647MaRDI QIDQ1008773zbMATH OpenOpenAlexFDO

Authors 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

decompositionnonconvex programmingbranch and boundmulti-criteria optimizationreverse convex constraintoptimization over efficient set

Mathematics Subject Classification ID

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

Recommendations

• A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
• Optimization over the efficient set: overview
• Maximizing a concave function over the efficient or weakly-efficient set
• On optimization over the efficient set in linear multicriteria programming
• An algorithm for optimizing over the efficient set of a multiple objective affine fractional problem.

Cited in

(10)

• scientific article; zbMATH DE number 5846648 (Why is no real title available?)
• Criteria and dimension reduction of linear multiple criteria optimization problems
• An algorithm for optimizing over the efficient set of a multiple objective affine fractional problem.
• scientific article; zbMATH DE number 3997557 (Why is no real title available?)
• Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets
• Conical algorithm in global optimization for optimizing over efficient sets
• Bisection search algorithm for optimizing over the efficient set
• Combination between global and local methods for solving an optimization problem over the efficient set
• Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection
• Effective branching splitting method under cost constraint

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1008773)