Optimization over the efficient set: Four special cases
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3936913 (Why is no real title available?)
- scientific article; zbMATH DE number 3945836 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- A survey of multicriteria optimization or the vector maximum problem. I: 1776-1960
- Algorithms for the vector maximization problem
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- An algorithm for optimizing over the weakly-efficient set
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- Bicriteria Transportation Problem
- Careful usage of pessimistic values is needed in multiple objectives optimization
- Complete efficiency and the initialization of algorithms for multiple objective programming
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- Constrained global optimization: algorithms and applications
- Convex Analysis
- Efficiency in multiple objective optimization problems
- Generating all maximal efficient faces for multiple objective linear programs
- Generation of the Admissible Boundary of a Convex Polytope
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Optimization over the efficient set
- Optimization over the efficient set using an active constraint approach
- Solving Bicriterion Mathematical Programs
- Testing for complete efficiency in a vector maximization problem
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Theory of multiobjective optimization
- Vector maximization with two objective functions
Cited in
(18)- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
- An exact penalty on bilevel programs with linear vector optimization lower level
- A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
- Second-order efficiency conditions and sensitivity of efficient points
- Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- Optimization over the efficient set: overview
- Optimizing a linear function over an efficient set
- scientific article; zbMATH DE number 592648 (Why is no real title available?)
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
- Optimization over the efficient set
- Cone characterizations of approximate solutions in real vector optimization
- Existence results and optimization over the set of efficient solutions in vector-valued approximation theory
- Optimizing a linear function over an integer efficient set
- Quantitative parametric connections between methods for generating noninferior solutions in multiobjective optimization
- A linear fractional optimization over an integer efficient set
- Optimization over the efficient set of a parametric multiple objective linear programming problem
- Optimizing a linear function over the nondominated set of multiobjective integer programs
This page was built for publication: Optimization over the efficient set: Four special cases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1321439)
