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

Simplex solution, difference between simplex solution procedure for maximis...

difference between simplex solution procedure for maximisation and minimisation

Mb0048, A PAPER MILL PRODUCES TWO GRADES OF PAPER VIZ, X AND Y. BECAUSE OF ...

A PAPER MILL PRODUCES TWO GRADES OF PAPER VIZ, X AND Y. BECAUSE OF RAW MATERIALS RESTRICTIONS, IT CANNOT PRODUCE MORE THAN 400 TONS OF GRADE X PAPER AND 300 TONS OF GRADE Y PAPER I

Simplex, Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4...

Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4x + 8y >= 5

Question, Solve the following Linear Programming Problem using Simple metho...

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

Techniques of operations research, There is no unique set of problems which...

There is no unique set of problems which can be solved by using operations Research Models r techniques. Several operations Research Models or techniques can be grouped into some b

Tied ranks equal or repeated rank, Tied Ranks Equal or Repeated Rank W...

Tied Ranks Equal or Repeated Rank When  two or more  items  have equal values  it is  difficult  to give ranks  to them. In  that case  the items are given  the average of the

Problems based on lpp when feasible region is a line segment, Problems base...

Problems based on LPP when feasible region is a line segment or it does not exist. 1.    Maximize z = 2x+3y subject to the constraints X + y ≤ 1 X + y ≥ 3 X,  y ≥ 0

Determine the required factors of production in a company, 1)  Provide a de...

1)  Provide a description of the required factors of production, grouping them according to whether the factors of production are a) Fixed and hence unlikely to vary much accord

M/M/s queue, How do I use C# to program an M/M/s queue model?

How do I use C# to program an M/M/s queue model?

Both LP and PIP, marginal rate of substitution, degeneracy and degenerate ...

marginal rate of substitution, degeneracy and degenerate solution

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