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

Linear programming, Solve the following Linear Programming Problem using Si...

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

Inventory Control Model, 1. A local university purchases exercise books to ...

1. A local university purchases exercise books to give to their students. Instead of a fixed unit cost, their supplier quotes the following discount pricing: Order quantity Unit P

Steps of research proposal, Steps of Research Proposal Proposal Con...

Steps of Research Proposal Proposal Content  The researcher is always given instructions for preparing a proposal that indicate the format to be followed. Funding agencie

Explain what do you understand by dynamic programming, Question: (a) (i...

Question: (a) (i) Explain what do you understand by ‘Dynamic Programming'. (ii) Describe the dynamic programming approach to solve the shortest route problem. (iii) Outli

Answering question to find shortest path, Answering Question to Finding Sho...

Answering Question to Finding Shortest Path - Operation Research Assignment Help Finding answers for shortest path problems are quite interesting and not easy to solve. In solv

Explain the history of boots and shoes, Question 1 Explain any five access...

Question 1 Explain any five accessory industries Question 2 Explain the history of boots and shoes Question 3 Write short notes on following- Types of Gujarati emb

Lpp using sipmle method, Maximize Z= 3x1 + 2X2 Subject to the constraints: ...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Op, A paper mill produces two grades of paper viz., X and Y. Because of raw...

A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper i

Research, Discus and explain both probability and none probability sampling...

Discus and explain both probability and none probability sampling techniques

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