Revision as of 18:05, 21 August 2017 edit Giznej (talk \| contribs) 59 edits No edit summary ← Previous edit		Revision as of 18:07, 21 August 2017 edit undo Giznej (talk \| contribs) 59 edits No edit summary Next edit →
Line 24: Multiobjective variants of the simplex algorithm are used to compute decision set based solutions<ref name="EckerKouada1978"></ref><ref name="EckerHegner1980"></ref>. Objective set based solutions can be obtained by Benson's algorithm <ref>name="Benson1998"</ref><ref name="LöhneWeißing2017">{{cite journal\|last1=Löhne\|first1=Andreas\|last2=Weißing\|first2=Benjamin\|title=The vector linear program solver Bensolve – notes on theoretical background\|journal=European Journal of Operational Research\|volume=260\|issue=3\|year=2017\|pages=807–813\|issn=03772217\|doi=10.1016/j.ejor.2016.02.039\|arxiv=~~1507~~1510.~~00228v5~~04823}}</ref>. == Related problem classes == Multiobjective linear programming is equivalent to polyhedral projection<ref name="LöhneWeißing2016">{{cite journal\|last1=Löhne\|first1=Andreas\|last2=Weißing\|first2=Benjamin\|title=Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming\|journal=Mathematical Methods of Operations Research\|volume=84\|issue=2\|year=2016\|pages=411–426\|issn=1432-2994\|doi=10.1007/s00186-016-0554-0\|arxiv=1507.00228}}</ref>. == References ==

Multi-objective linear programming: Difference between revisions