Scribd
Upload
43 views11 pages

Submitted To DR Divya Gupta

The document discusses linear programming problems (LPP), which aim to obtain optimal solutions for problems with constraints by using linear relationships between variables. LPP involves defining an objective function and constraints, and can be used to solve problems in areas like production, transportation, and portfolio selection. Examples are provided of solving LPP problems graphically to maximize and minimize objective functions subject to given constraints.

Uploaded by

Rahul Neelakantan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
43 views11 pages

Submitted To DR Divya Gupta

The document discusses linear programming problems (LPP), which aim to obtain optimal solutions for problems with constraints by using linear relationships between variables. LPP involves defining an objective function and constraints, and can be used to solve problems in areas like production, transportation, and portfolio selection. Examples are provided of solving LPP problems graphically to maximize and minimize objective functions subject to given constraints.

Uploaded by

Rahul Neelakantan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

SUBMITTED BY:

SUBMITTED TO RAHUL KUMAR BM018228


RAHUL N BM018229
Dr DIVYA GUPTA RAJ VARDHAN BM018230
RAJNEESH JEET BM018231
RAJAT AGARWAL BM018232
LINEAR PROGRAMMING PROBLEM

 LPP is used for obtaining optimal solution for problem with given
constraint.

 Involves objective function and linear inequalities.

 A method used to achieve mathematical model solution by using


linear relationship.
OBJECTIVE
Maximize the Profit and Minimize the Cost

Essential Conditions to satisfy the LPP


Limited Divisibility Homogeneit
Resources y
REQUIREMENTS

 There must be a well-defined objective function.

 There must be a constraint on the amount.

 Must be an alternative course of action.

 Resources must be limited in supply.


APPLICATIONS

• Industrial Application: Product mix problem, Blending problem,


Assembly line balancing,
• Product scheduling problem, Make or buy problems.
• Management Applications: Portfolio selection problem, Media
selection problem, Profit
• planning & Transportation problem.
• Miscellaneous Application: Diet problem, Agricultural problem, Flight
scheduling problem,
• Facilities location problem.
Q1.Find solution using graphical method
(Maximization)
• MAX z = 40x1 + 35x2
• subject to
• 2x1 + 3x2 <= 60
• 4x1 + 3x2 <= 96
• and x1, x2 >= 0
The maximum value of the objective function Z = 1000 occurs at extreme
point (18, 8)
Hence optimal solution to the given LPP problem is X1 = 18, X2 = 8
Q2.Find solution using graphical method
(Minimization)

• MIN z = 40x1 + 24x2


subject to
20x1 + 50x2 >= 4800
80x1 + 50x2 >= 7200
and x1,x2 >= 0
The minimum value of the objective function Z = 3456 occurs at the extreme
point (0,144).
Hence the optimal solution to the given LPP is X1 = 0, X2 = 144

You might also like