Live briefing
Everything about Benson's algorithm
Benson's algorithm, named after Harold Benson, 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. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Benson's algorithmA 5-minute orientation
- Pick up a classic book: Modeling and Optimization: Theory and ApplicationsThe most-reprinted book on the subject
- Read the landmark paper: A Benson-type algorithm for bounded convex vector optimization problems with vertex selectionCited 16 times
- Go sideways: Multi-objective linear programmingA closely related topic
- Go sideways: Semidefinite programmingA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
đź“š Books worth reading
Modeling and Optimization: Theory and ApplicationsTamás Terlaky · 2012
Medicine meets virtual reality 13James D. Westwood · 2005
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Multi-objective linear programming Multi-objective linear programming is a subarea of mathematical optimization. A multiple objective linear program (MOLP) is a linear program with more…
- Semidefinite programming Semidefinite programming (SDP) is a subfield of mathematical programming concerned with the optimization of a linear objective function (a user-specified…
- Conic optimization Conic optimization is a subfield of convex optimization that studies problems consisting of minimizing a convex function over the intersection of an affine…
- Linear-fractional programming In mathematical optimization, linear-fractional programming (LFP) is a generalization of linear programming (LP). Whereas the objective function in a linear…
- Duality (optimization) In mathematical optimization theory, duality or the duality principle is the principle that optimization problems may be viewed from either of two perspectives…
- Dual linear program The dual of a given linear program (LP) is another LP that is derived from the original (the primal) LP in the following schematic way: Each variable in…
- Ellipsoid method In mathematical optimization, the ellipsoid method is an iterative method for minimizing convex functions over convex sets. The ellipsoid method generates…
- Vector optimization Vector optimization is a subarea of mathematical optimization where optimization problems with vector-valued objective functions are optimized with respect…