Scribd
Upload
12 views5 pages

Operations Research Sheet2

Uploaded by

mohammedahmed1252
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views5 pages

Operations Research Sheet2

Uploaded by

mohammedahmed1252
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Sheet No.

1- Suppose that the following constraints have been provided for a linear
programming model with decision variables x1 and x2.
_-x1 + 3x2 ≤ 30
-3x1 + x2 ≤ 30
and
x1 ≥ 0, x2 ≥ 0.
a. Solve this problem graphically.
b. If the objective is to maximize Z= -x1 + x2, does the model have an optimal solution?
If so, find it. If not, explain why not.
c. Repeat part (b) when the objective is to maximize Z= x1 - x2.
d. For objective functions where this model has no optimal solution, does this mean that
there are no good solutions according to the model? Explain. What probably went
wrong when formulating the model?

……………………………………………………………………………………………………………………………
……………………………………………………………………………………………………………………………
……………………………………………………………………………………………………………………………
……………………………………………………………………………………………………………………………
……………………………………………………………………………………………………………………………
……………………………………………………………………………………………………………………………
……………………………………………………………………………………………………………………………
……………………………………………………………………………………………………………………………
……………………………………………………………………………………………………………………………
……………………………………………………………………………………………………………………………
……………………………………………………………………………………………………………………………
……………………………………………………………………………………………………………………………
………………………………………………………………………………………………………..…………….…..

…………………………………………………………………………………………………………….……………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
……………………………………………………….…………………………………………………………………
…………………………………………………………………………………………………………………………

1
2- Solve the following problem using the Graphical & Simplex methods.

Minimize Z= 3x1 + 2x2 +4x3


subject to
2x1 + x2 + 3x3 = 60
_ 3x1 + 3x2 + 5x3 ≥ 120
and
x1 ≥ 0, x2 ≥ 0, x3 ≥ 0.
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
2
3- Minimize Z= 3x1 + 2x2 +4x3

subject to
2x1 + x2 + 3x3 = 60
3x1 + 3x2 + 5x3 ≥ 120
and
x1 ≥ 0, x2 ≥ 0 and x3 ≥ 0.

…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
……………………………………………………………………………………..………………………………..

3
4- Using the graphical method solve this problem

Maximize Z = 2x1 + 5x2 +3x3


subject to
2 x1 + 4 x2 + x3 = 50
_ – x1 + 2 x2 – x3 ≤ – 20
and
x1 ≥ 0, x2 ≥ 0, x3 ≥ 0.
………………………………………………………………………………………………………………………..

…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………
………………………………………………………………………..………………………………………………
4

You might also like