Transportation Problems

Size: px
Start display at page:

Download "Transportation Problems"

Transcription

1 C H A P T E R 11 Transportation Problems Learning Objectives: Understanding the feature of Assignment Problems. Formulate an Assignment problem. Hungarian Method Unbalanced Assignment Problems Profit Maximization Problems Past Examinations Coverage: Year M-13 N-12 M-12 N-11 M-11 N-10 N-10* M-10 M-10* N-09 Q No b+3b 1d+4d 6 (a) 5 (a) 6 (b) 4 (b) 2 (b) Marks # 5+4 # # 4 # 4 # Year N-09* J-09 J-09* N-08 N-08* M-08 N-07 M-07 N-06 M-06 Q No. 4 (c) 4 (a) 4 (a) 6 (a) 1 (b) Marks 4 # 4 # 3 # 10 6 Year N-05 M-05 N-04 M-04 N-03 M-03 N-02 M-02 N-01 M-01 Q No. 5(c) 2 (b) 3 (b) 3 (c) 3 (c) Marks 8 3 # Year N-00 M-00 N-99 M-99 N-98 M-98 N-97 M-97 N-96 M-96 Q No. 3 (b) 4 (b) 2 (c) 3 (b) 4 (b) 5 (c) 2 (b) 4 (b) 2 (b) 2 (b) Marks * means questions from old syllabus # means theory questions CA. B L Chakravarti (FCA, CPA, CAIIB) Page 11.1

2 Advance Management Accounting Transportation: The transportation problem is concerned with the allocation of items between suppliers (called origins) and consumers (called destinations) so that the total cost of the allocation is minimized. The objective of the transportation problems is to determine the quantity to be shipped from each source to each destinations so as the transportation cost is lowest to maintain the supply and demand requirements. Applications: (i) (ii) (iii) Minimize shipping costs from factories to warehouses (or from warehouses to retail outlets) Determine lowest cost location for new factory; warehouse; office or other facility. Find minimum cost production schedule that satisfies firm s demand and production limitations (called Production Smoothing ) Conditions: To use the transportation algorithm; the following conditions must be satisfied. (i) (ii) (iii) (iv) The cost per item of each combination of origin and destination must be satisfied. The supply of items at each origin must be known. The requirement of items at each destination must be known. The total supply must equal the total demand. Stages in Transportation Problems: The transportation algorithm has four stages. Stages -1: Arrange the data in table format and set up the transportation table to find any feasible allocation. A feasible allocation is one in which all demand at the destinations is satisfied and all supply at the origin is allocated. Stages -2: Do preliminary check consist the following: (i) (ii) Verify Objective = Minimization. In case of Maximization or profit matrix, convert the same in to opportunity loss matrix by subtracting each element from the highest element of the matrix. Verify that the matrix is balanced i.e. Total Availability = Total Requirement. In case of unbalanced matrix, a dummy column or dummy row should be introduced with nil transportation cost. Stages -3: Develop an initial basic feasible solution (IBFS) by using any of the following methods. (i) (ii) (iii) Least Cost method. North-West corner Method. Vogel s Approximation Method. Stages -4: Test the IBFS solution for optimality. Modified Distribution (MODI) is the most common method and widely used for test the optimality. Stages -5: In case the IBFS solution is not optimal, develop the improved solutions. 1. Page 11.2

3 The Transportation Problems Method 1: North-West corner method: The practical steps in the North-West Corner cell are given below: Step 1: Make maximum possible allocation to the upper-left corner cell (known as North-West corner cell) in the first row depending upon the availability to supply for that row and demand requirement for the column containing that cell. Step 2: Move to the next cell of the first row depending upon remaining supply for that Row and the demand requirement for the next column. Go on till the Row totally is exhausted. Step 3: Move to the next row and make allocation to the cell below the cell of the preceding row in which the last allocation was made and follow Step-1 and Step-2. Step 4: Repeat the Step-1 to Step-3 till all requirements are exhausted i.e. entire demand and supply is exhausted. Method 2:- Least Cost Method : The practical steps involved in the Least Cost are given below: Step 1: Make maximum possible allocation to the least cost cell depending upon the demand/supply for the column/row containing that cell. In case of tie in the least cost cell, make allocation to the cell by which maximum demand or capacity is exhausted. Step 2: Make allocation to the second least cost cell depending upon the remaining demand/supply for the column/row containing that cell. Step 3: Repeat the Step-1 and Step-2 till all requirements are exhausted i.e. entire demand and supply is exhausted. Method 3:- Vogel s Approximation Method: This methods uses penalty costs. For each row and column the penalty cost is the difference between the cheapest available route and the next cheapest. Step 1: To calculate the penalty cost for each row and column, we look at the least cost cell and next least cell. For each row and column subtract the least cost cell from the next least cell. This gives the penalty cost of not allocating into the cell with cheapest cost. Write the penalty cost of each row on the right-hand side of the concerned row and penalty cost of each column on the below of the concerned column. Step 2: We choose the row or column with the largest penalty cost and allocate as much as possible to the least cost cell in that row or column depending upon the quantity available. In this way, the highest penalty costs; are avoided as far as possible. In case of tie between the penalty cost, select the row or column having least cost cell however in case of tie even in the case of least cost cell; make allocation to that cell by which maximum requirement are exhausted. Step 3: Shade the row/column whose availability or requirement is exhausted so that it shall not be considered for further allocation. Step 4: Repeat the Step-1 to Step-3 till all requirements are exhausted i.e. entire demand and supply is exhausted. CA. B L Chakravarti (FCA, CPA, CAIIB) Page 11.3

4 Advance Management Accounting Optimality Test: It can be applied to a transportation table if it satisfies the following conditions: a) It contains exactly m+n-1 allocations, where m & n represent the no. of rows & columns of the table. {Note: (i) In case degeneracy occurs (i.e. allocations are less than m+n-1), infinitely small allocation(s) i.e. α is/are introduced in least cost & independent cell to non-degenerate the solution. If least cost cell(s) is/are not independent, then cell(s) with next lower cost(s) is/are chosen. (ii) Degeneracy can occur at initial basic feasible solution or at a later stage. It may be removed once the purpose is over.} b) These allocations are independent i.e. loop can not be performed by them. {Note: (i) Closed path or loop should have even no. of turns & is formed with an allocation on each corner, which in turn is a join of horizontal & vertical (not diagonal) lines. A loop may not involve all the allocations. (ii) Generally, IBFS obtained by Northwest Corner rule or VAM are always in independent positions though they may be m+n-1 or less than m+n-1 in no.} The Stepping-Stone Method 1. Start with an arbitrary empty cell (a cell without allocation a.k.a. non-basic variables) and allocated +1 unit to this cell. 2. In order to maintain conditions of requirement & supply (a.k.a. rim constraints), 1 unit will be deducted/added to basic variables (i.e. cells having allocations). 3. Calculate Net change (a.k.a. opportunity cost or net evaluation) in transportation cost as a result of this perturbation. 4. Calculation Net evaluation for every empty cell. 5. If any cell evaluation is -ve, the cost can be reduced so that the solution under consideration can be improved i.e. it is not optimal. On the other hand if all net evaluation are +ve, the given solution is optimal one. If any net evaluation is Zero, the given solution is optimal but there exist other optimal solutions as well. 6. If solution is not optimal, the cell with largest ve opportunity cost should be selected & allocate maximum units to this route (subject to rim constraints). 7. Iterate towards optimal solution, if further savings are possible. Modified Distribution Method (MODI) 1. For the current IBFS (Initial Basic Feasible Solution) with m+n-1 occupied cell, calculate index numbers (dual variables) U i (i= 1,2,3, m) and V j (j= 1,2,3, n) for rows and columns, respectively. For calculating values of U i andv j, the following relationship (formula) for occupied cells is used. C ij = (U i +V j ) for all I,J. 2. Calculation Opportunity Cost for unoccupied cells by using the following formula: ij = C ij - (U i +V j ) 3. Examine unoccupied cells evaluation for all ij. (a) If ij >0; then the cost of transportation will increase. i.e. and optimal solution has been arrived at. (b) If ij =0; then the cost of transportation will remain unchanged. But there exists are alternative solution. (c) If ij <0; then an improved solution can be obtained by introducing cell (i,j) in the basis and go to next step. 4. Select an unoccupied cell with largest negative opportunity cost among all unoccupied cells. 1. Page 11.4

5 The Transportation Problems 5. Construct a closed path for the unoccupied cell determined in Step 7 and assign plus (+) and minus (-) sign alternatively beginning with plus sign for the selected unoccupied cell in clock wise or the direction. eg:- ᶲ 7-ᶲ ᶲmax i.e the maximum Qnty to be transferred from occupied cell to unoccupied cell = 10- ᶲ 5+ᶲ min of -ᶲ cells i.e. min of 7, 10 i.e. 7 units 6. Assign as many units as possible to the unoccupied cells satisfying rim conditions. The smallest allocation in a cell with negative sign on the closed path indicated the number of units that can be transported to the unoccupied cells. This quantity is added to all the occupied cells on the path marked with plus sign and subtract from those cells on the path marked with minus sign. 7. Go to Step-2 and repeat procedure until all ij >0 i.e. an optimal solution is reached. Calculate the associated total transportation cost. CA. B L Chakravarti (FCA, CPA, CAIIB) Page 11.5

6 Advance Management Accounting Theoretical Questions Q 1: Will the initial solution for a minimization problem obtained by Vogel s Approximation Method and the Least Cost Method be the same? Why? [M 11,4d, 4M] Q 2: What do you mean by Degeneracy in transportation problem? How this can be solved? [M 10, 6b, 4M] Q 3: In an unbalanced minimization transportation problem, with positive unit transport costs from 3 factories to 4 destinations, it is necessary to introduce a dummy destination to make it a balanced transportation problem. How will you find out if a given solution is optimal? [M10, 4b, 4M] [Ans.: No, Dummy destination won t be introduced if total units available at factories = total units required at destinations.] [Nov-09 New] Q 4: How do you know whether an alternative solution exists for a transportation problem? [N 09, 2b, 4M] Q 5: Explain the term degeneracy in a transportation problem. [N 09*, 4c, 4M] Q 6: Q 7: State the methods in which initial feasible solution can be arrived at in a transportation problem [N 08 *, 4a, 4M] What are the common methods of obtaining initial feasible solution in a transportation problem? [N-02, 2b, 3M] 1. Page 11.6

7 The Transportation Problems Practical Questions Q 1: [SA-1] Find Initial basis feasible solution by (i) North-West Corner Method; (ii) Least Cost Method; (iii) Vogel s Approximation Method (VAM) for the following transportation problem in the following cases. (i) When Cell entries represent the unit transportation cost (ii) When Cell entries represent the Contribution Store W 1 W 2 W 3 W 4 Supplies Factory F F F F Demand Q 2: [SA-2] Find Initial basis feasible solution by (i) North-West Corner Method; (ii) Least Cost Method; (iii) Vogel s Approximation Method (VAM) for the following transportation problem in the following cases. (i) When Cell entries represent the unit transportation cost (ii) When Cell entries represent the Contribution Store W 1 W 2 W 3 Supplies Factory F F F F Demand Q 3: [SA-3] Find Initial basis feasible solution by (i) North-West Corner Method; (ii) Least Cost Method; (iii) Approximation Method (VAM) for the following transportation problem in the following cases. (i) When Cell entries represent the unit transportation cost (ii) When Cell entries represent the Contribution Store W 1 W 2 W 3 W 4 Supplies Factory F F F Demand Vogel s CA. B L Chakravarti (FCA, CPA, CAIIB) Page 11.7

8 Advance Management Accounting Q4: [SM-1] A company has factories at A, B and C which supply warehouse at D, E, F and G. Monthly factory capacities are 160, 150 and 190 units respectively. Monthly warehouse requirements are 80, 90, 110 and 160 units respectively. Units shipping costs (in Rs.) are as follows: To D E F G From A B C Q 5: [SM-2] [Multiple solution case] Solve the following transportation problem To D1 D2 D3 D4 From Q Q Q Q 6: [SM-3] [MAXIMIZATION TRANSPORTATION PROBLEMS] A company has 3 factories manufacturing the same product and 5 sole agencies in different parts of the country. Production costs differ from factory to factory, and the sales prices from agency to agency. The shipping cost per unit product from each factory to any agency is known. Given the following data, find the production and distribution schedules most profitable to the company Production Max Capacity Factory i Cost/Unit No. of Units Cost Agency j Demand Sales to be Met Price Shipping Q 7: [SM-4] [N-89] [Prohibited routes] Solve the following transportation problem Godown 1 Godown 2 Godown 3 Godown 4 Godown 5 Godown 6 Stock Availability Factory Factory * 5 20 Factory Factory Demand Note: It is not possible to transport any quantity from factory 2 to godown 5. State whether the solution derived by you is unique. 1. Page 11.8

9 [Ans.: Total Cost Rs. 1120] The Transportation Problems Q 8: [SM- 5] The Link manufacturing company has several plants, three of which manufacture two principal products, standard card table and deluxe card table. A new deluxe card table will be introduced which must be considered in term of selling price & costs. The selling prices are: Standard Rs , Deluxe Rs , and new Deluxe Rs Requirements Variable costs Available plant capacity Model Quantity Plant A Plant B Plant C Plant Capacity Standard A 800 Deluxe B 600 New Deluxe C 700 Solve this problem by the transportation technique for the greatest contribution. Q 9: [SM-6] [SA-35] A company wishes to determine an investment strategy for each of the next four years. Five investment types have been selected, investment capital has been allocated for each of the coming four years, and maximum investment levels have been established for each investment type. An assumption is that amounts invested in any year will remain invested until the end of the planning horizon of four years. The following table summaries the data for this problem. The values in the body of the table represent net return on investment of one rupee up to the end of the planning horizon. For example, a rupee invested in investment type B at the beginning of year 1 will grow to Rs by the end of the fourth year, yielding a net return of Rs Investment made at the beginning of year Investment Type Amount available (Rs. In 000) A B C D E Maximum Rupee Investment (Rs. In 000) The objective is this problem is to determine the amount to be invested at the beginning of each year in an investment type so as to maximize the net rupee return for the four-year period. Solve the above transportation problem and get an optimal solution. Also calculate the net return on investment for the planning horizon for four-year period. [Ans: 1-E- 500; 2-B- 390; 3-D- 375; 4-A- 37.5; 4-C- 125; 4-D- 17.5; Total Return = 1445.] CA. B L Chakravarti (FCA, CPA, CAIIB) Page 11.9

10 Advance Management Accounting Q 10: [SM-7] [N 96, 2b, 10M] [V2-E9] [Investment decision] XYZ and co. has provided the following data seeking your advice on optimum investment strategy: Beginning of the year Net Return Data (in paise) of Selected Investments Amount available (Lacs) P Q R S Maximum Investment (lacs) The following additional information are also provided: P, Q, R, and S represent the selected investments. The company decided to have four years investment plan. The policy of the company is that amount invested in any year will remain so until the end of the fourth year. The values (paise) in the table represent net return on investment of one Rupee till the end of the planning horizon (for example, a Rupee invested in Investment P at the beginning of year 1 will grow to Rs by the end of the fourth year, yielding a return of 95 paise). Using the above, determine the optimum investment strategy. Q 11: [SM-8] [N 97, 2b, 10M] [SA-30] A particular product is manufactured in factories A, B, C and D; and is sold at centres 1, 2, and 3. The cost in Rs. of product per unit and capacity in kgs per unit time of each plant is given below: Factory Cost (Rs.) per unit Capacity (kgs) per unit A B C D The sale price in Rs. per unit and the demand in kgs per unit time are as follows: Sales Centre Sale Price (Rs.) per unit Demand (kgs) per unit Find the optimal sale distribution. [Ans.: From Factory To Sales Centre Quantity Total Profit A B C D D Dummy Page 11.10

11 The Transportation Problems Q 12: [SM-9] [M 98, 5c, 10M] [V2-3] [SA-24] Consider the following data for the transportation problem: Factory Destination Supply to be exhausted A B C Demand Since there is not enough supply, some of the demands at the three destinations may not be satisfied. For the unsatisfied demands, let the penalty costs be rupees 1,2 and 3 for destinations (1), (2) and (3) respectively. Find the optimal allocation that minimizes the transportation and penalty cost. Q 13: [SM-10] [N 98, 4b, 10M] [SA-34] ABC Enterprises is having three plants manufacturing dry-cells, located at different locations. Production cost differs from plant to plant. There are five sales offices of the company located in different regions of the country. The sales prices can differ from region to region. The shipping cost from each plant to each sales office and other data are given by following table: Production Data Table Production cost per unit Max Capacity in no. of units Plant no Shipping Cost and Demand & Sales Prices table Shipping Cost Sales Office 1 Sales Office 2 Sales Office 3 Sales Office 4 Sales Office 5 Plant Plant Plant Demand and Sales Price Sales Office 1 Sales Office 2 Sales Office 3 Sales Office 4 Sales Office 5 Demand Sales Price Find the production and distribution schedule most profitable to the company. [Ans.: Plant Sales Office Units Total Profit (Rs.) Dummy Total 3170 CA. B L Chakravarti (FCA, CPA, CAIIB) Page 11.11

12 Advance Management Accounting Q 14: [SA-19] Find Initial basic feasible solution by Vogel s Approximation Method. Is the number of allocation equal to m+n- 1 if no, how will you deal with this situation? Store W 1 W 2 W 3 W 4 Supplies Factory F F F Demand Note: Cell entries represent the unit transportation cost F F F Q 15: [SA-20] [Number of allocation = m+n-1] Test the following Initial basic solution for Optimality. Store Factory W 1 W 2 W 3 W F Demand Note: Cell entries represent the unit transportation cost Supplies F Q 16: [SA-21] [Number of allocation < m+n-1] Test the following Initial basic solution for Optimality. Store Factory W 1 W 2 W 3 W 4 F 1 e F Demand Note: Cell entries represent the unit transportation cost Supplies Page 11.12

13 The Transportation Problems Q 17: [SA-22] Solve the following transportation problem with the restriction that nothing can be transported from F 2 to W 3. Store W 1 W 2 W 3 W 4 Supplies Factory F F Required Note: Cell entries represent the unit transportation cost 4 11 Q 18: [SA-36] Solve the following transportation problem to maximize profit and give criteria for optimality: Store Profit ( )/Unit Destination Origin Supplies A B C Demand Q 19: [SA-37] Solve the following transportation problem: Stock Available Demand Q 20: [SA-27] Consider the following transportation cost table. The costs are given in Rupees, the supply and demand are in units. Determine the optimal solution: Destination Source Supply I II III Demand CA. B L Chakravarti (FCA, CPA, CAIIB) Page 11.13

14 Advance Management Accounting Q 21: [SA-25] Solve the following transportation cost table for minimum cost: Origins Destinations A B C D Requirements I II III IV Availabilities Q 22: [SA-23] Solve the following transportation cost table for minimum cost: Godowns Stock Factory Available I II III IV Demand Note: It is not possible to transport any quantity from factor 2 to Godown 5. Required: State whether the solution derived by you is unique. Q 23: [V2-E2] [SA-32] A Company has four factories F1, F2, F3 and F4, manufacturing the same product. Production and raw material costs differ from factory to factory and are given in the first two rows of the following table. The Transportation costs from the factories to sales depots S1, S2 and S3 are given in the next three rows of the table. The production capacity of each factory is given in the last row. The last two columns in the table given the sales price and the total requirement at each depot: Item Per unit Factory Sales price Per unit Requirement F1 F2 F3 F4 Production cost Raw material cost Transportation cost Production capacity Determine the most profitable production and distribution schedule and the corresponding profit. The surplus should be taken to yield zero profit. [Ans:Profit associated with the optimum Program is Rs. 480.] Q 24: [SA-28] [N 90] Stronghold Construction Company is interested in taking loans from banks for some of its projects P, Q, R, S and T. The rates of interest and the lending capacity differ from bank to bank. All these projects are to be completed. The relevant details are provided in the following table. Assuming the role of a consultant, advise this company 1. Page 11.14

15 The Transportation Problems as to how it should take the loans so that the total interest payable will be the least. Are there alternative optimum solutions? If so, indicate one such solution. Interest Rate in Percentage for Project Max. Credit Bank P Q R S T ( 000) Pvt. Bank Any Amount Nationalized Co-Operative Amount Required ( 000) Q 25: [SA-29] A Manufacturer of jeans is interested in developing an advertising campaign that will reach four different age groups. Advertising campaigns can be conducted through TV, Radio and Magazines. The following table gives the estimated cost in paise per exposure for each age group according to the medium employed. In addition, maximum exposure levels possible in each of the media, namely TV, Radio and Magazines are 40, 30 and 20 million respectively. Also the minimum desired exposures within each age group namely 13-18, 19-25, 26-35, 36 and older are 30, 25, 15 and 10 million. The objective is to minimum exposure level in each age group. Required: (i) (ii) Media Age Group & Older TV Radio Magazines Formulate the above as a transportation problem, and find the optimal solution. Solve this problem if the policy is to provide at least 4 million exposures through TV in the age group and at least 8 million exposures through TV in the age group CA. B L Chakravarti (FCA, CPA, CAIIB) Page 11.15

16 Advance Management Accounting Practical Questions Previous Examinations Paper Q: [M 11, 1d, 5M] The following matrix is a minimization problem for transportation cost. The unit transportation costs are given at the right hand corners of the cells and the ij values are encircled. D 1 D 2 D 3 D 4 Supply F F 2 8 F Demand Find the optimum solution (s) and the minimum cost. [Ans: (i) F 1 -D ; F 1 -D ; F 1 -D ; F 2 -D ; F 3 -D ; Total Cost = (ii) F 1 -D ; F 1 -D ; F 1 -D ; F 2 -D ; F 3 -D ; Total Cost = 4500 Q: [N 10, 6a, 8M] A company has three plants located at A, B and C. The production of these plants is absorbed by four distribution centres located at X, Y, W and Z. the transportation cost per unit has been shown in small cells in the following table: Distribution Centre X Y W Z Supply Factories (Units) A B C Demand Find the optimum solution of the transportation problem by applying Vogel s Approximation Method. [Ans: Total Cost ] 1. Page 11.16

17 The Transportation Problems Q: [N 10*, 5a,10M] A company has 3 factories F1, F2 and F3 which supply the same product to 5 agencies, A1, A2, A3, A4 and A5. Unit production costs, shipping costs and selling prices differ among the different sources and destinations and are given below: F1 F2 F3 Production Cost (`/Unit) Production Capacity (No. of units) Agencies A1 A2 A3 A4 A5 Selling Price (`/Unit) Demand (No. of units) Shipping Costs/Unit A1 A2 A3 A4 A5 F F F (i) Set up the initial transportation matrix for minimization. (ii) After doing (i) above, you are given the following additional information: (a) 40 units must be transported from F2 to A2 as per an earlier agreement made by F2 with A2 s customer. This quantity is included in the figures given for total production and demand at these locations. (b) Not more than 30 units may be sent from F1 to A1, since the transporter s vehicle lacks space in this route. Incorporating conditions (a) and (b) above, obtain the initial solution by Vogel s Approximation Method. (Do not attempt to continue for the full and final solution.) Q: [M 09, 4a, 6M] [V2-10][ Minimization-balanced-degeneracy] The cost per unit of transporting goods from factories X, Y, Z to destinations A, B and C, and the quantities demanded and supplied are tabulated below. As the company is working out the optimum logistics, the Govt. has announced a fall in oil prices. The revised unit costs are exactly half the costs given in the table. You are required to evaluate the minimum transportation cost. Factories\Destinations A B C Supply X Y Z Demand [Ans.: Min. transportation cost is. 105] Q: [M 08, 6a, 10M] [V2-8] [SA-27] Goods manufactured at 3 plants, A, B and C are required to be transported to sales outlets X, Y and Z. The unit costs of transporting the goods from the plants to the outlets are given below: Sales outlets\plants A B C Total Demand X Y Z Total supply CA. B L Chakravarti (FCA, CPA, CAIIB) Page 11.17

18 Advance Management Accounting You are required to: i. Compute the initial allocation by North-West Corner Rule. ii. Compute the initial allocation by Vogel s approximation method and check whether it is optional. iii. State your analysis on the optionality of allocation under North-West corner Rule and Vogel s Approximation method. [Ans: (i) A-X-20 60; A-Y-20 80; B-Y-20 80; B-Z-30 90; C-Z ; Total Cost = 460 (ii) A-X-20 60; A-Y-20 80; B-Z-50 80; C-Y ; C-Z ; Total Cost = 460 (iii)the solution under VAM is optimal with a zero in R2C2 which means that the cell C2R2 which means that the cell C2R2 can come into solution, which will be another optimal solution. Under NWC rule the initial allocation had C2R2 and the total cost was the same Rs. 460 as the total cost under optimal VAM solution. Thus, in this problem, both methods have yielded the optimal solution under the 1st allocation. If we do an optimality test for the solution, we will get a zero for ij in C3R2 indicating the other optimal solution which was obtained under VAM.] Q: [M 07, 1b, 6M] [V2-7] The initial allocation of a transportation problem, along with the unit cost of transportation from each origin to destination is given below. You are required to arrive at the minimum transportation cost by the Vogel s Approximation method and check for optimality. (Hint: Candidates may consider u1 = 0 at Row 1 for initial cell evaluation) Requirement Availability [Ans: Minimum Transportation Cost 204] Q: [M-03, 5c, 10M][ Maximization-unbalanced] A company has three factories and four customers. The company furnishes the following schedule of profit per unit on transportation of its goods to the customers in rupees: Customers Factory A B C D Supply P Q R Demand Page 11.18

19 The Transportation Problems You are required to solve the transportation problem to maximize the profit and determine the resultant of optimal profit. [Ans.: Maximum Profit. 5130] Q: [M-02, 3b, 10M] [V2-1][ Minimization-Unbalanced] A product is manufactured by four factories A, B, C & D. The unit production costs are Rs. 2, Rs. 3, Re. 1 and Rs. 5 respectively. Their daily production capacities are 50, 70, 30 and 50 units respectively. These factories supply the product to four stores P, Q, R, S. The demand made by these stores are 25, 35, 105 and 20 units respectively. Unit transportation cost in rupees from each factory to each store is given in the following table: Stores Factories P Q R S A B C D Determine the extent of deliveries from each of the factories to each of the stores so that the total cost (production and transportation together) is minimum. [Ans.: Total Cost 1465] Q: [N 01, 3c, 10] [V2-2] Multiple Optimal Solutions A Compressed Natural Gas (CNG) company has three plants producing gas and four outlets. The cost of transporting gas from different production plants to the outlets, production capacity of each plant & requirement at different outlet is shown in the following cost-matrix table. Outlets Plants A B C D Capacity of Production X Y Z Requirement Determine a transportation schedule so that the cost is minimized. The cost in the cost-matrix is given in thousand of rupees. [Ans.: Minimum costs 7350 thousands] Q: [M 01, 3c, 10M] A company has 3 plants and 3 warehouses. The Cost of sending a unit from different plants to the warehouses, production at different plants and demand at different warehouses are shown in the following cost matrix table: Warehouses Plants A B C Production X Y Z Demand Determine a transportation schedule, so that the cost is minimized. Assume that the cost in the cost matrix is given in thousand of rupees. [Ans.: X-B ; Y-B ; Y-C ; Y-dummy-40 0; Z-A ; Z-B ; Total Cost = 9696] CA. B L Chakravarti (FCA, CPA, CAIIB) Page 11.19

20 Advance Management Accounting Q: [N 00, 3b, 10M] [V2-E4] Following is the profit matrix based on four factories and three sales depots of the company: S1 S2 S3 Availability F Factories F F F Requirement Determine the most profitable distribution schedule and the corresponding profit, assuming no profit in case of surplus production. [Ans: Total Profit = 480] Q: [M 00, 4b, 10M] [V2-E5] A company produces a small component for all industrial products and distributes it to five wholesalers at a fixed prices of Rs.2.50 per unit. Sales forecasts indicate that monthly deliveries will be 3,000, 3,000, 10,000, 5,000 and 4,000 units to wholesalers 1,2,3,4 and 5 respectively. The monthly production capabilities are 5,000, 10,000, 12,500 at plants 1, 2 and 3 respectively. The direct costs of production of each unit are Rs.1.00 and Rs.0.80 at plants 1, 2 and 3 respectively. The transportation costs of shipping a unit from a plant to a wholesaler are given below: Wholesaler Plant Find how many components each plant supplies to each wholesaler in order to maximize profit. [ Ans: Profit 32520] Q: [N 99, 2c, 10M] [V2-E6] The following table shows all the necessary information on the available supply to each warehouse, the requirement of each market and the unit transportation cost from each warehouse to each market: Market I II III IV Supply A Warehouse B C Requirement The shipping clerk has worked out the following schedule from his experience: 12 Units from A to II 1 Unit from A to III 9 Units from A to IV 15 Units from B to III 7 Units from C to I and 1 Unit from C to III You are required to answer the following: (i) Check and see if the clerk has the optimal schedule; (ii) Find the optimal schedule and minimum total shipping cost; and 1. Page 11.20

21 The Transportation Problems (iii) If the clerk is approached by a carrier of route C to II, who offers to reduce his rate in the hope of getting some business, by how much should the rate be reduced before the clerk should consider giving him an order? [Ans: (i) Clerk has not worked out the optimal schedule; (ii) Minimum total shipping cost 104; (iii) Total Shipping Cost = Rs.103] Q: [M 99, 3b, 10M] [V2-E7] A company has three warehouses W1, W2 and W3. It is required to deliver a product from these warehouses to three customers A, B and C. There warehouses have the following units in stock. Warehouse: W1 W2 W3 No. of units: and customer requirements are: Customer: A B C No. of units: The table below shows the costs of transporting one unit from warehouse to the customer: Warehouse W1 W2 W3 A Customer B C Find the optimal transportation route. Answer Total Cost = Rs. 830 [Ans.: W 1 -A ; W 2 -A-5 35; W 2 -B ; W 2 -C-7 49; W 3 -C ; Total Cost = 680] Q: [N 98, 4b, 10M] [SM-10] [SA-34] ABC Enterprises is having three plants manufacturing dry-cells, located at different locations. Production cost differs from plant to plant. There are five sales offices of the company located in different regions of the country. The sales prices can differ from region to region. The shipping cost from each plant to each sales office and other data are given by following table: Production Data Table Production cost per unit Max Capacity in no. of units Plant no Shipping Cost and Demand & Sales Prices table Shipping Cost Sales Office 1 Sales Office 2 Sales Office 3 Sales Office 4 Sales Office 5 Plant Plant Plant Demand and Sales Price Sales Office 1 Sales Office 2 Sales Office 3 Sales Office 4 Sales Office 5 Demand Sales Price Find the production and distribution schedule most profitable to the company. [Ans.: ; ; ; ; 2-dummy-50 0; ; ; ; Total Profit = 3170] CA. B L Chakravarti (FCA, CPA, CAIIB) Page 11.21

22 Advance Management Accounting Q: [M 98, 5c, 10M] [SM-9] [V2-3] [SA-24] Consider the following data for the transportation problem: Factory Destination Supply to be exhausted A B C Demand Since there is not enough supply, some of the demands at the three destinations may not be satisfied. For the unsatisfied demands, let the penalty costs be rupees 1,2 and 3 for destinations (1), (2) and (3) respectively. Find the optimal allocation that minimizes the transportation and penalty cost. [Ans.: A ; B ; B ; B ; C ; Dummy ; Total Cost = 555] Q: [N 97, 2b, 10M] [SM-8] [SA-30] A particular product is manufactured in factories A, B, C and D; and is sold at centres 1, 2, and 3. The cost in Rs. of product per unit and capacity in kgs per unit time of each plant is given below: Factory Cost (Rs.) per unit Capacity (kgs) per unit A B C D The sale price in Rs. per unit and the demand in kgs per unit time are as follows: Sales Centre Sale Price (Rs.) per unit Demand (kgs) per unit Find the optimal sale distribution. [Ans.: A ; B ; C ; D ; D ; Dummy ;Total Profit = 680] Q: [M 97,4b, 10M] [V2-E10][ Minimization-balanced-degeneracy] A company has four terminals U, V, W, and X. At the start of a particular day 10, 4, 6, and 5 trailers respectively are available at these terminals. During the previous night 13, 10, 6, and 6 trailers respectively were loaded at plants A, B, C, and D. The company dispatcher has come up with the costs between the terminals and plants as follows: Plants Terminals A B C D U V W X Find the allocation of loaded trailers from plants to terminals in order to minimize transportation cost. [Ans: U-A 80; U- C 60; V-B 60; V-D 20; W-B 210; X-D 125;Terminal Plant Cost = 555] 1. Page 11.22

23 The Transportation Problems Q: [N 96, 2b, 10M] [SM-7] [V2-E9] [Investment decision] XYZ and co. has provided the following data seeking your advice on optimum investment strategy: Beginning of the year Net Return Data (in paise) of Selected Investments Amount Available (Lacs) P Q R S Maximum Investment (lacs) The following additional information are also provided: P, Q, R, and S represent the selected investments. The company decided to have four years investment plan. The policy of the company is that amount invested in any year will remain so until the end of the fourth year. The values (paise) in the table represent net return on investment of one Rupee till the end of the planning horizon (for example, a Rupee invested in Investment P at the beginning of year 1 will grow to Rs by the end of the fourth year, yielding a return of 95 paise). Using the above, determine the optimum investment strategy. [Ans: Net Return lacs] Q: [M 96, 2b, 10M] [V2 E8] [SA-33] A company has four factories situated in four different locations in the country and four sales agencies located in four other locations in the country. The cost of production (Rs. Per unit), the sales price (Rs. per unit), and shipping cost (Rs. Per unit) in the case of matrix, monthly capacities and monthly requirements are given below: Factory Sales Agency Monthly Cost of Capacity Production (Units) A B C D Monthly Requirement Sale Price Find the monthly production and distribution schedule which will maximize profit. [Total Profit = 155] CA. B L Chakravarti (FCA, CPA, CAIIB) Page 11.23

24 Advance Management Accounting Q: [May-95] [SA-31] A leading firm has three auditors. Each auditor can work up to 160 hours during the next month, during which time three projects must be completed. Project 1 will 130 hours, project 2 will take 140 hours, and project 3 will take 160 hours. The amount per hour that can be billed for assigning each auditor to each project is given in Table 1: Table1 Project Auditor Rs. Rs. Rs Formulate this as a transportation problem and find the optimal solution. Also find out the maximum total billings during the next month. [Ans: ; ; ; ; Total Billing= ] Important Notes 1. Page 11.24

The Transportation Problem

The Transportation Problem The Transportation Problem Stages in solving transportation problems Steps for Stage 1 (IBFS) 1) If problem is not balanced, introduce dummy row/column to balance it. [Note: Balancing means ensuring that

More information

CHAPTER 4 A NEW ALTERNATE METHOD OF TRANS-SHIPMENT PROBLEM

CHAPTER 4 A NEW ALTERNATE METHOD OF TRANS-SHIPMENT PROBLEM 56 CHAPTER 4 A NEW ALTERNATE METHOD OF TRANS-SHIPMENT PROBLEM 4.1 Introduction In a transportation problem shipment of commodity takes place among sources and destinations. But instead of direct shipments

More information

Transportation problem

Transportation problem Transportation problem Operations research (OR) are concerned with scientifically deciding how to best design and operate people machine systems, usually under conditions requiring the allocation of scarce

More information

3. Transportation Problem (Part 1)

3. Transportation Problem (Part 1) 3 Transportation Problem (Part 1) 31 Introduction to Transportation Problem 32 Mathematical Formulation and Tabular Representation 33 Some Basic Definitions 34 Transportation Algorithm 35 Methods for Initial

More information

TRANSPORTATION PROBLEM AND VARIANTS

TRANSPORTATION PROBLEM AND VARIANTS TRANSPORTATION PROBLEM AND VARIANTS Introduction to Lecture T: Welcome to the next exercise. I hope you enjoyed the previous exercise. S: Sure I did. It is good to learn new concepts. I am beginning to

More information

DEA Model: A Key Technology for the Future

DEA Model: A Key Technology for the Future International Journal of Engineering Science Invention ISSN (Online): 2319 6734, ISSN (Print): 2319 6726 Volume 5 Issue 12 December 2016 PP. 30-33 DEA Model: A Key Technology for the Future Seema Shokeen

More information

Optimal Solution of Transportation Problem Based on Revised Distribution Method

Optimal Solution of Transportation Problem Based on Revised Distribution Method Optimal Solution of Transportation Problem Based on Revised Distribution Method Bindu Choudhary Department of Mathematics & Statistics, Christian Eminent College, Indore, India ABSTRACT: Transportation

More information

The Study of Using LP to Solve Flower Transport Problem

The Study of Using LP to Solve Flower Transport Problem The Study of Using LP to Solve Flower Transport Problem 1 Chung-Hsin Liu, 2 Le Le Trung 1 Department of Computer Science & Information Engineering, Chinese Culture University, Taiwan, R.O.C. liu3.gold@msa.hinet.net

More information

Model Question Paper with Solution

Model Question Paper with Solution Annexure P Model Question Paper with Solution Section A (Very Short Answer Questions) Q.1. Write down three differences between PERT and CPM in brief? Ans.1. The Program Evaluation and Review Technique

More information

Effect of Transportation Model on Organizational Performance: A Case Study of MTN Nigeria, Asaba, Delta State, Nigeria

Effect of Transportation Model on Organizational Performance: A Case Study of MTN Nigeria, Asaba, Delta State, Nigeria International Journal of Innovative Social Sciences & Humanities Research 6(2):76-82, April-June, 2018 SEAHI PUBLICATIONS, 2018 www.seahipaj.org ISSN: 2354-2926 Effect of Transportation Model on Organizational

More information

University Question Paper Two Marks

University Question Paper Two Marks University Question Paper Two Marks 1. List the application of Operations Research in functional areas of management. Answer: Finance, Budgeting and Investment Marketing Physical distribution Purchasing,

More information

ISE 204 OR II. Chapter 8 The Transportation and Assignment Problems. Asst. Prof. Dr. Deniz TÜRSEL ELİİYİ

ISE 204 OR II. Chapter 8 The Transportation and Assignment Problems. Asst. Prof. Dr. Deniz TÜRSEL ELİİYİ ISE 204 OR II Chapter 8 The Transportation and Assignment Problems Asst. Prof. Dr. Deniz TÜRSEL ELİİYİ 1 The Transportation and Assignment Problems Transportation Problems: A special class of Linear Programming

More information

Operation and supply chain management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras

Operation and supply chain management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras Operation and supply chain management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras Lecture - 37 Transportation and Distribution Models In this lecture, we

More information

Statistical Investigation of Various Methods to Find the Initial Basic Feasible Solution of a Transportation Problem

Statistical Investigation of Various Methods to Find the Initial Basic Feasible Solution of a Transportation Problem Statistical Investigation of Various Methods to Find the Initial Basic Feasible Solution of a Transportation Problem Ravi Kumar R 1, Radha Gupta 2, Karthiyayini.O 3 1,2,3 PESIT-Bangalore South Campus,

More information

TRANSPORTATION PROBLEM FOR OPTIMALITY

TRANSPORTATION PROBLEM FOR OPTIMALITY Asia Pacific Journal of Research Vol: I. Issue XXXIV, December 01 ISSN: 0-04, E-ISSN-4-49 TRANSPORTATION PROBLEM FOR OPTIMALITY Mrs. M.Vijaya Lakshmi 1 & Mr. V. Hareeswarudu 1& Assistant Professor, Department

More information

Application of Transportation Linear Programming Algorithms to Cost Reduction in Nigeria Soft Drinks Industry

Application of Transportation Linear Programming Algorithms to Cost Reduction in Nigeria Soft Drinks Industry Application of Transportation Linear Programming Algorithms to Cost Reduction in Nigeria Soft Drinks Industry A. O. Salami Abstract The transportation problems are primarily concerned with the optimal

More information

Assignment Technique for solving Transportation Problem A Case Study

Assignment Technique for solving Transportation Problem A Case Study Assignment Technique for solving Transportation Problem A Case Study N. Santosh Ranganath Faculty Member, Department of Commerce and Management Studies Dr. B. R. Ambedkar University, Srikakulam, Andhra

More information

2. Solve the following LPP by Graphical method

2. Solve the following LPP by Graphical method DHANALAKSHMI SRINIVASAN ENGINEERING COLLEGE PERAMBALUR DEPARTMENT OF SCIENCE AND HUMANITIES QUESTION BANK BA6122 OPERATIONS RESEARCH UNIT-I LINEAR PROGRAMMING MODELS PART-A 1. What is operations research?

More information

Using Transportation Model for Aggregate Planning: A Case Study in Soft Drinks Industry

Using Transportation Model for Aggregate Planning: A Case Study in Soft Drinks Industry Journal of Logistics Management 218, 7(1): 11-46 DI: 1.5923/j.logistics.21871.2 Using Transportation Model for Aggregate Planning: A Case Study in Soft Drinks Industry Suhada. Tayyeh *, Saffa J. Abdul-Hussien

More information

OPERATIONS RESEARCH Code: MB0048. Section-A

OPERATIONS RESEARCH Code: MB0048. Section-A Time: 2 hours OPERATIONS RESEARCH Code: MB0048 Max.Marks:140 Section-A Answer the following 1. Which of the following is an example of a mathematical model? a. Iconic model b. Replacement model c. Analogue

More information

A comparative study of ASM and NWCR method in transportation problem

A comparative study of ASM and NWCR method in transportation problem Malaya J. Mat. 5(2)(2017) 321 327 A comparative study of ASM and NWCR method in transportation problem B. Satheesh Kumar a, *, R. Nandhini b and T. Nanthini c a,b,c Department of Mathematics, Dr. N. G.

More information

Keywords: Transportation problem; initial solution; distribution; algorithm; VAM, LC, NWC

Keywords: Transportation problem; initial solution; distribution; algorithm; VAM, LC, NWC American International Journal of Research in Science, Technology, Engineering & Mathematics Available online at http://www.iasir.net ISSN (Print): 2328-3491, ISSN (Online): 2328-3580, ISSN (CD-ROM): 2328-3629

More information

TRANSPORTATION MODEL IN DELIVERY GOODS USING RAILWAY SYSTEMS

TRANSPORTATION MODEL IN DELIVERY GOODS USING RAILWAY SYSTEMS TRANSPORTATION MODEL IN DELIVERY GOODS USING RAILWAY SYSTEMS Fauziah Ab Rahman Malaysian Institute of Marine Engineering Technology Universiti Kuala Lumpur Lumut, Perak, Malaysia fauziahabra@unikl.edu.my

More information

An Alternative Method to Find Initial Basic Feasible Solution of a Transportation Problem

An Alternative Method to Find Initial Basic Feasible Solution of a Transportation Problem Annals of Pure and Applied Mathematics Vol., No. 2, 2, 3-9 ISSN: 2279-087X (P), 2279-0888(online) Published on 6 November 2 www.researchmathsci.org Annals of An Alternative Method to Find Initial Basic

More information

Change in Overhead Cost Change in Production Units

Change in Overhead Cost Change in Production Units Test Series: October, 2018 MOCK TEST PAPER 2 FINAL (OLD) COURSE: GROUP II PAPER 5: ADVANCED MANAGEMENT ACCOUNTING SUGGESTED ANSWERS/HINTS 1. (a) (*) P Q R I. Contribution per unit 4 3 5 II. Units (Lower

More information

Transportation Logistics Part I and II

Transportation Logistics Part I and II Transportation Logistics Part I and II Exercise Let G = (V,E) denote a graph consisting of vertices V = {,2,3,4,5,6,,8} and arcs A = {(,2),(,3),(2,4),(3,2),(4,3),(4,5),(4,6),(5,3),(5,),(6,8),(,4),(,6),(,8)}.

More information

The Transportation and Assignment Problems. Chapter 9: Hillier and Lieberman Chapter 7: Decision Tools for Agribusiness Dr. Hurley s AGB 328 Course

The Transportation and Assignment Problems. Chapter 9: Hillier and Lieberman Chapter 7: Decision Tools for Agribusiness Dr. Hurley s AGB 328 Course The Transportation and Assignment Problems Chapter 9: Hillier and Lieberman Chapter 7: Decision Tools for Agribusiness Dr. Hurley s AGB 328 Course Terms to Know Sources Destinations Supply Demand The Requirements

More information

WEIGHTED COST OPPORTUNITY BASED ALGORITHM FOR INITIAL BASIC FEASIBLE SOLUTION: A NEW APPROACH IN TRANSPORTATION PROBLEM

WEIGHTED COST OPPORTUNITY BASED ALGORITHM FOR INITIAL BASIC FEASIBLE SOLUTION: A NEW APPROACH IN TRANSPORTATION PROBLEM Journal of Engineering Science 08(1), 2017, 63-70 JES an international Journal WEIGHTED COST OPPORTUNITY BASED ALGORITHM FOR INITIAL BASIC FEASIBLE SOLUTION: A NEW APPROACH IN TRANSPORTATION PROBLEM A.R.M.

More information

International Journal of Mathematics Trends and Technology (IJMTT) Volume 44 Number 4 April 2017

International Journal of Mathematics Trends and Technology (IJMTT) Volume 44 Number 4 April 2017 Solving Transportation Problem by Various Methods and Their Comaprison Dr. Shraddha Mishra Professor and Head Lakhmi Naraian College of Technology, Indore, RGPV BHOPAL Abstract: The most important and

More information

UNIVERSITY OF MORATUWA

UNIVERSITY OF MORATUWA UNIVERSITY OF MORATUWA MSC/POSTGRADUATE DIPLOMA IN FINANCIAL MATHEMATICS MA 5101 OPERATIONAL RESEARCH TECHNIQUE I THREE HOURS October 2008 Answer FIVE questions and NO MORE. Question 1 ALI Electronics

More information

ISSN: Int. J. Adv. Res. 6(1), RESEARCH ARTICLE...

ISSN: Int. J. Adv. Res. 6(1), RESEARCH ARTICLE... Journal Homepage: - www.journalijar.com Article DOI: 10.21474/IJAR01/6381 DOI URL: http://dx.doi.org/10.21474/ijar01/6381 RESEARCH ARTICLE APPROIMATION VOGELS EFFECTIVENESS METHOD (VAM) MINIMIZE COST OF

More information

DIS 300. Quantitative Analysis in Operations Management. Instructions for DIS 300-Transportation

DIS 300. Quantitative Analysis in Operations Management. Instructions for DIS 300-Transportation Instructions for -Transportation 1. Set up the column and row headings for the transportation table: Before we can use Excel Solver to find a solution to C&A s location decision problem, we need to set

More information

TRANSPORTATION PROBLEMS EXERCISES

TRANSPORTATION PROBLEMS EXERCISES TRANSPORTATION PROBLEMS EXERCISES Vassilis Kostoglou E-mail: vkostogl@it.teithe.gr URL: www.it.teithe.gr/~vkostogl PROBLEM 1 A factory producing aluminum is supplied with bauxite from three mines (01,

More information

Transportation Theory and Applications

Transportation Theory and Applications Fall 2017 - MTAT.08.043 Transportation Theory and Applications Lecture I: Introduction A. Hadachi Course Syllabus Lecturer: Amnir Hadachi Course website: https://courses.cs.ut.ee/2017/transport/fall Office

More information

SOMANI S Approximation Method(SAM) Innovative Method for finding optimal Transportation Cost. Abstract

SOMANI S Approximation Method(SAM) Innovative Method for finding optimal Transportation Cost. Abstract SOMANI S Approximation Method(SAM) Innovative Method for finding optimal Transportation Cost CHIRAG SOMANI* Asst. Prof. in Mathematics Department of Applied Science & Humanities, Engineering College, Tuwa,

More information

CIS QA LEVEL 2 WEEK 5 TOPIC: LINEAR PROGRAMMING OBJECTIVE AND SHORT ANSWER QUESTIONS

CIS QA LEVEL 2 WEEK 5 TOPIC: LINEAR PROGRAMMING OBJECTIVE AND SHORT ANSWER QUESTIONS CIS QA LEVEL 2 WEEK 5 TOPIC: LINEAR PROGRAMMING OBJECTIVE AND SHORT ANSWER QUESTIONS 1. In the graphical method of solving a Linear Programming problem, the feasible region is the region containing A.

More information

Understanding the meaning of Learning Curve. Understanding the meaning of Learning Curve Effect. Feature and Limitations of Learning Curve Theory.

Understanding the meaning of Learning Curve. Understanding the meaning of Learning Curve Effect. Feature and Limitations of Learning Curve Theory. C H A P T E R 15 Learning Curve Learning Objectives: Understanding the meaning of Learning Curve. Understanding the meaning of Learning Curve Effect. Feature and Limitations of Learning Curve Theory. Past

More information

Gurukripa s Guideline Answers for May 2011 CA Final Examination

Gurukripa s Guideline Answers for May 2011 CA Final Examination Gurukripa s Guideline Answers for May 2011 CA Final Examination PAPER 5 ADVANCED MANAGEMENT ACCOUNTING Q.No. 1 is Compulsory. Answer any Five Questions from the remaining Six Questions Question 1 (a):

More information

SYLLABUS Class: - B.B.A. IV Semester. Subject: - Operations Research

SYLLABUS Class: - B.B.A. IV Semester. Subject: - Operations Research SYLLABUS Class: - B.B.A. IV Semester Subject: - Operations Research UNIT I Definition of operations research, models of operations research, scientific methodology of operations research, scope of operations

More information

The Transportation and Assignment Problems. Hillier &Lieberman Chapter 8

The Transportation and Assignment Problems. Hillier &Lieberman Chapter 8 The Transportation and Assignment Problems Hillier &Lieberman Chapter 8 The Transportation and Assignment Problems Two important special types of linear programming problems The transportation problem

More information

B.E. Sixth Semester (Mechanical Engineering) (C.B.S.) Operations Research

B.E. Sixth Semester (Mechanical Engineering) (C.B.S.) Operations Research B.E. Sixth Semester (Mechanical Engineering) (C.B.S.) Operations Research P. Pages : 4 NKT/KS/1/39 Time : Three Hours *0561* Max. Marks : 80 Notes : 1. All questions carry marks as indicated.. Solve Question

More information

Answer to MTP_Final_Syllabus 2016_Jun2017_Set 2 Paper 15 Strategic Cost Management and Decision Making

Answer to MTP_Final_Syllabus 2016_Jun2017_Set 2 Paper 15 Strategic Cost Management and Decision Making Paper 15 Strategic Cost Management and Decision Making Page 1 Paper 15 - Strategic Cost Management and Decision Making Time Allowed: 3 hours Full Marks: 100 Section A 1. Answer the following and each question

More information

The Efficient Allocation of Individuals to Positions

The Efficient Allocation of Individuals to Positions The Efficient Allocation of Individuals to Positions by Aanund Hylland and Richard Zeckhauser Presented by Debreu Team: Justina Adamanti, Liz Malm, Yuqing Hu, Krish Ray Hylland and Zeckhauser consider

More information

QUESTION BANK BCA V SEMESTER BCA-505 OPTIMAZATION TECHNIQUES

QUESTION BANK BCA V SEMESTER BCA-505 OPTIMAZATION TECHNIQUES QUESTION BANK BCA V SEMESTER BCA-0 OPTIMAZATION TECHNIQUES ------ UNIT I ------. A firm manufactures products A, B and C. The profits are Rs., Rs. and Rs. resp. The firm has machines and below is the required

More information

Code No: RR Set No. 1

Code No: RR Set No. 1 Code No: RR410301 Set No. 1 IV B.Tech I Semester Regular Examinations, November 2007 OPERATIONS RESEARCH ( Common to Mechanical Engineering, Mechatronics and Production Engineering) Time: 3 hours Max Marks:

More information

MARTIN de TOURS SCHOOL OF MANAGEMENT DEPARTMENT OF MARKETING LESSON PLAN MKT4829 MARKETING DECISION MAKING

MARTIN de TOURS SCHOOL OF MANAGEMENT DEPARTMENT OF MARKETING LESSON PLAN MKT4829 MARKETING DECISION MAKING MARTIN de TOURS SCHOOL OF MANAGEMENT DEPARTMENT OF MARKETING LESSON PLAN MKT4829 MARKETING DECISION MAKING MKT4829 MARKETING DECISION MAKING MKT4829: Marketing Decision Making COURSE DESCRIPTION This is

More information

Solving Transportation Logistics Problems Using Advanced Evolutionary Optimization

Solving Transportation Logistics Problems Using Advanced Evolutionary Optimization Solving Transportation Logistics Problems Using Advanced Evolutionary Optimization Transportation logistics problems and many analogous problems are usually too complicated and difficult for standard Linear

More information

MGSC 1205 Quantitative Methods I

MGSC 1205 Quantitative Methods I MGSC 1205 Quantitative Methods I Class Seven Sensitivity Analysis Ammar Sarhan 1 How can we handle changes? We have solved LP problems under deterministic assumptions. find an optimum solution given certain

More information

Math 111 Group Activity: Change and Average Change. 1. Below is a graph of the value vs. time for one share of stock for a company named Banana Patch.

Math 111 Group Activity: Change and Average Change. 1. Below is a graph of the value vs. time for one share of stock for a company named Banana Patch. Name: Section: Math 111 Group Activity: Change and Average Change 1. Below is a graph of the value vs. time for one share of stock for a company named Banana Patch. 40 35 30 25 value 20 (in dollars) 15

More information

International Journal of Advance Engineering and Research Development

International Journal of Advance Engineering and Research Development Scientific Journal of Impact Factor (SJIF): 4.72 International Journal of Advance Engineering and Research Development Volume 4, Issue 4, April -2017 Cost Saving in Transportation of Various Construction

More information

Techniques of Operations Research

Techniques of Operations Research Techniques of Operations Research C HAPTER 2 2.1 INTRODUCTION The term, Operations Research was first coined in 1940 by McClosky and Trefthen in a small town called Bowdsey of the United Kingdom. This

More information

VAM - MODI Mathematical Modelling Method for Minimizing Cost of Transporting Perishables from Markets to Cafeterias in Covenant University

VAM - MODI Mathematical Modelling Method for Minimizing Cost of Transporting Perishables from Markets to Cafeterias in Covenant University Washington C, USA, Septe IEOM Society Internationalmber 7-9, 18 VAM - MOI Mathematical Modelling Method for Minimizing Cost of Transporting Perishables from Markets to Cafeterias in Covenant University

More information

CHAPTER 5 SUPPLIER SELECTION BY LEXICOGRAPHIC METHOD USING INTEGER LINEAR PROGRAMMING

CHAPTER 5 SUPPLIER SELECTION BY LEXICOGRAPHIC METHOD USING INTEGER LINEAR PROGRAMMING 93 CHAPTER 5 SUPPLIER SELECTION BY LEXICOGRAPHIC METHOD USING INTEGER LINEAR PROGRAMMING 5.1 INTRODUCTION The SCMS model is solved using Lexicographic method by using LINGO software. Here the objectives

More information

A New Technique for Solving Transportation Problems by Using Decomposition-Based Pricing and its Implementation in Real Life

A New Technique for Solving Transportation Problems by Using Decomposition-Based Pricing and its Implementation in Real Life Dhaka Univ. J. Sci. 64(1): 45-50, 2016 (January) A New Technique for Solving Transportation Problems by Using Decomposition-Based Pricing and its Implementation in Real Life Sajal Chakroborty and M. Babul

More information

Mixed Constraint Fuzzy Transshipment Problem

Mixed Constraint Fuzzy Transshipment Problem Applied Mathematical Sciences, Vol. 6, 2012, no. 48, 2385-2394 Mixed Constraint Fuzzy Transshipment Problem A. Nagoor Gani PG & Research Department of Mathematics Jamal Mohamed College (Autonomous) Tiruchirappalli-620020,

More information

MBF1413 Quantitative Methods

MBF1413 Quantitative Methods MBF1413 Quantitative Methods Prepared by Dr Khairul Anuar 9: Introduction to Linear Programming www.notes638.wordpress.com Content 1. Introduction 2. A Simple Maximization Problem 2 1. Introduction Linear

More information

On the Optimization of Transportation Problem

On the Optimization of Transportation Problem British Journal of Mathematics & Computer Science 13(4): 1-11, 2016, Article no.bjmcs.17279 ISSN: 2231-0851 SCIENCEDOMAIN international www.sciencedomain.org On the Optimization of Transportation Problem

More information

Transshipment. Chapter 493. Introduction. Data Structure. Example Model

Transshipment. Chapter 493. Introduction. Data Structure. Example Model Chapter 493 Introduction The transshipment model is a special case of the minimum cost capacitated flow model in which there are no capacities or minimums on the arc flows. The transshipment model is similar

More information

LECTURE 41: SCHEDULING

LECTURE 41: SCHEDULING LECTURE 41: SCHEDULING Learning Objectives After completing the introductory discussion on Scheduling, the students would be able to understand what scheduling is and how important it is to high volume

More information

PRODUCTION PLANNING MODULE

PRODUCTION PLANNING MODULE Anar Pharmaceuticals Limited ERP Project In Sales & Distribution Module I had recommended: PRODUCTION PLANNING MODULE 1. Monthly Corporate Sales Budget Process (Refer Sales Budget - page 32) & 2. Macro

More information

As Per Revised Syllabus of Leading Universities in India Including Dr. APJ Abdul Kalam Technological University, Kerala. V. Anandaraj, M.E., (Ph.D.

As Per Revised Syllabus of Leading Universities in India Including Dr. APJ Abdul Kalam Technological University, Kerala. V. Anandaraj, M.E., (Ph.D. Supply Chain & Logistics Management For B.E /B.Tech Mechanical Engineering Students As Per Revised Syllabus of Leading Universities in India Including Dr. APJ Abdul Kalam Technological University, Kerala

More information

Unit 6: Non-Competitive Markets

Unit 6: Non-Competitive Markets Unit 6: Non-Competitive Markets Name: Date: / / Simple Monopoly in the Commodity Market A market structure in which there is a single seller is called monopoly. The conditions hidden in this single line

More information

Discrete and dynamic versus continuous and static loading policy for a multi-compartment vehicle

Discrete and dynamic versus continuous and static loading policy for a multi-compartment vehicle European Journal of Operational Research 174 (2006) 1329 1337 Short Communication Discrete and dynamic versus continuous and static loading policy for a multi-compartment vehicle Yossi Bukchin a, *, Subhash

More information

Modeling of competition in revenue management Petr Fiala 1

Modeling of competition in revenue management Petr Fiala 1 Modeling of competition in revenue management Petr Fiala 1 Abstract. Revenue management (RM) is the art and science of predicting consumer behavior and optimizing price and product availability to maximize

More information

INDIAN INSTITUTE OF MATERIALS MANAGEMENT Post Graduate Diploma in Materials Management PAPER 18 C OPERATIONS RESEARCH.

INDIAN INSTITUTE OF MATERIALS MANAGEMENT Post Graduate Diploma in Materials Management PAPER 18 C OPERATIONS RESEARCH. INDIAN INSTITUTE OF MATERIALS MANAGEMENT Post Graduate Diploma in Materials Management PAPER 18 C OPERATIONS RESEARCH. Dec 2014 DATE: 20.12.2014 Max. Marks: 100 TIME: 2.00 p.m to 5.00 p.m. Duration: 03

More information

PAPER 5 ADVANCED MANAGEMENT ACCOUNTING MAY 2013

PAPER 5 ADVANCED MANAGEMENT ACCOUNTING MAY 2013 Q.1 PAPER 5 ADVANCED MANAGEMENT ACCOUNTING MAY 2013 (a) A process industry unit manufactures three joint products: A, B and C. C has no realisable value unless it undergoes further processing after the

More information

Basic Linear Programming Concepts. Lecture 2 (3/29/2017)

Basic Linear Programming Concepts. Lecture 2 (3/29/2017) Basic Linear Programming Concepts Lecture 2 (3/29/2017) Definition Linear Programming (LP) is a mathematical method to allocate scarce resources to competing activities in an optimal manner when the problem

More information

Type of Inventory. OVERVIEW In case of manufacturing concerns. Stores and Spares. Formulae for Determining Cost of Inventory

Type of Inventory. OVERVIEW In case of manufacturing concerns. Stores and Spares. Formulae for Determining Cost of Inventory CHAPTER 4 INVENTORIES LEARNING OUTCOMES After studying this chapter, you will be able to: Understand the meaning of term 'Inventory'. Learn the technique of Specific identification method, FIFO, Average

More information

THIS PAPER MUST NOT BE OPENED UNTIL PERMISSION HAS BEEN GRANTED BY THE INVIGILATOR

THIS PAPER MUST NOT BE OPENED UNTIL PERMISSION HAS BEEN GRANTED BY THE INVIGILATOR UNIVERSITY OF SWAZILAND FACULTY OF COMMERCE DEPARMENT OF BUSINESS ADMINISTRATION SUPPLEMENTARY EXAMINATION PAPER; F/T STUDENTS JULY 2014 TITLE OF PAPER MANAGEMENT SCIENCE 11 COURSE CODE BA310 TIME ALLOCATED

More information

Optimizing an Advertising Campaign

Optimizing an Advertising Campaign Optimizing an Advertising Campaign Math 1010 Intermediate Algebra Group Project Background Information: Linear Programming is a technique used for optimization of a real-world situation. Examples of optimization

More information

CHAPTER 12 LINEAR PROGRAMMING POINTS TO REMEMBER

CHAPTER 12 LINEAR PROGRAMMING POINTS TO REMEMBER For more important questions visit : www.4ono.com CHAPTER 12 LINEAR PROGRAMMING POINTS TO REMEMBER Linear programming is the process used to obtain minimum or maximum value of the linear objective function

More information

The Ascending Bid Auction Experiment:

The Ascending Bid Auction Experiment: The Ascending Bid Auction Experiment: This is an experiment in the economics of decision making. The instructions are simple, and if you follow them carefully and make good decisions, you may earn a considerable

More information

MTP_Paper 9_Syllabus 2016_June 2018_Set 1

MTP_Paper 9_Syllabus 2016_June 2018_Set 1 Paper - 9 : OPERATIONS MANAGEMENT & STRATEGIC MANAGEMENT Academics Department, The Institute of Cost Accounts of India (Statutory Body under an Act of Parliament) Page 1 Paper 9 : Operation Management

More information

MARGINAL COSTING CATEGORY A CHAPTER HIGH MARKS COVERAGE IN EXAM

MARGINAL COSTING CATEGORY A CHAPTER HIGH MARKS COVERAGE IN EXAM 1 MARGINAL COSTING CATEGORY A CHAPTER HIGH MARKS COVERAGE IN EXAM Question 1 Arnav Ltd. manufacture and sales its product R-9. The following figures have been collected from cost records of last year for

More information

UNIT 7 TRANSPORTATION PROBLEM

UNIT 7 TRANSPORTATION PROBLEM UNIT 7 TRNSPORTTION PROLEM Structure 7.1 Introduction Objectives 2 asic Feasible Solution of a Transportation Problem 7. Modified Distribution (MODI) Method 7.4 Stepping Stone Method 7.5 Unbalanced Transportation

More information

Cork Regional Technical College

Cork Regional Technical College Cork Regional Technical College Bachelor of Engineering in Chemical and Process Engineering - Stage 4 Summer 1996 CE 4.8 - DECISION ANALYSIS AND OPERATIONS RESEARCH (Time: 3 Hours) Answer FOUR Questions.

More information

A Minimum Spanning Tree Approach of Solving a Transportation Problem

A Minimum Spanning Tree Approach of Solving a Transportation Problem International Journal of Mathematics and Statistics Invention (IJMSI) E-ISSN: 2321 4767 P-ISSN: 2321-4759 Volume 5 Issue 3 March. 2017 PP-09-18 A Minimum Spanning Tree Approach of Solving a Transportation

More information

Contents Introduction to Logistics... 6

Contents Introduction to Logistics... 6 CONTENTS Contents... 3 1. Introduction to Logistics... 6 1.1 Interfaces between Logistics Manufacturing....7 1.2 Logistics: Manufacturing issues in Customer Service...9 I.3 Production scheduling...10 1.4

More information

A New Simple Method of Finding an Optimal Solution for the Transportation Problem

A New Simple Method of Finding an Optimal Solution for the Transportation Problem www.emr.net ISSN (ONLINE): 5-758, ISSN (PRINT): 9-9 Volume-, Issue-, November-December 1 International Journal of Engineering and Management Research Page Number: 19- A New Simple Method of Finding an

More information

A Study on North East Corner Method in Transportation Problem of Operations Research and using of Object Oriented Programming Model

A Study on North East Corner Method in Transportation Problem of Operations Research and using of Object Oriented Programming Model Intern. J. Fuzzy Mathematical Archive Vol. 14, No. 1, 2017, 35-40 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 11 December 2017 www.researchmathsci.org DOI: http://dx.doi.org/10.22457/ijfma.v14n1a5

More information

Business case studies. (Logistic and production models)

Business case studies. (Logistic and production models) Business case studies (Logistic and production models) 1. Logistics planning in the food industry The logistic system of the food manufacturing company consists of a network whose nodes represent suppliers

More information

Collaborative Logistics

Collaborative Logistics Collaborative Logistics Martin Savelsbergh Ozlem Ergun Gultekin Kuyzu The Logistics Institute Georgia Institute of Technology 35th Annual Conference of the Italian Operations Research Society Lecce, September

More information

By J. Stephen Pope. How To Make A Fortune Drop Shipping

By J. Stephen Pope. How To Make A Fortune Drop Shipping How To Make A Fortune Drop Shipping By J. Stephen Pope DISCLAIMER AND TERMS OF USE AGREEMENT The author and publisher of this ebook and the accompanying materials have used their best efforts in preparing

More information

Assignment of FIN-3104: Operations Research

Assignment of FIN-3104: Operations Research Assignment of FIN-3104: Operations Research A Report On Maximizing the profits, Minimizing work hour & the transportation cost for BEXTEX using LP Submitted to Suborna Barua Course Instructor/ Lecturer,

More information

By J. Stephen Pope. How To Make A Fortune Drop Shipping

By J. Stephen Pope. How To Make A Fortune Drop Shipping How To Make A Fortune Drop Shipping By J. Stephen Pope DISCLAIMER AND TERMS OF USE AGREEMENT The author and publisher of this ebook and the accompanying materials have used their best efforts in preparing

More information

Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture - 24 Sequencing and Scheduling - Assumptions, Objectives and Shop

More information

The Sealed Bid Auction Experiment:

The Sealed Bid Auction Experiment: The Sealed Bid Auction Experiment: This is an experiment in the economics of decision making. The instructions are simple, and if you follow them carefully and make good decisions, you may earn a considerable

More information

MGSC 1205 Quantitative Methods I

MGSC 1205 Quantitative Methods I MGSC 1205 Quantitative Methods I Slides Five Multi-period application & Sensitivity Analysis Ammar Sarhan Multi-period Applications: Production Scheduling Most challenging application of LP is modeling

More information

Topics in Supply Chain Management. Session 3. Fouad El Ouardighi BAR-ILAN UNIVERSITY. Department of Operations Management

Topics in Supply Chain Management. Session 3. Fouad El Ouardighi BAR-ILAN UNIVERSITY. Department of Operations Management BAR-ILAN UNIVERSITY Department of Operations Management Topics in Supply Chain Management Session Fouad El Ouardighi «Cette photocopie (d articles ou de livre), fournie dans le cadre d un accord avec le

More information

6) Items purchased for resale with a right of return must be presented separately from other inventories.

6) Items purchased for resale with a right of return must be presented separately from other inventories. Chapter 8 Cost-based Inventories and Cost of Sales 1) Inventories are assets consisting of goods owned by the business and held for future sale or for use in the manufacture of goods for sale. Answer:

More information

Lecture - 44 Supply Chain

Lecture - 44 Supply Chain Economics, Management and Entrepreneurship Prof. Pratap. K. J. Mohapatra Department of Industrial Engineering and Management Indian Institute of Technology Kharagpur Lecture - 44 Supply Chain Good morning.

More information

Supply Chain Location Decisions Chapter 11

Supply Chain Location Decisions Chapter 11 Supply Chain Location Decisions Chapter 11 11-01 What is a Facility Location? Facility Location The process of determining geographic sites for a firm s operations. Distribution center (DC) A warehouse

More information

Cartonization: The $avings Can Be Huge

Cartonization: The $avings Can Be Huge Cartonization: The $avings Can Be Huge www.invata.com Cartonization: The $avings Can Be Huge Overview One can hardly pick up a trade journal these days that is focused on warehousing, distribution, logistics

More information

Sections 4.5 and 4.6 Notes

Sections 4.5 and 4.6 Notes Sections 4.5 and 4.6 Notes Transportation Problem: Delivering Bread A supermarket chain gets bread deliveries from a bakery chain that does its baking in different places. Each supermarket store needs

More information

- 1 - Direct Material (Rs.) Material Cost Per Unit Units Produced

- 1 - Direct Material (Rs.) Material Cost Per Unit Units Produced - 1 - COST BEHAVIOR THE NATURE OF COSTS: Before one can begin to understand how a business is going to perform over time and with shifts in volume, it is imperative to first consider the cost structure

More information

Notes on Intertemporal Consumption Choice

Notes on Intertemporal Consumption Choice Paul A Johnson Economics 304 Advanced Topics in Macroeconomics Notes on Intertemporal Consumption Choice A: The Two-Period Model Consider an individual who faces the problem of allocating their available

More information

The Pennsylvania State University. The Graduate School. College of Engineering. A BIDDING DECISION MODEL FOR SMEs. A Thesis in. Industrial Engineering

The Pennsylvania State University. The Graduate School. College of Engineering. A BIDDING DECISION MODEL FOR SMEs. A Thesis in. Industrial Engineering The Pennsylvania State University The Graduate School College of Engineering A BIDDING DECISION MODEL FOR SMEs A Thesis in Industrial Engineering by Chen-Hsueh Lin 2016 Chen-Hsueh Lin Submitted in Partial

More information

Test Series: October, 2014

Test Series: October, 2014 MOCK TEST PAPER 2 FINAL COURSE: GROUP II PAPER 5: ADVANCED MANAGEMENT ACCOUNTING Question No. 1 is compulsory Answer any five questions from the remaining six questions Test Series: October, 2014 Time

More information

A Production Problem

A Production Problem Session #2 Page 1 A Production Problem Weekly supply of raw materials: Large Bricks Small Bricks Products: Table Profit = $20/Table Chair Profit = $15/Chair Session #2 Page 2 Linear Programming Linear

More information

Linear programming A large number of decision pr

Linear programming A large number of decision pr Linear programming A large number of decision problems faced by a business manager involve allocation of limited resources to different activities. Linear programming has been successfully applied to a

More information