{{distinguish2|[[Benson's algorithm (Go)]], a method to find the unconditionally alive stones in the game [[Go (game)|Go]]}}
'''Benson's algorithm''', named after [[Harold Benson]], is a method for solving [[linear programming|linear]] [[multi-objectivevector optimization]] problems. This works by finding the "efficient extreme points in the outcome set".<ref name="Benson">{{cite doi|10.1023/A:1008215702611}}</ref> The primary concept in Benson's algorithm is to evaluate the upper image of the vector optimization problem by [[cutting-plane method|cutting planes]].<ref name="Lohne">{{cite book|title=Vector Optimization with Infimum and Supremum|author=Andreas Löhne|publisher=Springer|year=2011|isbn=9783642183508|pages=162-169}}</ref>
