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
. Explain in brief the phases of Operations Research. 5 +5 = 10 marks (200 - 250 words each) Q3. Solve the following Linear Programming Problem using Simple method. Maximize Z= 3

maximum 3x1+x2+x3-x4 subject to x1+5x2+3x3+4x4 x1+x2=-1 x3+x4

The following linear programming is written to plan the production of two products. And the company wants to maximize profits. x1 = number of product 1 produced in each batch

Software House named as Harvester, got to increase the speed of service and I need to get 3000 words written

Question 1 Explain the process of problem identification with an example 2 Interview method involves a dialogue among the Interviewee and the Interviewer. Describe the inter


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

A company uses 4 pounds of resource 1 to make each unit of X1 and 3 pounds of resource 1 to make each unit of X2. There are only 150 pounds of resource 1 available. Which of the fo

1. Investigate: The Operations Strategy of your organisation or one you are familiar with and answer the following points. Does your chosen organisation have an operations

what will happen when line balance doesn not exist