Benson's algorithm
Benson's algorithm, named after , is a method for solving multi-objective linear programming problems and vector linear programs. This works by finding the "efficient extreme points in the outcome set". The primary concept in Benson's algorithm is to evaluate the upper image of the vector optimization problem by cutting planes.
primaryTopic
Benson's algorithm
Benson's algorithm, named after , is a method for solving multi-objective linear programming problems and vector linear programs. This works by finding the "efficient extreme points in the outcome set". The primary concept in Benson's algorithm is to evaluate the upper image of the vector optimization problem by cutting planes.
has abstract
Benson's algorithm, named afte ...... ion problem by cutting planes.
@en
Link from a Wikipage to an external page
Wikipage page ID
35,170,441
page length (characters) of wiki page
Wikipage revision ID
881,154,281
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
comment
Benson's algorithm, named afte ...... ion problem by cutting planes.
@en
label
Benson's algorithm
@en