June 2006
Beginner
793 pages
20h 59m
English
The extreme points of a convex polygon are the points of intersection of the lines bounding the feasible region. The value of the decision variables which maximise or minimise the objective function is located on one of the extreme points of the convex polygon. If the maximum or minimum value of a linear function defined over a convex polygon exists, then it must be on one of the extreme points.
Read now
Unlock full access