Geometric Duality in Multiple Objective Linear Programming
From MaRDI portal
Publication:3629523
DOI10.1137/060674831zbMath1173.90530OpenAlexW2042818144MaRDI QIDQ3629523
Publication date: 27 May 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060674831
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05)
Related Items (25)
Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems ⋮ The \(L\)-shape search method for triobjective integer programming ⋮ A Fenchel-Moreau theorem for $\bar L^0$-valued functions ⋮ Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems ⋮ Strictly feasible solutions and strict complementarity in multiple objective linear optimization ⋮ Two‐phase strategies for the bi‐objective minimum spanning tree problem ⋮ Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions ⋮ A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming ⋮ Primal and dual approximation algorithms for convex vector optimization problems ⋮ Primal and dual algorithms for optimization over the efficient set ⋮ The vector linear program solver Bensolve -- notes on theoretical background ⋮ A vector linear programming approach for certain global optimization problems ⋮ Tractability of convex vector optimization problems in the sense of polyhedral approximations ⋮ On duality in multiple objective linear programming ⋮ Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes ⋮ Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver ⋮ Using multiobjective optimization to map the entropy region ⋮ Set Optimization—A Rather Short Introduction ⋮ Linear Vector Optimization and European Option Pricing Under Proportional Transaction Costs ⋮ Benson type algorithms for linear vector optimization and applications ⋮ Set-valued duality theory for multiple objective linear programs and application to mathematical finance ⋮ AN ALGORITHM FOR CALCULATING THE SET OF SUPERHEDGING PORTFOLIOS IN MARKETS WITH TRANSACTION COSTS ⋮ Solution concepts in vector optimization: a fresh look at an old story ⋮ A Fenchel–Rockafellar duality theorem for set-valued optimization ⋮ An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
This page was built for publication: Geometric Duality in Multiple Objective Linear Programming
