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

Calculation of standard deviation - discrete series, Calculation  of Stand...

Calculation  of Standard Deviation - Discrete Series   There are three methods for  calculating  standard  deviation  in discrete series": a. Actual Mean Methods: It inc

Complexity - necessity of operations research, In a big industry the numbe...

In a big industry the numbers of factors influencing a decision have increased situation has become big and complex because these factors interact with each other in complica

Describe the objectives of tax planning, Question 1 Describe the obje...

Question 1 Describe the objectives of tax planning. Explain the factors to be considered in tax planning. Question 2 Describe the categories in Capital assets. Mr.

Network problem, Consider the following network where the value on each arc...

Consider the following network where the value on each arc represents the capacity of that arc. Use the augmenting path algorithm to find the value of the maximum flow from node 1

LPP, USE SIMPLE METHOD TO SOLVE THE FOLLOWING LPP MAXIMISE Z=4X1+10X2 SUBJE...

USE SIMPLE METHOD TO SOLVE THE FOLLOWING LPP MAXIMISE Z=4X1+10X2 SUBJECT TO CONSTRAINS, 2X1+X2 2X1+5X2 2X1+3X2 X1, X2>0

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 MATERIAL RESTRICTIONS, IT CANNOT PRODUCE MORE THAN 400 TONS OF GRADE X PAPER AND 300 TONS OF GRADE Y PAPER I

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

difference between simplex solution procedure for maximisation and minimisation

MODERN MANAGEMENT, DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH...

DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH IN MODERN MANAGEMENT

Inherent forces fomenting conflicts of interest, Inherent forces fomenting ...

Inherent forces fomenting conflicts of interest Several forces have coalesced to increase the incidence of conflicts of interest in the medical industry: the vertical integrat

LINEAR PROGRAMMING, A DRUG MANUFACTURER produces 2 products X1 and X2.X1 ne...

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

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