Share Share
Text size Increase font size Decrease font size

iconLittleGreen

Linear Programming

Bruce R. Feiring

Pub. date: 1986 | DOI: http://dx.doi.org/10.4135/9781412984751

Print ISBN: 9780803928503 | Online ISBN: 9781412984751

Share Share
Text size Increase font size Decrease font size

Little Green Book

APPENDIX 1: PROPERTIES OF LINEAR PROGRAMMING PROBLEMS

Suppose that any two points, 1 and 2 , are chosen from a closed region R. If these points are connected by a straight line segment and all of the points lying on this straight line segment are also contained in R, then the collection of points is called a convex set – that is, let 1 , 1 be any two points contained in a closed region R. If all points , where lie within R for all 1 and 2 , then the collection of points within R is a convex set. If a point of a convex set cannot be expressed as a linear combination of two other points from the convex set as in equation 1, then such a point is called an extreme point. Example : Vertices of polygons are extreme points. A point that is a combination of points 1 , 2 , …, ...

Users without a subscription are not able to see the full content on this page. Please, subscribe or login to access all Methods content.

Click here to see full text

Articles in Google Scholar by