OPERATIONS RESEARCH

MID-1 IMPORTANT QUESTIONS:

Short Answer Questions:

1.Describe When does degeneracy occurs in transportation problem?

2.Describe What are the assumptions made in the sequencing problem?

3.Describe What is model? List the various classification schemes of operations research models

4.Describe What is operations research

5. Distinguish between a travelling salesman problem and assignment problem.

6.Describe What are the shadow prices? What is its significance in simplex method of solving LPP

7.Define the problem of sequencing.

8. write various definitions of operations research?

9. Explain the steps in transportation algorithm.

10. Formulate the travelling – Salesman problem as an assignment problem.

11.Explain the possibility and working rules of a maximization case in sequencing?

12. Describe What is meant by redundant constraint?

13. Explain balanced and unbalanced transportation problems?

14. What is meant by optimal solution?

15. What are the conditions recommended for the replacement of a machine with a new one when you
are already have an old one?

Long Answer Questions:

1.solve the following LP problem.

By Using two phase simplex method to

Maximize Z=3X1+2X2+2X3 subject to the constraints

i)5x1+7x2+4x3≤7, ii) -4x1+7x2+5x3≥ -2, iii) 3x1+4x2-6x3≥29/7 and x1, x2, x3≥0.

2. Solve the following LP problem.

Use penalty (Big-M) method to

Maximize Z=x1+2x2+3x3 -x4 subject to the constraints

i) x1+2x2+3x3=15, ii) 2x1+x2+5x3=20, iii) x1+2x2+x3+x4=10 and x1, x2, x3, x4 ≥0.

. 3. Solve the Following LP problem using

Maximize Z=3x1+5x2+4x3 subject to the constraints

i)2x1+3x2≤8, ii) 2x2+5x3≤10, iii) 3x1+2x2+4x3≤15 and x1, x2, x3≥0

4. Formulate the below given problem as an LP model so as to maximize total Profit to the company.
An electronic company produces three types of parts for automatic washing machines. It purchases
casting of the parts from a local foundry and then finishes the part on drilling, shaping and polishing
machines.
The selling prices of parts A, B and C are Rs 8, Rs 10 and Rs 14 respectively. All parts made can be sold.
Casting for parts A, B and C, respectively cost Rs 5, Rs 6 and Rs 10.
The shop possesses only one of each type of casting machine. Costs per hour to run each of three
machines are Rs 20 for drilling, Rs 30 for shaping and Rs 30 for polishing. The capacities (parts per
hour) for each part on each machine are shown in the table:

Machine Capacity per hour

5. Solve the Sequencing Problem to Find the sequence that minimizes the total time required in
performing the following jobs on three machines in the order ABC. Processing times (in hours) are
given in the following table:

Job 1 2 3 4 5
Machine A 8 10 6 7 11
Machine B 5 6 2 3 4
Machine C 4 9 8 6 5

6. Solve the Transportation Problem using Vogel’s Approximation Method (VAM) to find the initial
basic feasible solution:
D1 D2 D3 D4 Supply
S1 19 30 50 10 7
S2 70 30 40 60 9
S3 40 8 70 20 18
Demand 5 8 7 14 34

7. Solve the transportation Problem using Least Cost Method (LCM) to find initial basic feasible
solution to the transportation problem:
 D1 D2 D3 D4 Supply
S1 19 30 50 10 7
S2 70 30 40 60 9
S3 40 8 70 20 18
Demand 5 8 7 14 34

8.Solve the following assignment Problem: An airline company has drawn up a new flight schedule
that involves five flights. To assist in allocating five pilots to the flight, it has asked them to state their
preference scores by giving each flight a number out of 10. The higher the number, the grater is the
preference. A few of these flights are unsuitable to some pilots, owing to domestic reasons. These
have been marked with ‘x’.

Flight Numbers
Pilot 1 2 3 4 5
A 8 2 X 5 4
B 10 9 2 8 4
C 5 4 9 6 X
D 3 6 2 8 7
E 5 6 10 4 3

What should be the allocation of the pilots to flights in order to meet as many preferences as possible?

9. Solve the graphical method to minimize the time needed to process the following jobs on the machines
shown, i.e., for each machine find the job that should be done first. Also, calculate the total elapsed time
to complete both jobs.

Machines
Job 1 A B C D E
3 4 2 6 2

Machines
Job 2 B C A D E
5 4 3 2 6

10. Formulate this problem as an LP model and solve it by using graphical method to determine the
production schedule that yields the maximum profit.

A firm makes two products X and Y, and has a total production capacity of 9 tonnes per day. Both X and
y requires the same production capacity. The firm has a permanent contract to supply at least 2 tonnes of
X and at least 3 tonnes of Y per day to another company. Each tonne of X requires 20 machine hours of
production time and each tonne of Y requires 50 machine hours of production time. The daily maximum
possible number of machine hours is 360. All of the firm’s output can be sold. The profit made is Rs 80 per
tonne of X and Rs 120 per tonne of Y.
 11. A Company has three production facilities S1, S2 and S3 with production capacity of 7, 9 and 18
units (in 100s) per week of a product, respectively. These units are to be shipped to four warehouses
D1, D2, D3 and D4 with requirement of 5,6,7 and 14 units (in 100s) per week, respectively. The
transportation costs (in rupees) per unit between factories to warehouses are given in the table
below:
D1 D2 D3 D4 Supply
S1 19 30 50 10 7
S2 70 30 40 60 9
S3 40 8 70 20 18
Demand 5 8 7 14 34
a) Formulate this transportation problem as an LP model to minimize the total transportation cost.
b) Use North-West Corner Method to find an initial basic feasible solution to the transportation
problem

12. Solve the sequence that minimizes the total time required in performing the following jobs on
three machines in the order A-B-C as shown in the below table. Also find the total elapsed time.
Machine/Job 1 2 3 4 5 6
A 8 3 7 2 5 1
B 3 4 5 2 1 6
C 8 7 6 9 10 9

13. What do you mean by LPP? What are limitations?use penalty method to maximize z = 3x1 - x2
Subject to the constraints
2x1 + x2 ≥ 2; x1 + 3x2 ≤ 3; x2 ≤ 4
x1, x2 ≥ 0.

14. Find the Total cost using North-west corner method. Also find the optimal assignment.

W1 W2 W3 W4 capacity
F1 95 105 80 15 12
F2
115180 40 30 7 7
F3 195 180 95 70 5
Requirement 5 4 4 11