Conical algorithm in global optimization for optimizing over efficient sets
From MaRDI portal
Publication:5929998
DOI10.1023/A:1026544116333zbMath1026.90081MaRDI QIDQ5929998
Publication date: 23 April 2002
Published in: Journal of Global Optimization (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)
Related Items
Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set, Optimizing over the properly efficient set of convex multi-objective optimization problems, Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets, Holistic fleet optimization incorporating system design considerations, Existence results and optimization over the set of efficient solutions in vector-valued approximation theory, Computation of ideal and Nadir values and implications for their use in MCDM methods., An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem, Criteria and dimension reduction of linear multiple criteria optimization problems, Primal and dual algorithms for optimization over the efficient set, On optimization over the efficient set in linear multicriteria programming, Convergence and application of a decomposition method using duality bounds for nonconvex global optimization, The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems, Combination between global and local methods for solving an optimization problem over the efficient set
