CONVEX SET
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.
Get Quantitative Techniques: Theory and Problems now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
