Mee S - 405

University Institute of Engineering & Technology
Industrial Management(MEE-504)
Instructor: Vikas Katiyar
1) Write the initial system of equations for the linear programming models
Maximize P = 2x1 +6x2
Subject to: 6x1 + 8x2 ≤ 85
4x1 + 3x2 ≤ 70
x1 ≥ 0, x2 ≥ 0
2) Maximize f(x) = x1 + 2x2 subject to:
x1 + 2x2 ≤ 3
x1 + x2 ≤ 2
x1 ≤ 1
x1 ≥ 0
x2 ≥ 0
3) Maximize f(x) = x1 + 2x2 + x3 subject to:
x1 + 2x2 + x3 ≤ 2
3x1 + x2 + x3 ≤ 4
x1 + x2 + 2x3 ≤ 4
x1 + x2 + x3 ≤ 2
x1 ≥ 0
x2 ≥ 0
x3 ≥ 0
4) Work through the simplex method (in algebraic form) step by step to solve the
following problem. Maximize Z = x1 + 2x2 + 4x3, subject to
3x1 + x2 + 5x3≤ 10
x1 + 4x2 + x3≤ 8
2x1 + 2x3 ≤ 7
x1 ≥ 0
x2 ≥ 0
x3 ≥ 0
5) Write the dual of the following problem:
Z=3x1+4x2
Subject to:
2x1+3x2≤16
5x1+2x2≥ 20 x1,x2≥ 0
6) We consider the following linear programme.
Maximize 7x1 + 6x2 + 5x3 − 2x4 + 3x5
Subject to:
x1 + 3x2 + 5x3 − 2x4 + 2x5 ≤ 4
4x1 + 2x2 − 2x3 + x4 + x5 ≤ 3
2x1 + 4x2 + 4x3 − 2x4 + 5x5 ≤ 5
3x1 + x2 + 2x3 − x4 − 2x5 ≤ 1
x1,x2,x3,x4,x5 ≥ 0.
Is the solution x 1 = 0,x 2 = 4 3 ,x 3 = 2 3 ,x4 = 5 3 ,x5 = 0, optimal?
7) Consider the following linear programme.

Minimize −2x1 − 3x2 − 2x3 − 3x4
Subject to: −2x1 − x2 − 3x3 − 2x4 ≥ −8
3x1 + 2x2 + 2x3 + x4 ≤ 7
x1,x2,x3,x4 ≥ 0
a) Write the programme under the standard form.
b) Write the dual (D) of programme
c) Give a graphical solution of the dual programme
d) Carry on the first iteration of the Simplex Method on the linear programme , After three
iterations, one find that the optimal solution of this programme is x1 = 0, x2 = 2, x3 = 0 and
x4 = 3.
e) Verify that the solution of (d) obtained is optimal.
8) Solve the LP problem using Simplex algorithm

Minimize X1 - X2 subject to
X1 + X2 ≥ 7;
X1 ≤ 10;
X1, X2 ≥ 0
using the simplex algorithm
9) Maximize: P = 3x + 4y subject to:

x+y≤4
2x + y ≤ 5
x ≥ 0, y ≥ 0
10) Use penalty (or Big 'M') method to

Minimize z = 4xi + 3x2
subject to the constraints :
2x1+ x2 ≥ 10, -3x1, + 2x2 ≤ 6
x1 + x2 ≥ 6, x1 ≥ 0 and x2 ≥ 0.
11) Minimize using big-m
min z = 2x1 + 3x2
s.t. (1/2)x1 + (1/4)x2 ≤ 4
x1 + 3x2 ≥ 20
x1 + x2 = 10
x1, x2 ≥ 0
12) Maximize using big m
max z = x1 + x2
s.t. 2x1 + x2 ≥ 3
3x1 + x2 ≤ 3.
5 x1 + x2 ≤ 1
x1, x2 ≥ 0
13) Use two-phase simplex method to solve the L.P.P.
Minimize z = 4x1 + x2
subject to x1 + 2x2 ≤ 3
4x1 + 3x2 ≥ 6
3x1 + x2 = 3
x1, x2 ≥ 0.
14) Solve the following L.P.P. by simplex method.
Maximize z = 2x1 + 5x2
subject to
x1 + 2x2 ≤ 8
x1 ≤ 4
x2 ≤ 3
x2 ≥ 0, x1 is unrestricted in sign
15) Solve a transportation problem with three supply points and three demand points. The
supplies are 80, 60 and 70 while the demands are 90, 75 and 45. The unit costs of
transportation are 8, 5, 6, 4, 7, 9, 10, 12 and 11 respectively. Find the transportation
quantities? *(Use NWCM method)
16) Consider a two stage transportation problem where there are 3 factories, 3 warehouses
and 2 retailers. The supplies are 80, 60 and 70 while the demands are 100 and 110. The unit
costs of transportation between factories and warehouses are 8, 5, 6, 4, 7, 9, 10, 12 and 11
respectively. The warehouse capacities are 90, 75 and 45. The unit cost of transportation
between warehouses and retailers are 8, 12, 14, 10, 9 and 10. Solve a multistage
transportation problem? *(Use LCM method)
17) Find Solution using Voggel's Approximation method
19) Solve a fixed charge transportation problem with three supply points and three demand
points. The supplies are 80, 60 and 70 while the demands are 90, 75 and 45. The unit costs
of transportation are 8, 5, 6, 4, 7, 9, 10, 12 and 11 respectively. The fixed costs are 300, 200,
400, 600, 700, 400, 800, 650 and 550 respectively. Find the transportation quantities?
20) Consider three jobs to be assigned to three machines. The cost for each combination is
shown in the table below. Determine the minimal job – machine combinations
21) The maximum profit for the following 4x 3 assignment problem is

22) The minimum cost for the following 5x 5 assignment problem is
23) In a 4 x 4 assignment problem where 4 jobs are assigned to 4 machines, job 1 is assigned
to M2, job 2 to M4, Job 3 to M3. What is the fourth assignment?
24) Minimize the total cost for J(Jobs) & W(Workers).
25) Assign the four tasks to four operators. The assigning costs are given in Table.
26) Which among the three methods will be best to solve the transportation problem..
Discuss about their results.

Mee S - 405

Uploaded by

Copyright:

Available Formats

Mee S - 405

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Mee S - 405

Uploaded by

Copyright:

Available Formats

University Institute of Engineering & Technology

2) Maximize f(x) = x1 + 2x2 subject to:

3) Maximize f(x) = x1 + 2x2 + x3 subject to:

7) Consider the following linear programme.

8) Solve the LP problem using Simplex algorithm

9) Maximize: P = 3x + 4y subject to:

10) Use penalty (or Big 'M') method to

21) The maximum profit for the following 4x 3 assignment problem is

24) Minimize the total cost for J(Jobs) & W(Workers).

You might also like