VividLex

Home / Thesaurus / simplex method

Thesaurus: simplex method

a method for solving problems in linear programming that tests adjacent vertices of the feasible set in sequence so that at each new vertex the objective function improves or is unchanged.

Full dictionary entry Search Lens associations

Related headwords

adjacentdefinitionfeasibledefinitionfunctiondefinitionimprovesdefinitionlineardefinitionmethoddefinitionnewdefinitionobjectivedefinitionproblemsdefinitionprogrammingdefinitionsequencedefinitionsetdefinitionsolvingdefinitiontestsdefinitionunchangeddefinitionvertexdefinitionverticesdefinitionsimple-mindedfamilysimplenessfamilysimplerfamilysimplessfamilysimplestfamilysimpletonfamilysimpletonsfamilysimplexfamilysimplex algorithmfamilysimplex machinefamilysimplicianfamily

Definitions

  1. n. a method for solving problems in linear programming that tests adjacent vertices of the feasible set in sequence so that at each new vertex the objective function improves or is unchanged.