Scribd
Upload
820 views

Assignment OT

The document contains 10 questions related to operations research problems including linear programming problems to be solved graphically, using the Simplex method, Big-M method, or Two Phase method. Assignment problems and replacement problems are also included to determine optimal distribution to minimize costs or time to replace a machine.

Uploaded by

shalukpr
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
820 views

Assignment OT

The document contains 10 questions related to operations research problems including linear programming problems to be solved graphically, using the Simplex method, Big-M method, or Two Phase method. Assignment problems and replacement problems are also included to determine optimal distribution to minimize costs or time to replace a machine.

Uploaded by

shalukpr
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Q.1.

A transistor radio company manufactures models A, B and C which have profit


contributions of 8, 15 and 25 respectively. The weekly minimum production
requirements are 100 for model A, 150 for model B and 75 for model C. Each type of
radio requires a certain amount of time for the manufacturing of component parts, for
assembling and packing. Especially a dozen units of model A require three hours of
manufacturing, four hours of assembling and one hour of packing. The corresponding
figures for a dozen units of model B are 3.5, 5 and 1.5 and for a dozen unit of model C
are 5, 8 and 3. During the forthcoming week the company has available 150 hours of
manufacturing, 200 hours of assembling and 60 hours of packing time. Formulate the
production scheduling problem as a linear programming model.
Q.2. Solve graphically: Maximize Z = 2x1 + 3x2
Subject to the constraints: x1 + x2 ≤ 30; x2 ≥ 3; 0 ≤ x2 ≤ 12; x1 – x2 ≥ 0; 0 ≤ x1 ≤ 20
Q.3. Solve using Simplex method: Maximize Z = 40x1 + 80x2
Subject to the constraints: 2x1 + 3x2 ≤ 48; x1 ≤ 15; x2 ≤ 10; x1 – x2 ≥ 0
Q.4. Solve the following LP problem using Big-M method: Maximize Z = 3x1 + 2x2 subject
to the constraints: 2x1 + x2 ≤ 2; 3x1 + 4x2 ≥ 12 and x1, x2 ≥ 0.
Q.5. Use TWO PHASE method to solve the following LPP: Maximize Z = 2x1 + 4x2
Subject to the constraints: 2x1 + x2 ≤ 18; 3x1 + 2x2 ≥ 30; x1 + 2x2 = 26; x1, x2 ≥ 0.
Q.6. Obtain the dual of the following primal LP problem: Minimize Z = 2x2 + 5x3
Subject to the constraints: x1 + x2 ≥ 2; 2x1 + x2 + 6x3 ≤ 6; x1 – x2 + 3x3 = 4; x1, x2, x3 ≥ 0.
Q.7. A cement factory manager is considering the best way to transport cement from his
three manufacturing centres P, Q, R to depots A, B, C, D and E. The weekly production
and demands along with transportation cost per ton are given below:

Depot
Centres A B C D E tons
P 4 1 3 4 4 60
Q 2 3 2 2 3 35
R 3 5 2 4 4 40
Tons 22 45 20 18 30
What should be distribution program that minimize the transportation cost?
Q.8. Solve the following assignment problem:

I II III IV V
A 1 3 2 3 6
B 2 4 3 1 5
C 5 6 3 4 6
D 3 1 4 2 2
E 1 5 6 5 4
Q.9. A firm is considering the replacement of a machine, whose cost price is Rs 12,200, and
its scrap value is Rs 200. From experience the running (maintenance and operating)
costs are found to be as follows:
Year 1 2 3 4 5 6 7 8
Running Cost(Rs): 200 500 800 1,200 1,800 2,500 3,200 4,000
What should the machine be replaced?
Q.10. Four jobs 1, 2, 3 and 4 are to be processed on each of the four machines A, B, C and D
in the order ABCD. The processing time in minutes are given the following table. Find
the minimum total elapsed time when passing is not allowed. Also, find the idle time
for each machine.

Job : 1 2 3 4
Machine A : 58 30 28 64
Machine B : 14 10 12 16
Machine C : 14 18 16 12
Machine D : 48 32 44 42

You might also like