You are on page 1of 3

Assignment 2

1. Solve by simplex method


(a). Maximize Z = 3x + 7y
Subject to
x + 4y 20
2x + y 3 0
x + y 8
and x, y ≥ 0

(b). Maximize Z = 3x1 + 2 x2,


subject to
x1  4
x1 + 3x2  15
2x1 + x2  10
and
x1 ≥ 0, x2 ≥ 0.

(c). Maximize Z = 4x1 + 2x2 + x3


Subject to
x1 + x2  1
x1 + x3  1
x1,x2,x3 ≥ 0

(d). Maximize Z = 2x + 3y
Subject to
-x + 2y  16
x + y  24
x + 3y ≥ 45
-4x + 10y ≥ 20
and x, y ≥ 0.
(e) Minimize C = 6x + 8y
Subject to
4x + 3y ≥ 120,
3x + 6y ≥ 120,
x , y ≥ 0.

2. Find the dual of the following Problems


(a) Maximize Z = x1 + 3x2
Subject to
6x1 + 19x2  100
3x1 + 5x2  40
x1 - 3x2  33
x2  25
x1  42
x1, x2 ≥ 0

(b) Maximize P = x1 + 2x2


Where x1 ≥ 0, x2 ≥ 0
and x1 + 2x2  10
- x1 - x2  30

(c) Maximize W = 2x1 + x2 + x3 - x4


Subject to x1 - x2 + 2x3 + 2x4  3
2x1 + 2x2 -x3 = 4
x1 - 2x2 + 3x3 + 4x4 ≥ 5
x1 - 2x2 + 3x3 + 4x4 ≥ 5
x1, x2, x3 ≥ 0

(d) Maximize Z = 4x1 + 5x2 + 3x3 + 6x4


Subject to
x1 + 3x2 + x3 + 2x4  2
3x1 + 3x2 + 2x3 +2x4  4
3x1 + 2x2 + 4x3 + 5x4  6
x1, x2, x3, x4 ≥ 0

(e) Maximize Z = x1 + 1.5x2


Subject to
2x1 + 3x2  25
x1 + x2 ≥ 1
x1 - 2x2 = 1

x1 , x2 ≥ 0
3. Write the dual to the following problems, solve the dual and hence
find the solution to the primal problem from the results of the dual.
(a) Minimize Z = 4x1 + 3x2 + 6x3
Subject to
x1 + x3 ≥ 2
x2 + x3 ≥ 5
x1 , x2 , x3 ≥ 0

(b) Minimize W = 4 y1 + 12 y2 + 18 y3,


subject to
y1 + 3 y3  3
2 y2 + 2 y3  5
y1  0, y2  0, y3  0.

(c) Minimize Z = 3x1 + 2.5 x2


Subject to
2x1 + 4x2 ≥ 40
3x1 + 2x2 ≥ 50
x1 , x2 ≥ 0
4. Microcom is a growth oriented firm which establishes monthly
performance goals for its sales force. It determines that the sales
force has a maximum available hours per month for visits of 640 hours.

Further, it is estimated that each visit to a potential new client


requires 3 hours and each visit to a current client requires 2 hours.

Microcom establishes two goals for the coming month:

• Contact at least 200 current clients

• Contact at least 120 new clients

• Overachieving either goal will not be penalized

Formulate the problem and solve by goal programming.

5. Formulate the goal programming from the following information of


Dewrite Company.

6.

You might also like