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

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

Posted Date: 7/23/2012 4:13:26 AM | Location : United States







Related Discussions:- Problems based on lpp when feasible region is unbounded, Assignment Help, Ask Question on Problems based on lpp when feasible region is unbounded, Get Answer, Expert's Help, Problems based on lpp when feasible region is unbounded Discussions

Write discussion on Problems based on lpp when feasible region is unbounded
Your posts are moderated
Related Questions

What is meant by a mathematical model of a real situation? Discuss the importance of models in the solution of Operations research problems

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

discuss about assignment and steps involved in it

Telephone calls arrive at a switchboard in a Poisson process at the rate of 2 per minute. A random one-tenth of the calls are long distance. (a) What is the probability of at least

Chi Square Test ( X 2 ) Chi Square Test Defined  the chi square test is one  simplest  and most  commonly  used non parametric tests in statistical work. The Greek letter X 2

A PAPER MILL PRODUCES TWO GRADES OF PAPER VIZ, X AND Y. BECAUSE OF RAW MATERIALS RESTRICTIONS, IT CANNOT PRODUCE MORE THAN 400 TONS OF GRADE X PAPER AND 300 TONS OF GRADE Y PAPER I

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


Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assignment