On optimization over the efficient set in linear multicriteria programming
From MaRDI portal
Publication:2471110
DOI10.1007/s10957-007-9219-8zbMath1146.90062OpenAlexW2072581479MaRDI QIDQ2471110
Reiner Horst, D. Zenke, Yoshitsugu Yamamoto, Nguyen Van Thoai
Publication date: 18 February 2008
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://tsukuba.repo.nii.ac.jp/record/9348/files/JOTA_134-3.pdf
Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Linear programming (90C05)
Related Items
A multiple objective programming approach to linear bilevel multi-follower programming, Optimization over the efficient set of multi-objective convex optimal control problems, Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets, Existence results and optimization over the set of efficient solutions in vector-valued approximation theory, Semivectorial bilevel optimization on Riemannian manifolds, Optimization over the Pareto front of nonconvex multi-objective optimal control problems, Criteria and dimension reduction of linear multiple criteria optimization problems, Stochastic optimization over a Pareto set associated with a stochastic multi-objective optimization problem, Optimality Conditions for Semivectorial Bilevel Convex Optimal Control Problems, Post-Pareto analysis and a new algorithm for the optimal parameter tuning of the elastic net, The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems, Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case, An exact method for computing the nadir values in multiple objective linear programming, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program, Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case
Cites Work
- 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
- Minimization of a quasi-concave function over an efficient set
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Reverse convex programming
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- Constraint decomposition algorithms in global optimization
- Utility function programs and optimization over the efficient set in multiple-objective decision making
- A global optimization method for minimum maximal flow problem
- Minimum maximal flow problem: An optimization over the efficient set
- Maximizing a concave function over the efficient or weakly-efficient set
- Combination between global and local methods for solving an optimization problem over the efficient set
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- DC programming: overview.
- A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- Global optimization method for solving the minimum maximal flow problem
- 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
