JAYPEE INSTITUTE OF INFORMATION TECHNOLOGY Assignment-1

Course Name: Operations Research Course Code: 11B1NMA831

Note: Submit the following assignment LATEST by 21/01/2012.

1. The XYZ Company has been a producer of picture tubes for television sets and certain printed circuits for radios. The company has just expanded into full scale production and marketing of AM and AM-FM radios. It has built a new plant that can operate 48 hours per week. Production of an AM radio in the new plant will require 2 hours and production of an AM-FM radio will require 3 hours. Each AM radio will contribute Rs. 40 to profits while an AM-FM radio will contribute Rs. 80 to profits. The marketing departments, after extensive research, have determined that a maximum of 15 AM radios and 10 AM-FM radios can be sold each week. (a) Formulate a Linear programming model to determine the optimum product mix of AMFM radios that will maximize profits. (b) Solve the above problem using graphic model. 2. 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.
3

If S1 = {(x1,x2) : -x1 + x2 4, 3x1 - 2x2 9; x1,x2 0}, solve graphically the following problems: (a) max x1+ x2 Ans: (17,21) & 38(unique sol)
(x1,x2)S1

(b) max 4x1+9x2, where S2 = {(x1,x2) : -x1 + 3x2 1, x1 - 2x2 1; x1,x2 0} (x1,x2)S2 Ans: unbounded sol (c) max 6x1- 4x2 +18 Ans: infinite no. of solutions on 3x1 - 2x2 = 9
(x1,x2)S1

(d) max 4x1+9x2+18, where S3 = {(x1,x2) : -x1 + 3x2 6, x1 - 2x2 4; x1,x2 0} (x1,x2)S3 Ans: no solution 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? (Ans: x1 = 0, x2 = 4; z = 4 ) (b) What is the optimal solution when the objective function is Maximize z = x1 + x2 ? (Ans: x1 = 8, x2 = 0; z = 8 ) (c) What is the optimal solution when x1 and x2 are unrestricted in sign? (Ans: x1 = 4, x2 = 6; z = 10 ) 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 zj

1 0

-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. 2 x1 + 2 x2 x3 2 s.t. x1 + 2 x2 8 3 x1 4 x2 3 3 x1 2 x2 8 x2 + 3x3 5 x1 0 and x2 is unresticred x1 , x2 , x3 0 Ans : x1 = 24 7 , x2 = 16 7; z = 272 7 Ans : unbounded solution (c ) Max. z = 2 x1 + 3 x2 + 5 x3 s.t. 3x1 + 10 x2 + 5 x3 15 33 x1 10 x2 + 9 x3 33 x1 + x2 + x3 4 x1 , x2 , x3 0 Ans : no feasible solution 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

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: min z = 6x 1 + 7 x 2 + 3 x3 + 5 x 4 s.t. 5x 1 + 6 x 2 3 x3 + 4 x 4 12, x 2 + 5 x3 6 x 4 10, 2x 1 + 5 x 2 + x3 + x 4 8, x 1 , x 2 , x3 , x 4 0 10 (a) Solve the problem Max z = x 1 + 1.5 x 2 s.t. 2x 1 + 2 x 2 160 x 1 + 2 x 2 120, 4 x1 + 2 x 2 280, x1 , x2 0 (b) Over what values of profit for x2 will the present solution be still optimal? (c) Dtermine th optimal range for c1