Sunteți pe pagina 1din 3

Jaypee Institute of Information Technology Assignment-2.

Course Name: Operations Research Course Code: 11B1NMA831

SUBMIT THE ABOVE ASSIGNMENT LATEST BY 2ND OF APRIL 2013.

1. (a) Solve the problem

[Ans.

x1 = 40, x 2 = 40, Max Z = 100]

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, x 1 , x 2 0 (b) Over what values of profit for x2 will the present solution be still optimal? [ 1 c 2 2] (c) Dtermine th optimal range for c1 . [ 3 / 4 c 2 3/2]

2. Mahendra is in jewellery business and makes rings and bracelets of silver and gold. Each takes 3 units of silver and 1 unit of gold and each bracelet takes 1 unit of silver and 2 units of gold. Mahendra has 9 units of silver and 8 units of gold. Each ring brings Rs. 40 profit and each bracelet Rs. 50 profit. His objective is to maximize profit. Write the problem as LPP and obtain the optimum solution and then answer the following. [Ans. 2 rings and 3 bracelets, Max Z=230] (i) What happens if Mahendra has 1 unit less silver? [Ans. 1.6 rings and 3.2 bracelets, Max Z=224] (ii) What happens if he has 1 unit more gold? [Ans. 1.8 rings and 3.6 bracelets, Max Z=252] (iii) What happens if the contribution of rings increases by 10 per rings? [Ans. Solution remains unchanged but maximum profit increases to Rs.260] 3. Consider the L.P.P.
Min Z = x 2 3 x3 + 2 x5 2 x 2 + 4 x3 12, - 4x 2 + 3 x3 + 8 x5 10, x 2 , x 3 x 5 0.

3 x 2 x 3 + 2 x 5 7,

(a) Find the optimal Product Mix and write shadow prices of the resources? [ w1 = 1 / 5, w 2 = 4 / 5, w3 = 0 ] (b) How much can c5 be decreased before S 2 enters the basis? [ c5 2/5] (c) How much can the requirement 7 in the first constraint be increased before the basis would change? [ 3 b1 ] 4. Hi Dec produces two models of electronic gadgets that use resisters, capacitors, and chips. Resource Resister Capacitor Chips Unit profit ($) Unit resource requirements Model -1 Model -2 2 2 0 3 3 1 4 4 Maximum availability (units) 1200 1000 800

Let x1 and x 2 be the amounts produced of Model 1 and 2, respectively. Following are the LP model
MaxZ = 3 x1 + 4 x 2 S .t 2 x1 + 3 x 2 1200 (Re sister ) 2 x1 + x 2 1000 (Capacitor ) 4 x 2 800 (Chips )

(a) Determine the Optimal Product mix and status of each resource. (b) Determine the range of applicability of the dual prices for each resource. (c) Find the unit profit range for model 1 and Model 2 that will keep the current solution optimal. (d) If the availability of capacitor is limited by the range of applicability computed in (b), determine the corresponding range of the optimal profit and the corresponding ranges for the number of units to be produced of Model 1 and 2. (e) A new contractor is offering to sell HiDec additional resisters at 40 cents each but only if HiDec would purchase at least 500 units. Should Hidec accept the offer? 5. Solve the following integer programming problem using Cutting-plane algorithm.
(a ) Max z = 3 x1 + 4 x 2 s.t. 3 x1 + 2 x 2 8, x1 + 4 x 2 10, x1 , x 2 0 and are integers (b) Min z = 2 x1 3 x 2 s.t. 2 x1 + 2 x 2 7, x1 2, x 2 2, x1 , x 2 0 and are integers

6. Solve the following integer programming problem using Branch and Bound method.
( a) Min z = 2 x1 + 3 x 2 s.t. 6 x1 + 5 x 2 25, x1 + 3x 2 10, x1 , x 2 0 and are integers (b) Max z = 2 x1 + 20 x 2 10 x3 s.t. 2 x1 + 20 x 2 + 4 x3 15, 6 x1 + 20 x 2 + 4 x3 = 20 x1 , x 2 , x3 0 and are integers

7. Solve the following integer programming problem using Cutting-plane algorithm as well as using Branch and Bound method.
(a ) Max z = 3 x1 + 4 x 2 s.t. 3 x1 + 2 x 2 8, x1 + 4 x 2 10, x1 , x 2 0 and are integers (b) Min z = 2 x1 3 x 2 s.t. 2 x1 + 2 x 2 7, x1 2, x 2 2, x1 , x 2 0 and are integers

8. Solve the following integer programming problem using Cutting-plane algorithm as well as using Branch and Bound method
(a ) Max Z = 3x 1 + x 2 + 3 x3 s.t x1 + 2 x 2 + x3 4, 4 x 2 3 x3 2, x 1 2 x 2 + 2 x3 3, x1 , x 2 x3 0. where x 1 and x3 are integers. [Ans. x1 = 5, x 2 = 11 / 4, x 3 = 3, MaxZ = 107/4]

(b)

Max Z = 3x 1 + x 2 + 3 x3 x1 + 2 x 2 + x3 4, 2 x2 3 x3 1, x 1 3 x 2 + 2 x3 3, 2

x1 , x 2 x3 0. x3 is integers. [Ans. x1 = 0, x 2 = 1, x 3 = 2, MaxZ = 7]

9. A Company has three cement plants from which cements has to be transported to be transported to four distribution centers. With identical costs of production at the three plants, the only variable costs involved are transportation costs. The monthly demand at the four distribution centers and the distance from the plants to the distribution centers (in km) are given below. Plants W A B C Monthly Demand) 500 200 600 9000 Distribution centers X Y Z 1000 700 400 9000 150 500 100 10000 800 100 900 400 0 Monthly Production (tones) 10000 12000 8000

The transportation charges are Rs 10 per tones per km. Suggest optimal transportation schedule and indicate the minimum transportation cost. If, for certain reasons, rout from plant C to distribution centre X is closed down, will the transportation schedule change? If so, suggest the new schedule and effect on the total cost. 10. A manufacturing concern has decided to produce three new products A, B and C at four similar factories I, II, III and IV. The unit manufacturing cost of each product at the four factories is displayed in the table given below: Sales forecast indicates that 71, 47 and 93 units of products A, B and C respectively should be produced per day. The factories can produce at the most 71, 35, 45 and 60 units respectively of the product per day. I II III IV A 14 56 48 27 B 82 35 21 81 C 99 31 71 63 Determine how to allocate the products to the factories in order to minimize the total Manufacturing cost (Resolve degeneracy, if any).