Geometric Duality in Multiple Objective Linear Programming
From MaRDI portal
Recommendations
- On duality in multiple objective linear programming
- Geometric duality for convex vector optimization problems
- Geometric duality and parametric duality for multiple objective linear programs are equivalent
- scientific article; zbMATH DE number 4158394
- Generalized duality and the geometry of linear programming
Cited in
(40)- Using multiobjective optimization to map the entropy region
- Geometric consideration of duality in vector optimization
- On duality in multiple objective linear programming
- Geometric duality for convex vector optimization problems
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems
- Geometric programming and dual entropy-optimization problem
- Solution concepts in vector optimization: a fresh look at an old story
- scientific article; zbMATH DE number 4131969 (Why is no real title available?)
- On the Primal-Dual Geometry of Level Sets in Linear and Conic Optimization
- The \(L\)-shape search method for triobjective integer programming
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- A vector linear programming approach for certain global optimization problems
- Tractability of convex vector optimization problems in the sense of polyhedral approximations
- Set-valued duality theory for multiple objective linear programs and application to mathematical finance
- PaMILO: a solver for multi-objective mixed integer linear optimization and beyond
- Relaxations and duality for multiobjective integer programming
- Generalized duality and the geometry of linear programming
- Geometric duality and parametric duality for multiple objective linear programs are equivalent
- An algorithm for calculating the set of superhedging portfolios in markets with transaction costs
- The weighted \(p\)-norm weight set decomposition for multiobjective discrete optimization problems
- An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems
- Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes
- scientific article; zbMATH DE number 4031395 (Why is no real title available?)
- A Fenchel-Moreau theorem for \bar L^0-valued functions
- Primal and dual approximation algorithms for convex vector optimization problems
- An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
- Strictly feasible solutions and strict complementarity in multiple objective linear optimization
- A Fenchel-Rockafellar duality theorem for set-valued optimization
- Primal and dual algorithms for optimization over the efficient set
- Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver
- An alternative approach to the refined duality theory of geometric programming
- Two‐phase strategies for the bi‐objective minimum spanning tree problem
- scientific article; zbMATH DE number 16510 (Why is no real title available?)
- Benson type algorithms for linear vector optimization and applications
- A survey of exact and approximation algorithms for linear-parametric optimization problems
- Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions
- Set Optimization—A Rather Short Introduction
- The vector linear program solver \textit{Bensolve} -- notes on theoretical background
- Linear vector optimization and European option pricing under proportional transaction costs
- Output-sensitive algorithms for enumerating the extreme nondominated points of multiobjective combinatorial optimization problems
This page was built for publication: Geometric Duality in Multiple Objective Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3629523)
