Year+10+Hope+SOLE+LP

Linear programming is the process of taking various linear inequalities relating to some situation, and finding the "best" value obtainable under those conditions. A typical example would be taking the limitations of materials and labor, and then determining the "best" production levels for maximal profits under those conditions. In "real life", linear programming is part of a very important area of mathematics called "optimization techniques". This field of study (or at least the applied results of it) are used every day in the organization and allocation of resources. These "real life" systems can have dozens or hundreds of variables, or more. In algebra, though, you'll only work with the simple (and graphable) two-variable linear case. How it works These three equations represent the three constraints described in the last paragraph. So once you’ve got your objective function and your constraint equations or inequations, you can plot a graph. Now, what goes on the axes of this graph? Well, we have three variables – ‘A’, ‘B’ and ‘P’. In linear programming, the graph shows the constraints of the problem. Look at the three constraint equations – they only have variables ‘A’ and ‘B’ in them. We use each of these variables for the axes. Which one you use for which axis doesn’t really matter. Uses & Advantage 1.The linear programming technique helps to make the best possible use of available productive resources (such as time, labour, machines etc.) 2. In a production process, bottle necks may occur. For example, in a factory some machines may be in great demand while others may lie idle for some time. A significant advantage of linear programming is highlighting of such bottle nec || ||
 * Group || Computer || Condition || Members || Presentation ||  ||
 * 1 || 129 ||  || Ying Ying, Cherry, Janice, Phyllis || What is Linear Programming?
 * 2 || 156 || none || Isaac Chan, Chris Yu, Jason Ng, WaIter Leung || [[file:Linear Programming.ppt]] ||
 * 3 || 112 || None || Samuel, Adriel, Ray, Leo || [[file:Linear programming Samuel.ppt]] ||
 * 4 || 143 || None || Gigi pang, Jesse Ng, Sandra Lee, Stephanie Suen || []
 * 5 || 145 || none || empty || N/A ||
 * 6 || 146 || None || Brandon Kong, Jesse Chan, Gerald Chin, Christopher Chiu || [[file:Linear Programming.ppt]] ||