Polyhedron
Reference work entry
First Online:
DOI: https://doi.org/10.1007/1-4020-0611-X_769
- 19 Downloads
The solution space defined by the intersection of a finite number of linear constraints, an example of which is the solution space of a linear-programming problem. Such a space is convex. Convex set; Linear programming.
Copyright information
© Kluwer Academic Publishers 2001