Beruflich Dokumente
Kultur Dokumente
WHAT IS LPP?
According to Prof. George B.Dantzing, linear programming is a technique which is applicable to those programming problems in which the desired objective as well as the restrictions on the resources give rise to linear functions.
According to Galton, linear programming is a mathematical device for determining the optimal solution of resources and obtaining a particular objective where there are alternative uses of resources, i.e. Man, material, machinery and money.
TERMINOLOGY USED
Inequalities- In linear programming the direct relationship between variables is presented in the form of inequalities. The relation should be linear. Objective Function- The primary objective of a businessman is to get maximum income for which he puts the efforts to maximize the profit or to minimize the cost. Feasible Solution- The feasible solution finds the best combination of the production for achieving objective function. Feasible solution is what satisfies all restrictions, controls. Corner Points- Different angles of production possibility curve are known as corner points.
CHARACTERSTICS OF LPP
There should be a well-defined objective of linear
programming. The main objective of a manufacturer is either to maximize profit or to minimize profit. To solve the problem of linear programming different course or action could be determined. The resources should be available in a limited quantity because linear programming is not required if the resources are available in unlimited larger quantity. The problem of linear programming should be represented in the form of mathematical equations.
cont .
Step 3:
a.
Y 90
80 70 60 50 40 (0,36) 30 20 10 (0,45) 2x1 + 5x2 < 180 B (15,30) 3x1 + 3x2 < 135
(45,0) D 10 20 30 40 C 50 60 70 80
(90,0) X 90
<
>
intersection point of common feasible regions by using simultaneous equation method. (2x1 + 5x2 = 180) * 3 (3x1 + 3x2 = 35) * 2 6x1 + 5x2 = 540 6x1 + 6x2 = 270 9x2 = 270 x2 = 270 = 30 9
Step 7: Calculate the profit or the cost on all the corner points. max Z: 2000x1 + 3000x2
A (0,36) = 2000 * 0 + 3000 * 36 = 1,08,000/B (15,30) = 2000 * 15 + 30000 * 30 = 1,20,000/C (45,0) = 2000 * 45 + 3000 * 0 = 90,000/D (0,0) = 0
***
THANK YOU