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

Comparing tablet personal computers with personal computer, Background: ...

Background: The use of "Tablet Personal Computers" such as HP's TouchPad and Apple's iPad has been increasing over the past several years. Task: Using a web browser and quality,

LPP, . 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

Linear programming, #questiona paper mill produce two grades of x&y.becouse...

#questiona paper mill produce two grades of x&y.becouse of raw material reswtriction

Modeling, Model building is the essence of the operations research approach...

Model building is the essence of the operations research approach? Discuss.

#title.L.L.p, #use the simple method to solve the following L.P.P. Maximi...

#use the simple method to solve the following L.P.P. Maximize Z =4X1 +10X2 subject to constraints, 2X1 +X2 2X1+5X2 2X1 +3X2 X1,X2 > 0

Type of operation resarch, what are the different types

what are the different types

Or, .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

Answer, 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

LPP, Solve the following Linear Programming Problem using Simple method. Ma...

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

A paper mill produces two grades of paper viz., A paper mill produces two g...

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

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages