Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
From MaRDI portal
Publication:5183262
Cited in
(74)- On efficient solutions for semidefinite linear fractional vector optimization problems
- Sequential optimality theorems for second-order cone linear fractional vector optimization problems
- Relaxations and duality for multiobjective integer programming
- Optimization of a quadratic programming problem over an Integer efficient set
- Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach
- Characterizations via linear scalarization of minimal and properly minimal elements
- Definition and characterization of Geoffrion proper efficiency for real vector optimization with infinitely many criteria
- Application of vector optimization processes in large-scale models
- Notes on the value function approach to multiobjective bilevel optimization
- Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint
- An indefinite quadratic optimization over an integer efficient set
- A note on approximate proper efficiency in linear fractional vector optimization
- A multi-objective interpretation of optimal transport
- The search-and-remove algorithm for biobjective mixed-integer linear programming problems
- Efficiency in linear fractional vector maximization problem with nonlinear constraints
- Kuhn-Tucker multipliers as trade-offs in multiobjective decision-making analysis
- On efficient sets in vector maximum problems - A brief survey
- Stability in vector maximization - a survey
- Outcome space partition of the weight set in multiobjective linear programming
- Proper Efficiency in Convex Vector Minimum Problems
- Approximating the noninferior set in multiobjective linear programming problems
- Inverse programming and the linear vector maximization problem
- A bicriteria approach to robust optimization
- On some relations between a dual pair of multiple objective linear programs
- Value functions, domination cones and proper efficiency in multicriteria optimization
- Properly efficient Nash equilibrium in multicriteria noncooperative games
- Efficient solutions for the bicriteria network flow problem
- On constraint qualification in multiobjective optimization problems: Semidifferentiable case
- Vector variational inequalities for nondifferentiable convex vector optimization problems
- Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization
- On linear vector program and vector matrix game equivalence
- Set-valued duality theory for multiple objective linear programs and application to mathematical finance
- Technical note: Games with vector payoffs
- Optimality theorems for convex semidefinite vector optimization problems
- Bicriteria and restricted 2-facility Weber problems
- On the transformation of lexicographic nonlinear multiobjective programs to single objective programs
- A two-phase algorithm for the biobjective integer minimum cost flow problem
- Redundant objective functions in linear vector maximum problems and their determination
- PolySCIP
- Robust multiobjective optimization with application to Internet routing
- Tradeoff directions in multiobjective optimization problems
- Classical linear vector optimization duality revisited
- Efficiency in multiple objective optimization problems
- Discrete representation of non-dominated sets in multi-objective linear programming
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Optimizing a linear fractional function over the integer efficient set
- Optimizing a linear function over an efficient set
- Multiple objective minimum cost flow problems: a review
- Pseudolinearity and efficiency
- Admissible points of a convex polyhedron
- On a domination property for vector maximization with respect to cones
- Designing communication networks for distributed control agents.
- Efficiency and proper efficiency in nonlinear vector maximum problems
- Approximating the noninferior set in linear biobjective programs using multiparametric decomposition
- Concepts of proper efficiency
- Trade-off ratio functions for linear and piecewise linear multi-objective optimization problems
- A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems
- Proper efficiency in a linear fractional vector maximum problem with generalized convex constraints
- Generation of some methods for solving interval multi-objective linear programming models
- An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint
- Soluciones no dominadas en problemas multiobjetivo
- On efficiency in nonlinear fractional vector maximization problem
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- Fast and fine quickest path algorithm
- An exact algorithm for biobjective mixed integer linear programming problems
- Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test
- Existence of efficient solutions for vector maximization problems
- Duality theory for the matrix linear programming problem
- On sensitivity analysis for multicriteria optimization
- Optimization of a linear function over an integer efficient set
- Duality theory for infinite-dimensional multiobjective linear programming
- Multiple-objective programming with polynomial objectives and constraints
This page was built for publication: Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5183262)