Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets
From MaRDI portal
Publication:613601
DOI10.1007/s10957-010-9721-2zbMath1213.90204OpenAlexW2071235713MaRDI QIDQ613601
Publication date: 21 December 2010
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-010-9721-2
global optimizationoptimization over the efficient setmultiple criteria optimizationbranch and bound methodsreverse convex programsspace of extreme criteria
Related Items
A subgradient-based convex approximations method for DC programming and its applications, 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, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization over the efficient set: overview
- Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- Concave minimization via conical partitions and polyhedral outer approximation
- Decomposition branch and bound algorithm for optimization problems over efficient sets
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Linear programs with an additional reverse convex constraint
- Reverse convex programming
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Maximizing a concave function over the efficient or weakly-efficient set
- A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- DC programming: overview.
- On optimization over the efficient set in linear multicriteria programming
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
- Convergent Algorithms for Minimizing a Concave Function
- Optimization Problems Subject to a Budget Constraint with Economies of Scale
- Algorithms for the vector maximization problem
- Optimization over the efficient set
- Optimization over the efficient set
- Introduction to global optimization.
- Conical algorithm in global optimization for optimizing over efficient sets
