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

Coding and retrieval , Coding  and Retrieval  If all your  data ar...

Coding  and Retrieval  If all your  data are  word processed on in some  other  computer readable form  it will  be possible  for your  primary  documents  to be accessed d

Environmental demands, Problem 1 Explain the key elements, which contri...

Problem 1 Explain the key elements, which contribute to a sound and effective strategy. >>Explanation of following elements Market Consumers Competition Skil

LINEAR PROGRAMMING, A DRUG MANUFACTURER produces 2 products X1 and X2.X1 ne...

A DRUG MANUFACTURER produces 2 products X1 and X2.X1 needs 2 hours on machine A AND 2 HOURS ON MACHINE B.X2 needs 3 hours on machine A and 1 hour on machine B.If machine A can run

Tables and graphs, Normal 0 false false false EN-IN ...

Normal 0 false false false EN-IN X-NONE X-NONE

Describe the demand curve, The following equation gives Jane's linear deman...

The following equation gives Jane's linear demand curve for visits to a nearby national park.  Q is the number of visits per week and P represents the price of a pass (price per vi

Problems, can u send me some assigment problems

can u send me some assigment problems

Replacement theory.., a pipe lis dur for rpair,the repair would cost 10000 ...

a pipe lis dur for rpair,the repair would cost 10000 and it would last for 3 years.alternatively a new pipe line can be purchase at 30000 for 10 years.assuming 10% depriciation rat

Assignment, discuss Dr. Konigs assignment method

discuss Dr. Konigs assignment method

Answer, explain operation research with example.and also discuss the scope ...

explain operation research with example.and also discuss the scope of OR in modern management.

Purchasing, need of detailed information about the topic

need of detailed information about the topic

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