Scribd
Upload
36 views

Assignment 1 LPP Graphical Method

This document summarizes the steps to solve linear programming problems graphically. It provides 3 examples: 1) A problem with a unique optimal solution of (0,3), giving a maximum value of 33. 2) A problem with an unbounded solution since the lines defining the feasible region do not intersect at a single point. 3) A third problem to maximize Z=5x+6y, with steps to rewrite inequalities as equations, find intercepts to draw the lines, and determine the optimal solution by substituting points into the objective function.

Uploaded by

rawani_rizwan
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
36 views

Assignment 1 LPP Graphical Method

This document summarizes the steps to solve linear programming problems graphically. It provides 3 examples: 1) A problem with a unique optimal solution of (0,3), giving a maximum value of 33. 2) A problem with an unbounded solution since the lines defining the feasible region do not intersect at a single point. 3) A third problem to maximize Z=5x+6y, with steps to rewrite inequalities as equations, find intercepts to draw the lines, and determine the optimal solution by substituting points into the objective function.

Uploaded by

rawani_rizwan
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 7

Assignment -1

Graphical Method to solve LPP Problems.


Subject: - Decision Modeling


Submitted by
Roll No. 14230005
Irfan Dhanani
M tech 1
st
Sem.
Branch:-Industrial engineering and Management
NIT, Raipur







Graphical method to solve the following linear programming
problem.
Q.1 ( Unique solution)
Maximize z =4x + 11y
subject to constrain x+y
2x+ y
x y
solution :- first rewrite each inequality as an equation and then number the
inequalities and find the x- and y-intercepts for each line.
x + y =3
x+0= 3 0+y=3
x=3 y=3 .(1)
similarly for equation
2x+y=4
X= 2 y=4 .(2)
Draw the line one & two on graph

Finally, substitute each point into the objective function to determine the
optimal solution.


The maximum value is 33 and it occurs at (0,3)

Q.2 (unbounded solution)

solution :- first rewrite each inequality as an equation and then number the
inequalities and find the x- and y-intercepts for each line.

Similarly

Draw the line one & two on graph

Finally, substitute each point into the objective function to determine the
optimal solution.



Q.3 Maximize Z = 5x+6y

Solution :- first rewrite each inequality as an equation and then number the
inequalities and find the x- and y-intercepts for each line.





Draw the line one & two on graph

Draw the line one & two on graph


*******************************

You might also like