Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
25 views

Linear Programming Problem

This document defines and provides examples of linear programming problems (LPP). LPP deals with determining the optimal allocation of limited resources to meet objectives. The objectives are typically to maximize profit or minimize costs. LPP requires that the objective function and constraints be expressed as linear equations or inequalities of the decision variables. Two examples are provided of formulating LPP to maximize profit given constraints on machine hours and department hours.

Uploaded by

kkarpagam
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
25 views

Linear Programming Problem

This document defines and provides examples of linear programming problems (LPP). LPP deals with determining the optimal allocation of limited resources to meet objectives. The objectives are typically to maximize profit or minimize costs. LPP requires that the objective function and constraints be expressed as linear equations or inequalities of the decision variables. Two examples are provided of formulating LPP to maximize profit given constraints on machine hours and department hours.

Uploaded by

kkarpagam
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Linear Programming Problem

K Karpagam
Assistant Professor of Mathematics
PG & Research Department of Mathematics
Sri Ramakrishna College of Arts & Science, Coimbatore

http://www.free-powerpoint-templates-design.com
LINEAR PROGRAMMING PROBLEM
Definition :
Linear Programming Problem [LPP] deals with determining optimal
allocation of limited resources to meet given objectives . The resources
may be in the form of men , raw material , marked demand , money
and machines etc .
•Programming means planning . All the relationship between the
variables considered in this problems are linear . Hence the name
Linear Programming Problem [LPP] .
•The objective is maximizing the profit and minimizing the total cost .
Types :
•Maximization problems such as maximize the profit
•Minimization problems such as minimize the cost
Requirements for employing LPP technique :
•There must be a well defined objective function
•There must be alternative sources of action to choose
•At least some of the resources must be in the supply , which give rise to
constraints must be linear equations or inequalities
Mathematical Formulation of [LPP]
Objective Function :
Minimize or Maximize :
Z = c 1x 1 + c 2x 2 + … + c n x n
Subject to the Constraints
a11x1 + a12x2 + …+ a1nxn ≤ (or) = (or) ≥ bm
a21x1 + a22x2 + …+ a2nxn ≤ (or) = (or) ≥ bm
.
.
.
am1 x1 + am2 x2 + …+ amnxn ≤ (or) = (or) ≥ bm
and the non – negativity restrictions x1 , x2 , x3 , … xn ≥ 0
Formulation of LPP :
Step : 1 : Identify the unknown decision variables to be determined and
assign symbols to them.
Step : 2 : Identify all the restrictions or constraints (or influence factors) in
the problem and express them as linear equations or inequalities of decision
variables .
Step : 3 : Identify the objective or aim and represent it also as a linear
function of decision variables .
Step : 4 : Express the complete formulation of LPP as general mathematical
model .
Note : We consider only those situations where this will help the reader to
put proper inequalities in the formulation .
Problem :
1) A firm manufactures two types of products A and B and sells
them at a profit of Rs. 2 on type A and Rs. 3 on type B . Each
product is processed on two machines M1 and M2 . Type A requires
1 minute of process time on M1 and 2 min on M2 . Type B requires
1 minute on M1 and 1 minute on M2 . Machine M1 is available for
not more than 6 hours 40 minutes while machine M2 is available
for 10 hours during any working day . Formulate the problem as a
LPP so as to maximize the profit .
Solution :
Let x1 be product A and x2 be product B
Objective function :
Maximize Z = 2x1 + 3x2
Subject to constraints
x1 + x2 ≤ 400
2x1 + x2 ≤ 600
Non – negativity
x1 , x2 ≥ 0 .
2) A company makes 3 product x , y , z which pass through three departments drill , lath ,
assembling the hours available in each department , hours required by each product in each
department and profit contribution of each product is given below .
Time required in hours

Product Drill Lathe Assembly Profit for unit (Rs)

X (x1) 3 3 8 9
Y (x2) 6 5 10 15
Z (x3) 7 4 12 20
Hours available 210 , 240 , 260 . Formulate the above as an LPP .
Solution :
Let x1 be the product of X , x2 be the product of Y and x3 be the product of Z
Objective function :
Maximize Z = 9x1 + 15x2 + 20x3
Subject to constraints
3x1 + 6x2 + 7x3 ≤ 210
3x1 + 5x2 + 4x3 ≤ 240
8x1 + 10x2 + 12x3 ≤ 260
Non – negativity
x1 , x2 , x3 ≥ 0

You might also like