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