Multi-objective linear programming: Difference between revisions

Revision as of 02:23, 10 September 2017

Revision as of 18:45, 22 September 2017

Line 37:

Multiobjective variants of the simplex algorithm are used to compute decision set based solutions<ref name="EckerKouada1978"></ref><ref name="EckerHegner1980"></ref><ref name="ArmandMalivert1991">{{cite journal|last1=Armand|first1=P.|last2=Malivert|first2=C.|title=Determination of the efficient set in multiobjective linear programming|journal=Journal of Optimization Theory and Applications|volume=70|issue=3|year=1991|pages=467–489|issn=0022-3239|doi=10.1007/BF00941298}}</ref> and objective set based solutions<ref name="RudloffUlus2016">{{cite journal|last1=Rudloff|first1=Birgit|last2=Ulus|first2=Firdevs|last3=Vanderbei|first3=Robert|title=A parametric simplex algorithm for linear vector optimization problems|journal=Mathematical Programming|volume=163|issue=1-2|year=2016|pages=213–242|issn=0025-5610|doi=10.1007/s10107-016-1061-z|arxiv=1507.01895}}</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=1510.04823}}</ref>

== Related problem classes ==