Problems based on lpp when feasible region is unbounded, Operation Research

Assignment Help:

Problems based on LPP when feasible region is unbounded.  

1.    Minimize z = 3x + 5y subject to constraints 

X + y ≥ 2

X + 3y ≥ 3

X, y ≥ 0

script

solution

 

1.    Let z = 3x + 5y

2.   Let us Draw the line x + y = 6 and x + 3y = 3 using suitable points on the graph.

 

3.These lines intersect at

4. Now shade the region of intersection of these lines

5.Vertices of shaded feasible region are

Now,

 

At C(3,0)

At P(3\2,1\2)

At B(0,2)

 

Therefore at P(3\2,1\2), z=3x+5y is minimum

 

 

 

 

 

 

 

 

P(3\2,1\2)

 

 

(3,0)  P(3\2,1\2)  and B(0,2)

 

 

Z= 3x + 5y

Z= 9

Z= 7

Z= 10


Related Discussions:- Problems based on lpp when feasible region is unbounded

Standara deviation - measure of dispersion , STANDARA DEVIATION Standa...

STANDARA DEVIATION Standard  deviation  is the  square  root of the  arithmetic  average of  squares of all  the deviations from the  mean. In short  it may  be defined  as th

Manufacturing operation , You are a manager at a medium sized manufacturing...

You are a manager at a medium sized manufacturing operation that sells a customized product directly to the consumers and the data pattern is linear but it can have the occasion ra

Preparation of script - report writing presentation , Preparation of Script...

Preparation of Script   The most  tedious  and arduous takes is  the  preparation of the  script. While  you have  all the ideas and  points  will should  stored  up in the  mi

Linear programming problem, A paper mill produces two grades of paper viz.,...

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

Data collection procedure, A series of questionnaire for Delphi were mailed...

A series of questionnaire for Delphi were mailed to the selected experts who meet the criteria that mention in above. The overall purpose of the Delphi technique was to achieve the

Tower of hanoi problem, Step 1: Research Towers of Hanoi problem The Tow...

Step 1: Research Towers of Hanoi problem The Towers of Hanoi is a problem frequently used to teach recursive programming techniques. Step 2: Run the assembly code from Hanoim

Integer programming, An integer programming problem is identical to a linea...

An integer programming problem is identical to a linear programming problem except that one or more decision variables are constrained to take integer values. Such problems cannot

PERT, how does it work

how does it work

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