Technical Note—Proper Efficiency and the Linear Vector Maximum Problem

Cited In (74)

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

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)