Solve the following linear programming graphically, Operation Research

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

 

 

 

 

 

 

 

 

Posted Date: 7/23/2012 4:10:32 AM | Location : United States







Related Discussions:- Solve the following linear programming graphically, Assignment Help, Ask Question on Solve the following linear programming graphically, Get Answer, Expert's Help, Solve the following linear programming graphically Discussions

Write discussion on Solve the following linear programming graphically
Your posts are moderated
Related Questions
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

management wants to know how many supervisors should be hired, and what could be the optimum workload distribution to be applied, given a number of constraints

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

Overview of Writing Research Proposal It may be written in words of the researcher or as answers following the guidelines provided by the sponsoring organization. A review of

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

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


Reference Books: Definition According to William  Katz (1969) a Reference book generally has the following qualities:  It is a miscellany of information organised for quick

Meaning of Research Report Research  report is the process of communicating  the  results  of an investigation it  is a document which  reflect about  the research conducted a

Graphs of Time Series A time  series  is a sequence of values  corresponding  to successive points  of time. Time  series  are  graphed  with time  on the x axis  and the  oth