COURSE: OPTIMIZATION TECHNIQUE AAOC C222 ASSIGNMENT- 4

Date of Assignment: 01/11/09 Date of Submission: 06/11/09 (Common Hour) Maximum marks: 5

[1.5 M] s.t. 3x1 + 2 x 2 18, x1 4, x2 6, and x1 , x2 0 (a) Discuss the effect of discrete changes in the coefficients aij of A on the current optimal solution. (b) Suppose variable x6 is added to the given LP problem, then obtain an optimal solution to the resulting LP problem. It is given that coefficient of x6 in the constraint of the problem are 1, 1 and 1, and its coefficient in the objective function is 2. (c) Discuss the effect on the optimal basic feasible solution by adding a new constraint 2 x1 + x2 8 to the given set of constraints. maximize Z = 2 x1 + 3x2 + 4 x3 Q2. For a LPP: [1.5M] s.t. x1 + 2 x2 + 3 x3 11, 2 x1 + 3x2 + 2 x3 10, x1 , x2 , x3 0 With its optimal table as B.V x1 x2 x3 s1 s2 Solution Z 0 1/2 0 1 1/2 16 x3 0 1/4 1 1/2 1/4 3 x1 1 5/4 0 1/2 3/4 2 (a) Within what range the cost of x1 varies so that the optimality remains unaffected. (b) Within what range the cost of x2 varies so that the optimal solution remains unaffected. (c) Discuss the effect of changing the costs 2, 3, 4 of the decision variables x1, x2, x3 to 1, 2, 2. Q1. Consider the LP problem:

maximize Z = 3x1 + 5 x2

Q3. A company has facilities at cities A, B and C which supply warehouses at cities D, E and F. The monthly factory capacities are 50, 150 and 200 units, respectively. The monthly requirements are 100, 130 and 200 units, respectively. The shipping cost/unit are given in the following network. [1M] D E F A 2 1 4 B 3 1 2 C 5 6 7 (a) Formulate the LP model for this problem. (b) Also, write the dual of the above problem. (c) Use the VAM to get the starting BFS. (d) Find the optimal solution. (e) Does there exist an alternative optimal solution? If it exists, then find it. (f) Is the optimal solution degenerate? If it exist, write why? Otherwise give reasons for its absence. (g) If the penalties per unit cost for the unsatisfied demand are 5, 2, 1 for the cities D, E and F, then find the optimal solution. Q4. A company has four territories open, and four salesmen available for an assignment. The territories are not equally rich in their sales potential. It is estimated that a typical salesman operating in each territory would bring in the following annual sales: [1M] Territory I II III IV Annual sales (Rs.) 1, 26, 000 1, 05, 000 84,000 63,000 The four salesmen also differ in their ability. It is estimated that, working under the same conditions, their yearly sales would be proportionately as follows: Salesmen: A B C D Proportion: 7 5 5 4 If the criterion is maximum expected total sales, the intuitive answer is to assign the best salesman to the richest territory, the next best salesman to the second richest, and so on; verify this answer by the assignment technique.