LOVELY PROFESSIONAL UNIVERSITY HOMEWORK NO 3

School LIM Department of Management

Name of the faculty member: Jagjit Singh Course No.: MGT 613 Course Title: Operations Research Class: MBA Term:1 Section: T1902 Batch: 2009-11 Max. Marks: 15 Date of Allotment: Oct 13, 2010 Date of Submission: Oct 20, 2010

(5 for submission & 10 for assignment based test)

PART A 1. Consider four bases of operation Bi and three targets Tj. The tons of bombs per aircraft from any base that can be delivered to any target are given in the following table: Target (Tj) T1 T2 T3 B1 8 6 5 Base (Bi) B2 6 6 6 B3 10 8 4 B4 8 6 4 The daily sortie capability of each of the four bases is 150 sorties per day. The daily requirement of sorties spread over each individual target is 200. Find the allocation of sorties from each base to each target which maximizes the total tonnage over all three targets. 2. A company has four warehouses, a, b, c, and d. It is required to deliver a product from these warehouses to three customers A, B and C. The warehouses have the following amounts in stock: Warehouse : a b c d No. of units : 15 16 12 13 and the customers’ requirements are: Customer : A B C No. of units : 18 20 18 The table below shows the costs of transporting one unit from warehouse to the customer. Warehouse a b c d A 8 9 6 3 Customer B 6 11 5 10 C 3 8 7 9 Find the optimal allocation. 3. A firm manufacturing a single product has three plants I, II and III. They have produced 60, 35 and 40 units, respectively during this month. The firm has made a commitment to sell 22 units to customer A, 45 units to customer B, 20 units to customer C, 18 units to customer D and 30 units to customer E. Find the minimum possible transportation cost of

shifting the manufactured product to the five customers. The net unit cost of transportation from the three plants to the five customers is given below: Customers I II III A 4 2 3 B 1 3 5 C 3 2 2 D 4 2 4 E 4 3 4

Plants

PART B 4. A machine operator processes four types of items on his machine and he must choose a sequence for them. The set up cost per change depends on the items currently on machine and the set-up to be made according to the following table: To A B C D A 4 7 3 From Item B 4 6 3 C 7 6 7 D 3 3 7 If he processes each of the items once and only once each week, then how should he sequence the item on his machine? 5. A salesman has to visit five cities A, B, C, D, and E. The distances (in hundred kilometers) between the five cities are as follows: To City A B C D E A 0 1 6 8 4 B 7 0 8 5 6 From City C 6 8 0 9 7 D 8 5 9 0 8 E 4 6 7 8 0 Suggest an optimal route. 6. Products 1, 2, 3, 4 and 5 are to be processed on a machine. The set-up costs in rupees per change depend upon the products presently on the machine and the set-up to be made. These are given by the following data: C12 = 16, C13 = 4, C14 = 12, C23 = 6, C24 = 5, C25 = 8, C35 = 6, C45 = 20; Cij = Cji, Cij = ∞ for i=j, for all values of i and j not given in the data. Find the optimal sequence of products in order to minimize the total set-up cost. Optional Teaser  Two-person game. First player starts with a number from 1-4. 2nd player can add 1-4 to the number and bid that. The first person to bid 50 (or more) wins. Which player would you be and why?
Date: Remarks by HOD (Mandatory) Signature of Faculty Member

Signature of HOD with date Remarks by HOS (Mandatory)

Signature of HOS with date

Master your semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master your semester with Scribd & The New York Times

Cancel anytime.