Revision as of 06:47, 18 April 2017 edit Fglondon (talk \| contribs) 5 edits No edit summary ← Previous edit		Revision as of 06:49, 18 April 2017 edit undo Fglondon (talk \| contribs) 5 edits No edit summary Next edit →
Line 11: == Dual algorithm == There is a dual variant of Benson's algorithm<ref name="EhrgottLöhne2011">{{cite journal\|last1=Ehrgott\|first1=Matthias\|last2=Löhne\|first2=Andreas\|last3=Shao\|first3=Lizhen\|title=A dual variant of Benson’s “outer approximation algorithm” for multiple objective linear programming\|journal=Journal of Global Optimization\|volume=52\|issue=4\|year=2011\|pages=757–778\|issn=0925-5001\|doi=10.1007/s10898-011-9709-y}}</ref>, which is based on geometric duality<ref name="HeydeLöhne2008">{{cite journal\|last1=Heyde\|first1=Frank\|last2=Löhne\|first2=Andreas\|title=Geometric Duality in Multiple Objective Linear Programming\|journal=SIAM Journal on Optimization\|volume=19\|issue=2\|year=2008\|pages=836–845\|issn=1052-6234\|doi=10.1137/060674831}}</ref> for ~~multiple~~ multi-objective linear programs. == Implementations ==

Benson's algorithm: Difference between revisions