Technical Note—Proper Efficiency and the Linear Vector Maximum Problem

Cited in

(77)

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

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)