JAYPEE INSTITUTE OF INFORMATION TECHNOLOGY Assignment-1

Course Name: Operations Research 11B1NMA831 1. Course Code:

In a transport company, 6trucks of type1, 10 trucks of type 2 and 8 trucks of type 3 are available for each day requirements. The tonnage capacities are 16 for type 1, 12 for type 2 and 9 for type 3. The company dispatches its trucks to Cities A and B. Tonnage requirements are 20 at City A and 30 at City B; excess tonnage capacity supplied to a city has no value. Considering the distances, it is possible for the trucks to go only once to the destinations everyday. The cost of sending a truck to each city is given below: City A City B Type 1 2000 3000 Type 2 1800 2400 Type 3 1200 2200

Formulate this problem as a linear programming problem. The postal department is considering the purchase of vehicles to pick up and deliver mail from various offices. They are considering three types of vehicles. The costs of each of these are Rs. 5 lakhs, Rs. 10 lakhs and Rs. 8 lakhs per vehicle, repectively. These require a crew of 2, 4 and 4 persons per day considering multiple shifts. They expect these to run for 60, 100 and 80 km per day. They expect that the total distance to be covered by the vehicles per day would be 2000 km. Based on the fuel economy, the operating cost per day for these vehicles are Rs. 200, Rs. 350 and Rs. 300 per day. They have a budget restriction of Rs. 1.6 crore and have 80 people available as crew. Formulate a model to minimize the operating costs.
2.

If S1 = {(x1,x2) : -x1 + x2 4, 3x1 - 2x2 9; x1,x2 0}, solve graphically the following problems: (a) max x1+ x2
3. (x1,x2)S1

(b) max 4x1+9x2, where S2 = {(x1,x2) : -x1 + 3x2 1, x1 - 2x2 1; x1,x2 0}

(x1,x2)S2

(c) max 6x1- 4x2 +18

(x1,x2)S1

(d) max 4x1+9x2+18, where S3 = {(x1,x2) : -x1 + 3x2 6, x1 - 2x2 4; x1,x2 0}

(x1,x2)S3

4. Consider the following linear programming problem: Min. z = x1 x2 s.t. x1 + x2 2 x1 + 2 x2 8 x1 0, x2 0

Identify the feasible region on a graphical representation of the problem and answer the following questions: (a) What is the optimal solution to the given problem? (b) What is the optimal solution when the objective function is Maximize z = x1 + x2 ? (c) What is the optimal solution when x1 and x2 are unrestricted in sign? The following table shows a simplex table for a maximization problem. Find the values of , , , for the following situations: B CB XB X1 X2 X3 X4 X5 X6 0 0 1 0 -1 X3
5.

X1

cj

1 2

-1 -2

-4 9

4 -1

2 0

(a) The problem has unbounded solution. (b) The present solution is degenerate but comes out of degeneracy in the next iteration. (c) The problem represents a linearly dependent system of equations. (d) The problem represents a situation where an unrestricted variable is in the basis at the optimum.
6.

Solve the following linear programming problem using simplex method. (b) Max. z = 5 x1 2 x2 + 3 x3 (a ) Max. z = 8 x1 + 5 x2 s.t. x1 + 2 x2 8 3 x1 2 x2 8 x1 0 and x2 is unresticred (c ) Max. z = 2 x1 + 3 x2 + 5 x3 s.t. 3 x1 + 10 x2 + 5 x3 15 33 x1 10 x2 + 9 x3 33 x1 + x2 + x3 4 x1 , x2 , x3 0 Write the dual of the following problem:
( a ) Max. z = 3 x1 + x2 + 2 x3 x4 s.t. 2 x1 x2 + 3 x3 + x4 = 1 x1 + x2 x3 + x4 = 3 x1 , x2 0, x3 and x4 are unrestricted . (b) Min. z = 2 x1 + 3 x2 + 4 x3 s.t. 2 x1 + 3 x2 + 5 x3 2 3x1 + x2 + 7 x3 = 3 x1 + 4 x2 + 6 x3 5 x1 , x2 0, x3 is unrestricted

s.t.

2 x1 + 2 x2 x3 2

3 x1 4 x2 3 x2 + 3x3 5 x1 , x2 , x3 0

7.

8.

Write the dual of the following problem and solve the dual Max. z = -2x1 - 2x2 - 4x3 s.t. 2x1 + 3x2 + 5x3 2 3x1 + x2 + 7x3 3 x1 + 4x2 + 6x3 5 x1 , x2 , x3 0 9. Use dual simplex method to solve the following LPP: Max. s.t. z = -3x1 - x2 x1 + x2 1 2x1 + 3x2 2 x1 , x2 0

10. Using dual simplex method, solve the following: Min. z = x1 + 2x2 + 3x3 s.t. 2x1 - x2 + x3 4 x1 + x2 + 2x3 8 x2 - x3 2 x1 , x2 , x3 0