Revision as of 17:35, 21 August 2017 edit Giznej (talk \| contribs) 59 edits No edit summary ← Previous edit		Revision as of 17:53, 21 August 2017 edit undo Giznej (talk \| contribs) 59 edits No edit summary Next edit →
Line 23: == Solution methods == Multiobjective variants of the simplex algorithm are used to compute decision set based solutions. Objective set based solutions can be obtained by Benson's algorithm <ref>name=Benson1998</ref>. * [[Benson's algorithm]] for ''linear'' vector optimization problems<ref name="Löhne2011"></ref>

Multi-objective linear programming: Difference between revisions