Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets
DOI10.1007/S10957-010-9721-2zbMATH Open1213.90204OpenAlexW2071235713MaRDI QIDQ613601FDOQ613601
Authors: Nguyen Van Thoai 
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
Recommendations
- On optimization over the efficient set in linear multicriteria programming
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
- Methods for solving some classes of reverse convex programs
- Convex programs with an additional reverse convex constraint
- Maximizing a concave function over the efficient or weakly-efficient set
global optimizationmultiple criteria optimizationoptimization over the efficient setbranch and bound methodsreverse convex programsspace of extreme criteria
Cites Work
- DC programming: overview.
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Title not available (Why is that?)
- Title not available (Why is that?)
- Introduction to global optimization.
- Reverse convex programming
- Convergent Algorithms for Minimizing a Concave Function
- Algorithms for the vector maximization problem
- Optimization over the efficient set
- Optimization over the efficient set: overview
- Optimization over the efficient set
- Maximizing a concave function over the efficient or weakly-efficient set
- Title not available (Why is that?)
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- Decomposition branch and bound algorithm for optimization problems over efficient sets
- 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
- On optimization over the efficient set in linear multicriteria programming
- Conical algorithm in global optimization for optimizing over efficient sets
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- Linear programs with an additional reverse convex constraint
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
- Title not available (Why is that?)
- Optimization Problems Subject to a Budget Constraint with Economies of Scale
- Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type
- Concave minimization via conical partitions and polyhedral outer approximation
Cited In (7)
- Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection
- A subgradient-based convex approximations method for DC programming and its applications
- Criteria and dimension reduction of linear multiple criteria optimization problems
- Technical efficiency and distance to a reverse convex set
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
- On optimization over the efficient set in linear multicriteria programming
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
This page was built for publication: Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613601)
