Maximizing a concave function over the efficient or weakly-efficient set
From MaRDI portal
Publication:1847166
DOI10.1016/S0377-2217(98)00230-6zbMATH Open0998.90074OpenAlexW1989822484MaRDI QIDQ1847166FDOQ1847166
Nguyen Van Thoai, Reiner Horst
Publication date: 17 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00230-6
Recommendations
- A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
- On optimization over the efficient set in linear multicriteria programming
- Optimizing a linear function over an efficient set
- scientific article; zbMATH DE number 1086738
- Optimization over the efficient set using an active constraint approach
global optimizationnonconvex programmingbranch and boundmultiple criteria analysisoptimization over efficient/weakly-efficient sets
Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Cites Work
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Title not available (Why is that?)
- Introduction to global optimization
- Algorithms for the vector maximization problem
- Optimization over the efficient set
- Optimization over the efficient set
- Title not available (Why is that?)
- Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- Utility function programs and optimization over the efficient set in multiple-objective decision making
- 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
- Minimization of a quasi-concave function over an efficient set
- Concave minimization via conical partitions and polyhedral outer approximation
Cited In (29)
- Semivectorial bilevel programming versus scalar bilevel programming
- Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint
- DC programming: overview.
- Optimality Conditions for Semivectorial Bilevel Convex Optimal Control Problems
- 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
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets
- Optimization over the efficient set of multi-objective convex optimal control problems
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- Conical algorithm in global optimization for optimizing over efficient sets
- A hybrid method for solving multi-objective global optimization problems
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
- Notes on the value function approach to multiobjective bilevel optimization
- An algorithm for maximizing a convex function over a simple set
- Semivectorial bilevel optimization problem: penalty approach
- Biobjective robust optimization over the efficient set for Pareto set reduction
- Optimization over the Pareto front of nonconvex multi-objective optimal control problems
- Stochastic optimization over a Pareto set associated with a stochastic multi-objective optimization problem
- A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
- Semivectorial bilevel optimization on Riemannian manifolds
- Post-Pareto analysis and a new algorithm for the optimal parameter tuning of the elastic net
- Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case
- Optimization over equilibrium sets∗
- On optimization over the efficient set in linear multicriteria programming
- Combination between global and local methods for solving an optimization problem over the efficient set
- On optimization over the efficient set of a multiple objective linear programming problem
- Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case
- Optimizing over the properly efficient set of convex multi-objective optimization problems
This page was built for publication: Maximizing a concave function over the efficient or weakly-efficient set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1847166)
