NOTES: CHAPTER 5 LINEAR PROGRAMMINGLinear Programming is a branch of Mathematics that deals with systems of linear inequalities (called constraints) used to findi the maximum or minimum values of the object function.

Applications of the Linear Programming are evident in the field of:

3 common stages involved in solving Linear Programming problems: Interpret the information given as a system of inequalities and display them graphically

at least implies > less than implies <at most implies < more than implies >

Investigate some characteristics of the points in the unshaded solution region (region R)o Utilize “corner points” of R

Find the maximum/minimum value according to the object function needed.