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.
- Comment
- enBenson'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
- enBenson'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.
- Hypernym
- Method
- Is primary topic of
- Benson's algorithm
- Label
- enBenson's algorithm
- Link from a Wikipage to an external page
- bensolve.org
- github.com/lcsirmaz/inner
- Link from a Wikipage to another Wikipage
- Benson's algorithm (Go)
- Category:Linear programming
- Category:Optimization algorithms and methods
- Cutting-plane method
- Extreme point
- Go (game)
- Harold Benson
- Multi-objective linear programming
- Multiobjective optimization
- Vector optimization
- SameAs
- 4Y7ro
- Benson's algorithm
- m.0j6759k
- Q4890227
- Subject
- Category:Linear programming
- Category:Optimization algorithms and methods
- WasDerivedFrom
- Benson's algorithm?oldid=881154281&ns=0
- WikiPageLength
- 2975
- Wikipage page ID
- 35170441
- Wikipage revision ID
- 881154281
- WikiPageUsesTemplate
- Template:Applied-math-stub
- Template:Distinguish
- Template:Reflist