1. Define a transportation problem.

2. Differentiate between balanced transportation problem and unbalanced transportation problem.

3. Where the Vogel’s Approximation Method is used. Mention the steps in it.
4. Write down the basic conditions or route conditions for solving a traveling salesman
problem.
5. What is a transshipment problem?
6. List the applications of Integer Programming.
7. Mention about assignment problem
8. Discover the fathomed node in Branch and Bound Algorithm?
9. What do you mean by dynamic programming?
10. Elaborate the capital budgeting problem.
11. Define integer programming.
12. Describe the cutting plane method in IPP.
13. What are the two types of recursive function in dynamic programming?
14. List the applications of dynamic programming

1. Solve the transportation problem using North west corner method.

1 2 3 4 Supply
I 21 16 25 13 11
II 17 18 14 23 13
III 32 27 18 41 19
Demand 6 10 12 16

2. Joe Klyne's three children, John, Karen, and Terri, want to earn some money to take care
of personal expenses during a school trip to the local zoo. Mr. Klyne has chosen three
chores for his children: mowing the lawn, painting the garage door, and washing the
family cars. To avoid antic-ipated sibling competition, he asks them to submit (secret)
bids for what they feel is fair pay for each of the three chores. The understanding is that
aU three children will abide by their father's decision as to who gets which chore. Table
5.32 summarizes the bids received. Based on this information, how should Mr. Klyne
assign the chores?
 3. Use the branch and bound method to solve the following linear programming problem.

Maximize Z = 3X1+2X2
Subject to
2X1+5X2<=9
4X1+2X2<=9
X1,X2 >=0 non negative integer

4. Use the branch and bound method to solve the following linear programming problem.
Maximize Z = 5X1+4X2
Subject to
X1+X2<=5
10X1+6X2<=45
X1,X2 >=0 non negative integer

5. Solve the integer programming problem by Cutting Plane method.

Maximize Z = 7X1+9X2
Subject to
-X1+3X2<=6
7X1+X2<=35
X1,X2 <=0 and are integers

6. Solve the integer programming problem by Cutting Plane method.

Maximize Z = 7X1+10X2
Subject to
-X1+3X2<=6
7X1+X2<=35
X1,X2 >=0 and integer

7. Consider the problem of allocating raw materials from four different warehouses to five
different plants. The availability of the raw material in the four warehouses is 25 ton, 30
ton, 20 ton and 30 ton. The demand of the raw material in the five plants are 20 ton, 20
ton,30 ton,10 ton and 25 ton. It is not possible to ship the raw material from warehouse 4
 to plant 4 because of steep road. Unit cost for the transportation is in the following table.
Find the optimal solution using least cost method as the initial basic solution.
Plant Supply

10 2 3 15 9 25
5 10 15 2 4 30
15 5 14 7 15 20
20 15 13 - 8 30
Demand 20 20 30 10 25

8. Solve the assignment problems for maximization given the profit matrix

Machines
P Q R S
A 51 53 54 50
B 47 50 48 50
Job

C 49 50 60 61
D 63 64 60 60

9. Use the branch and bound method to solve the following linear programming problem.

Maximize Z = 5X1+4X2
Subject to
X1+X2<=5
10X1+6X2<=45
X1,X2 >=0 non negative integer

10. Use the branch and bound method to solve the following linear programming problem.

Maximize Z = 2X1+3X2
Subject to
6X1+5X2<=25
X1+3X2<=10
X1,X2 >=0 non negative integer