Pages that link to "Item:Q3629523"
From MaRDI portal
The following pages link to Geometric Duality in Multiple Objective Linear Programming (Q3629523):
Displaying 25 items.
- The \(L\)-shape search method for triobjective integer programming (Q298165) (← links)
- A dual variant of Benson's ``outer approximation algorithm'' for multiple objective linear programming (Q427391) (← links)
- Primal and dual approximation algorithms for convex vector optimization problems (Q475807) (← links)
- On duality in multiple objective linear programming (Q531426) (← links)
- Benson type algorithms for linear vector optimization and applications (Q743969) (← links)
- An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem (Q785628) (← links)
- Set-valued duality theory for multiple objective linear programs and application to mathematical finance (Q1014298) (← links)
- Strictly feasible solutions and strict complementarity in multiple objective linear optimization (Q1680765) (← links)
- The vector linear program solver Bensolve -- notes on theoretical background (Q1753500) (← links)
- A vector linear programming approach for certain global optimization problems (Q1756780) (← links)
- Tractability of convex vector optimization problems in the sense of polyhedral approximations (Q1756800) (← links)
- Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions (Q2423818) (← links)
- Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes (Q2790887) (← links)
- Set Optimization—A Rather Short Introduction (Q2805754) (← links)
- Linear Vector Optimization and European Option Pricing Under Proportional Transaction Costs (Q2805756) (← links)
- Solution concepts in vector optimization: a fresh look at an old story (Q3111144) (← links)
- A Fenchel–Rockafellar duality theorem for set-valued optimization (Q3112501) (← links)
- Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems (Q3452793) (← links)
- Primal and dual algorithms for optimization over the efficient set (Q4646523) (← links)
- A Fenchel-Moreau theorem for $\bar L^0$-valued functions (Q4967852) (← links)
- AN ALGORITHM FOR CALCULATING THE SET OF SUPERHEDGING PORTFOLIOS IN MARKETS WITH TRANSACTION COSTS (Q4979885) (← links)
- Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver (Q5198001) (← links)
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems (Q5883318) (← links)
- Using multiobjective optimization to map the entropy region (Q5963309) (← links)
- Two‐phase strategies for the bi‐objective minimum spanning tree problem (Q6060666) (← links)