Pages that link to "Item:Q427391"
From MaRDI portal
The following pages link to A dual variant of Benson's ``outer approximation algorithm'' for multiple objective linear programming (Q427391):
Displayed 17 items.
- The \(L\)-shape search method for triobjective integer programming (Q298165) (← links)
- Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming (Q343821) (← links)
- Characterizing coherence, correcting incoherence (Q473384) (← links)
- Primal and dual approximation algorithms for convex vector optimization problems (Q475807) (← links)
- A parametric simplex algorithm for linear vector optimization problems (Q526835) (← links)
- An approximation algorithm for convex multi-objective programming problems (Q548180) (← links)
- A semidefinite programming approach for solving multiobjective linear programming (Q742135) (← links)
- Benson type algorithms for linear vector optimization and applications (Q743969) (← links)
- Approximating the nondominated set of an MOLP by approximately solving its dual problem (Q999127) (← links)
- A recursive algorithm for multivariate risk measures and a set-valued Bellman's principle (Q2397431) (← links)
- Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes (Q2790887) (← links)
- Set Optimization—A Rather Short Introduction (Q2805754) (← links)
- PolySCIP (Q2819226) (← links)
- Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems (Q3452793) (← links)
- An algorithm to solve polyhedral convex set optimization problems (Q4916312) (← links)
- AN ALGORITHM FOR CALCULATING THE SET OF SUPERHEDGING PORTFOLIOS IN MARKETS WITH TRANSACTION COSTS (Q4979885) (← links)
- Using multiobjective optimization to map the entropy region (Q5963309) (← links)