June 2006
Beginner
793 pages
20h 59m
English
A set (or region) is convex if only if for any two points on the set, the line segment joining those points lies entirely in the set. Thus, the collection of feasible solutions in a linear programming problem form a convex set. In other words, the feasible region of a linear programming problem is a convex set.
Read now
Unlock full access