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

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

Linear programming , A paper mill prouduces two grads of paper viz., X and ...

A paper mill prouduces two grads of paper viz., X and Y. Becouse of raw material restriction, it cannot product more then 400 tons of grade X paper and 300 tons of grade Y paper in

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

LPP, A paper mill produces two grades of paper viz., X and Y. Because of ra...

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

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

Decision tree, ppt on decision tree

ppt on decision tree

How to solve operation research optimization questions, how to solve operat...

how to solve operation research optimization questions

Competitive models, These models have been developed to establish a trade ...

These models have been developed to establish a trade off between costs of providing and the waiting time of a customer in the queuing system. Constructing a model entails desc

Sope, sope of operations research in a detailed manner

sope of operations research in a detailed manner

#titleAssignment Problem.., Six Operators are to be assigned to five jobs w...

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

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages