Dictionary:Linear programming

Solution of a problem that involves constraints expressed as inequalities. For problems that involve many inequalities, involves searching the vertices of multidimensional polygons whose boundaries are determined by the constraints. Often solved by the simplex algorithm (which does not check every vertex). See Figure L-5.