Linear Programming
Linear Programming
Lecture Outline
Model Formulation Graphical Solution Method Linear Programming Model Solution Solving Linear Programming
A model consisting of linear relationships representing a firms objective and resource constraints
LP is a mathematical modeling technique used to determine a level of operational activity in order to achieve an objective, subject to restrictions called constraints
technique for optimum allocation of limited or scarce resources, such as labour, material, machine, money, energy and so on , to several competing activities such as products, services, jobs and so on, on the basis of a given criteria of optimality.
proportionate relationship of two or more variables in a model. The given change in one variable will always cause a resulting proportional change in another variable.
specify a sort of planning that involves the economic allocation of limited resources by adopting a particular course of action or strategy among various alternatives strategies to achieve the desired objective.
LP Model Example
Profit/unit (Rs) Raw material (kg) Labour 40 A 2 35 B 3 Daily Availability 60
96
LP Formulation: Example
Let x=Number of units of product A Let Y=Number of units of product B Maximize z = 40x+35y(objective function) 2x+3y 60(Raw material constraint) 4x+3y 96(Labour constraint) x 0 , y 0 (Non- Negativity)
3 2 3 0 2 8 2 6 2 Y 4 2 C 0 1 6 1 2 8 FEASIBLE 4 0 (0,0 )
(x= 0)
REGION
4 8 1 2 1 6 X 2 0 2 4
A 2 6 2 8 3 0
(Y= 0)
(x= 0)
2 4 2 0 1 6 1 2 8 4 0 (0,0 )
Fe as ib le
Re gi on B
A 4 8 1 2 1 6 2 0 2 4
(Y= 0)