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

Game theory-, use of game theory by state bank of india

use of game theory by state bank of india

One sample sign test - hypothesis testing , One Sample sign Test In...

One Sample sign Test In a one  sample  test the  null  hypothesis μ = μ 0 against an  appropriate alternative on the basis of a random sample of size n we replace each sam

Introduction to probability distribution , Introduction to Probability Dist...

Introduction to Probability Distribution By  theoretical distribution we mean  a frequency distribution  which  is obtained  in relation to a random  variable by some  mathem

Production option and the ato process design, The plant is using the chase ...

The plant is using the chase production option and the ATO process design. The BOM is illustrated below.   Requirement The factory works on a process layout but

Dynamic programming, A company is planning its advertising strategy for the...

A company is planning its advertising strategy for the next year for its three major products.

Linear programming, Meaning of Linear programming problem and explanation o...

Meaning of Linear programming problem and explanation of graphical method of solving Linear Programming Problem

Unit 8, undertake the proposed research investigation in accordance with th...

undertake the proposed research investigation in accordance with the agreed specification and procedures

Simplex method, Solve the following Linear Programming Problem using Simple...

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

Lp, #question.Solve the following Linear Programming Problem using Simple m...

#question.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.

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