Solve the following linear programming graphically, Operation Research

Assignment Help:

Problem based on graphical solution of a given LPP when feasible region is bounded.

1.    Solve the following linear programming graphically;

Maximize and minimize z = 60x+ 15y subject to constraints

     X+y≤50 ; 3x+y≤90; x,y≥ 0

Script

1.    First of all let us draw the lines x+y=50 and 3x+y = 90 using suitable points on the graphs.

2.   The lines intersect at the point 20,30

3.   Now shade the region of intersection of the two lines.

4.   The shaded region gives the feasible region determined by the constraints

5.   Hence OABC is the bounded region

6.   Therefore we use corner point method to calculate the maximum and minimum values

7.   Vertices of feasible region are

8.   Now let us find the maximum and minimum values

9.   For the Corner point O (0,0)

10.                For the corner point Corner point  A(30,0)

11. For the corner point B (20,50)

12.                C(0,50)

13.                Hence the minimum value of Z is ) at (0,0) and

14.                Maximum value of Z is at (30,0)

 

Solution

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

7.O(0,0), A(30,0), B(20,30), C(0,50)

 

 

 

60(00+15(0) = =0 is minimum

 

60(30) + 15(0)=1800 is maximum

60(20)+15(50) = 1650

 

60(0)+15(50)=750

 

 

 

 

 

 

 

 


Related Discussions:- Solve the following linear programming graphically

On the basis of ratio of change direction, On the  Basis  of Ratio of Ch...

On the  Basis  of Ratio of Change  Direction   a. Linear Correlation: The  correlation  between  two variables a said  to be liner if  corresponding  to a unit change in th

Support - report writing presentation , Support Supporting materials  ...

Support Supporting materials  is vital for  making the presentation effective. It  clarifies the  speaker  ideas  makes  the presentation more  illuminating as well  as intere

Linear programming problem, #Solve the following Linear Programming Problem...

#Solve the following Linear Programming Problem using Simplex method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Explain research terminology, Q. Explain Research Terminology? Research...

Q. Explain Research Terminology? Research Terminology - Independent and Dependent variables: There are many practical problems in which the values of one variable depend upon t

data analysis and research methodology , Case  Study - Data Analysis ...

Case  Study - Data Analysis Sandarsen  inc was testing new  packaging  and a few  recipe  for a family  desert cookie  that had  been  on the  market for several years. It wa

Periodical article - report writing presentation , Periodical Article ...

Periodical Article A periodical is a publication that is  published  periodically like  a newspaper a magazine  and a journal. Usually  periodicals have  volume numbers  and n

Compute the joining, The Best Corporation is considering making either mino...

The Best Corporation is considering making either minor or major repairs to a malfunctioning production process.  When the process is malfunctioning, the percentage of defective it

Important of probability - probability distributioin , Important of Probabi...

Important of Probability The  various practical applications  of the  theory  of probability are: a.The fundamental  laws of statistic viz   the law  of statistical regular

Linear programming , #questionQuestion. a paper mill produces two grades o...

#questionQuestion. a paper mill produces two grades of paper viz.,xand y.Bacause of raw material restrictions, it cannot produce more than 400 tones of grade x paper and 300 tons

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd