1. Linear Programming Gerald Chin Brandon Kong Jesse Chan Christopher Chiu

2. What is Linear Programming A linear programming problem may be defined as the problem of maximizing or minimizing a linear function subject to linear constraints. The constraints may be equalities or inequalities.

3. process of taking various linear inequalities finding the "best" value obtainable under those conditions taking the limitations of materials and labor, and then determining the "best" production levels for maximal profits under those conditions.

4. part of a very important area of mathematics "optimization techniques used every day in the organization and allocation of resources dozens or hundreds of variables work with the simple (and graphable) two- variable linear case only in Algebra

5. graph the inequalities (called the "constraints") to form a walled-off area on the x,y-plane (called the "feasibility region you find the intersection points of the various pairs of lines "optimization equation“ can find the highest or lowest value.

6. Conc sion It h p th wo to I p ov th ci nci s th