Pages that link to "Item:Q5183262"
From MaRDI portal
The following pages link to Technical Note—Proper Efficiency and the Linear Vector Maximum Problem (Q5183262):
Displaying 50 items.
- Fast and fine quickest path algorithm (Q296816) (← links)
- A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem (Q319360) (← links)
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems (Q319659) (← links)
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem (Q337491) (← links)
- A bicriteria approach to robust optimization (Q342179) (← links)
- An exact algorithm for biobjective mixed integer linear programming problems (Q342401) (← links)
- Optimality theorems for convex semidefinite vector optimization problems (Q425863) (← links)
- A dual variant of Benson's ``outer approximation algorithm'' for multiple objective linear programming (Q427391) (← links)
- Value functions, domination cones and proper efficiency in multicriteria optimization (Q583121) (← links)
- Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test (Q678981) (← links)
- Classical linear vector optimization duality revisited (Q691423) (← links)
- On linear vector program and vector matrix game equivalence (Q691454) (← links)
- An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint (Q706934) (← links)
- Technical note: Games with vector payoffs (Q762074) (← links)
- Multiple objective minimum cost flow problems: a review (Q853016) (← links)
- Properly efficient Nash equilibrium in multicriteria noncooperative games (Q890178) (← links)
- Efficiency and proper efficiency in nonlinear vector maximum problems (Q914558) (← links)
- A two-phase algorithm for the biobjective integer minimum cost flow problem (Q1000988) (← links)
- Set-valued duality theory for multiple objective linear programs and application to mathematical finance (Q1014298) (← links)
- On efficient sets in vector maximum problems - A brief survey (Q1068004) (← links)
- Stability in vector maximization - a survey (Q1074503) (← links)
- Duality theory for the matrix linear programming problem (Q1083374) (← links)
- Proper efficiency in a linear fractional vector maximum problem with generalized convex constraints (Q1108934) (← links)
- Admissible points of a convex polyhedron (Q1157772) (← links)
- On a domination property for vector maximization with respect to cones (Q1161684) (← links)
- Multiple-objective programming with polynomial objectives and constraints (Q1197675) (← links)
- Efficient solutions for the bicriteria network flow problem (Q1202272) (← links)
- Redundant objective functions in linear vector maximum problems and their determination (Q1245072) (← links)
- Existence of efficient solutions for vector maximization problems (Q1245164) (← links)
- Inverse programming and the linear vector maximization problem (Q1253615) (← links)
- Kuhn-Tucker multipliers as trade-offs in multiobjective decision-making analysis (Q1257828) (← links)
- On constraint qualification in multiobjective optimization problems: Semidifferentiable case (Q1280108) (← links)
- Approximating the noninferior set in multiobjective linear programming problems (Q1309915) (← links)
- Duality theory for infinite-dimensional multiobjective linear programming (Q1309919) (← links)
- Constrained qualifications in multiobjective optimization problems: Differentiable case (Q1321480) (← links)
- Optimizing a linear function over an efficient set (Q1342462) (← links)
- Bicriteria and restricted 2-facility Weber problems (Q1362675) (← links)
- Tradeoff directions in multiobjective optimization problems (Q1366425) (← links)
- Designing communication networks for distributed control agents. (Q1420380) (← links)
- Outcome space partition of the weight set in multiobjective linear programming (Q1579630) (← links)
- Optimizing a linear fractional function over the integer efficient set (Q1615942) (← links)
- Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach (Q1652278) (← links)
- Characterizations via linear scalarization of minimal and properly minimal elements (Q1653287) (← links)
- A multi-objective interpretation of optimal transport (Q1706409) (← links)
- Robust multiobjective optimization with application to Internet routing (Q1730555) (← links)
- Discrete representation of non-dominated sets in multi-objective linear programming (Q1751259) (← links)
- The search-and-remove algorithm for biobjective mixed-integer linear programming problems (Q1754323) (← links)
- Approximating the noninferior set in linear biobjective programs using multiparametric decomposition (Q1823867) (← links)
- Concepts of proper efficiency (Q1838911) (← links)
- On the transformation of lexicographic nonlinear multiobjective programs to single objective programs (Q1935897) (← links)
