Download presentation

Presentation is loading. Please wait.

Published byHailee Blade Modified over 2 years ago

1
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Chapter 6: Transportation, Assignment, and Transshipment Problems A network model is one which can be represented by a set of nodes, a set of arcs, and functions (e.g. costs, supplies, demands, etc.) associated with the arcs and/or nodes. Examples include transportation, assignment, transshipment as well as shortest-route, maximal flow problems, minimal spanning tree and PERT/CPM problems. All network problems can be formulated as linear programs. However, there are many computer packages that contain separate computer codes for these problems which take advantage of their network structure. If the right-hand side of the linear programming formulations are all integers, then optimal solution of the decision variables will also be integers.

2
2 2 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Transportation Problem The transportation problem seeks to minimize the total shipping costs of transporting goods from m origins (each with a supply s i ) to n destinations (each with a demand d j ), when the unit shipping cost from an origin, i, to a destination, j, is c ij. The network representation for a transportation problem with two sources and three destinations is given on the next slide.

3
3 3 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Transportation Problem Network Representation 2 2 c 11 c 12 c 13 c 21 c 22 c 23 d1d1d1d1 d2d2d2d2 d3d3d3d3 s1s1s1s1 s2s2 m Sources n Destinations 3 3 2 2 1 1 1 1

4
4 4 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Transportation Problem Linear Programming Formulation Using the notation: Using the notation: x ij = number of units shipped from x ij = number of units shipped from origin i to destination j origin i to destination j c ij = cost per unit of shipping from c ij = cost per unit of shipping from origin i to destination j origin i to destination j s i = supply or capacity in units at origin i s i = supply or capacity in units at origin i d j = demand in units at destination j d j = demand in units at destination j continued

5
5 5 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Transportation Problem Linear Programming Formulation (continued) x ij > 0 for all i and j

6
6 6 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Example: Transportation Problem The Navy has depots in Albany, BenSalem, and Winchester. Each of these three depots has 3,000 pounds of materials which the Navy wishes to ship to three installations, namely, San Diego, Norfolk, and Pensacola. These installations require 4,000, 2,500, and 2,500 pounds, respectively. The shipping costs per pound for are shown on the next slide. Formulate and solve a linear program to determine the shipping arrangements that will minimize the total shipping cost.

7
7 7 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Destination Destination Source San Diego Norfolk Pensacola Albany $12 $ 6 $ 5 BenSalem 20 11 9 Winchester 30 26 28 Example: Transportation Problem (Continued)

8
8 8 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Transportation Problem: Network Representation 22 33 11 22 33 11 c 11 c 12 c 13 c 21 c 22 c 23 c 31 c 32 c 33 SourceDestination Albany3000 BenSalem3000 Winchester3000 San Diego 4000 Norfolk2500 Pensacola2500

9
9 9 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Define the Decision Variables We want to determine the pounds of material, x ij, to be shipped by mode i to destination j. The following table summarizes the decision variables: San Diego Norfolk Pensacola San Diego Norfolk Pensacola Albany x 11 x 12 x 13 Albany x 11 x 12 x 13 BenSalem x 21 x 22 x 23 BenSalem x 21 x 22 x 23 Winchester x 31 x 32 x 33 Winchester x 31 x 32 x 33 Example: Transportation Problem (Continued)

10
10 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Define the Objective Function Minimize the total shipping cost. Minimize the total shipping cost. Min: (shipping cost per pound for each mode per destination pairing) x (number of pounds shipped by mode per destination pairing). Min: (shipping cost per pound for each mode per destination pairing) x (number of pounds shipped by mode per destination pairing). Min: 12 x 11 + 6 x 12 + 5 x 13 + 20 x 21 + 11 x 22 + 9 x 23 Min: 12 x 11 + 6 x 12 + 5 x 13 + 20 x 21 + 11 x 22 + 9 x 23 + 30 x 31 + 26 x 32 + 28 x 33 + 30 x 31 + 26 x 32 + 28 x 33 Example: Transportation Problem (Continued)

11
11 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Define the Constraints Source availability: Source availability: (1) x 11 + x 12 + x 13 = 3000 (1) x 11 + x 12 + x 13 = 3000 (2) x 21 + x 22 + x 23 = 3000 (2) x 21 + x 22 + x 23 = 3000 (3) x 31 + x 32 + x 33 = 3000 (3) x 31 + x 32 + x 33 = 3000 Destination material requirements: Destination material requirements: (4) x 11 + x 21 + x 31 = 4000 (4) x 11 + x 21 + x 31 = 4000 (5) x 12 + x 22 + x 32 = 2500 (5) x 12 + x 22 + x 32 = 2500 (6) x 13 + x 23 + x 33 = 2500 (6) x 13 + x 23 + x 33 = 2500 Non-negativity of variables: Non-negativity of variables: x ij > 0, i = 1, 2, 3 and j = 1, 2, 3 x ij > 0, i = 1, 2, 3 and j = 1, 2, 3 Transportation Problem: Example #2

12
12 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Computer Output OBJECTIVE FUNCTION VALUE = 142000.000 OBJECTIVE FUNCTION VALUE = 142000.000 Variable Value Reduced Cost Variable Value Reduced Cost x 11 1000.000 0.000 x 11 1000.000 0.000 x 12 2000.000 0.000 x 12 2000.000 0.000 x 13 0.000 1.000 x 13 0.000 1.000 x 21 0.000 3.000 x 21 0.000 3.000 x 22 500.000 0.000 x 22 500.000 0.000 x 23 2500.000 0.000 x 23 2500.000 0.000 x 31 3000.000 0.000 x 31 3000.000 0.000 x 32 0.000 2.000 x 32 0.000 2.000 x 33 0.000 6.000 x 33 0.000 6.000 Example: Transportation Problem (Continued)

13
13 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Solution Summary San Diego will receive 1000 lbs. from Albany San Diego will receive 1000 lbs. from Albany and 3000 lbs. from Winchester. Norfolk will receive 2000 lbs. from Albany Norfolk will receive 2000 lbs. from Albany and 500 lbs. from BenSalem. and 500 lbs. from BenSalem. Pensacola will receive 2500 lbs. from BenSalem. Pensacola will receive 2500 lbs. from BenSalem. The total shipping cost will be $142,000. The total shipping cost will be $142,000. Transportation Problem: Example #2

14
14 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. LP Formulation Special Cases Total supply exceeds total demand: Total supply exceeds total demand: Total demand exceeds total supply: Total demand exceeds total supply: Add a dummy origin with supply equal to the shortage amount. Assign a zero shipping cost per unit. The amount “shipped” from the dummy origin (in the solution) will not actually be shipped. Assign a zero shipping cost per unit Maximum route capacity from i to j : Maximum route capacity from i to j : x ij < L i x ij < L i Remove the corresponding decision variable. Remove the corresponding decision variable. Transportation Problem No modification of LP formulation is necessary.

15
15 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. LP Formulation Special Cases (continued) The objective is maximizing profit or revenue: The objective is maximizing profit or revenue: Minimum shipping guarantee from i to j : Minimum shipping guarantee from i to j : x ij > L ij x ij > L ij Maximum route capacity from i to j : Maximum route capacity from i to j : x ij < L ij x ij < L ij Unacceptable route: Unacceptable route: Remove the corresponding decision variable. Remove the corresponding decision variable. Transportation Problem Solve as a maximization problem.

16
16 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Assignment Problem An assignment problem seeks to minimize the total cost assignment of m workers to m jobs, given that the cost of worker i performing job j is c ij. It assumes all workers are assigned and each job is performed. An assignment problem is a special case of a transportation problem in which all supplies and all demands are equal to 1; hence assignment problems may be solved as linear programs. The network representation of an assignment problem with three workers and three jobs is shown on the next slide.

17
17 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Assignment Problem Network Representation 22 33 11 22 33 11 c 11 c 12 c 13 c 21 c 22 c 23 c 31 c 32 c 33 AgentsTasks

18
18 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Linear Programming Formulation Using the notation: Using the notation: x ij = 1 if agent i is assigned to task j x ij = 1 if agent i is assigned to task j 0 otherwise 0 otherwise c ij = cost of assigning agent i to task j c ij = cost of assigning agent i to task j Assignment Problem continued

19
19 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Linear Programming Formulation (continued) Assignment Problem x ij > 0 for all i and j

20
20 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. An electrical contractor pays his subcontractors a fixed fee plus mileage for work performed. On a given day the contractor is faced with three electrical jobs associated with various projects. Given below are the distances between the subcontractors and the projects. Projects Projects Subcontractor A B C Westside 50 36 16 Federated 28 30 18 Federated 28 30 18 Goliath 35 32 20 Universal 25 25 14 Universal 25 25 14 How should the contractors be assigned so that total mileage is minimized? Example: Assignment Problem

21
21 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Network Representation 50 36 16 28 30 18 35 32 20 25 25 14 West. CC BB AA Univ.Univ. Gol.Gol. Fed. Fed. Projects Subcontractors Example: Assignment Problem

22
22 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Linear Programming Formulation Min 50 x 11 +36 x 12 +16 x 13 +28 x 21 +30 x 22 +18 x 23 Min 50 x 11 +36 x 12 +16 x 13 +28 x 21 +30 x 22 +18 x 23 +35 x 31 +32 x 32 +20 x 33 +25 x 41 +25 x 42 +14 x 43 +35 x 31 +32 x 32 +20 x 33 +25 x 41 +25 x 42 +14 x 43 s.t. x 11 + x 12 + x 13 < 1 s.t. x 11 + x 12 + x 13 < 1 x 21 + x 22 + x 23 < 1 x 21 + x 22 + x 23 < 1 x 31 + x 32 + x 33 < 1 x 31 + x 32 + x 33 < 1 x 41 + x 42 + x 43 < 1 x 41 + x 42 + x 43 < 1 x 11 + x 21 + x 31 + x 41 = 1 x 11 + x 21 + x 31 + x 41 = 1 x 12 + x 22 + x 32 + x 42 = 1 x 12 + x 22 + x 32 + x 42 = 1 x 13 + x 23 + x 33 + x 43 = 1 x 13 + x 23 + x 33 + x 43 = 1 x ij = 0 or 1 for all i and j x ij = 0 or 1 for all i and j Agents Tasks Assignment Problem: Example

23
23 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. The optimal assignment is: Subcontractor Project Distance Subcontractor Project Distance Westside C 16 Westside C 16 Federated A 28 Federated A 28 Goliath (unassigned) Universal B 25 Total Distance = 69 miles Total Distance = 69 miles Assignment Problem: Example

24
24 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. LP Formulation Special Cases Number of agents exceeds the number of tasks: Number of agents exceeds the number of tasks: Number of tasks exceeds the number of agents: Number of tasks exceeds the number of agents: Add enough dummy agents to equalize the Add enough dummy agents to equalize the number of agents and the number of tasks. number of agents and the number of tasks. The objective function coefficients for these The objective function coefficients for these new variable would be zero. new variable would be zero. Assignment Problem Extra agents simply remain unassigned.

25
25 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Assignment Problem LP Formulation Special Cases (continued) The assignment alternatives are evaluated in terms of revenue or profit: The assignment alternatives are evaluated in terms of revenue or profit: Solve as a maximization problem. Solve as a maximization problem. An assignment is unacceptable: An assignment is unacceptable: Remove the corresponding decision variable. Remove the corresponding decision variable. An agent is permitted to work t tasks: An agent is permitted to work t tasks:

26
26 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Transshipment Problem Transshipment problems are transportation problems in which a shipment may move through intermediate nodes (transshipment nodes)before reaching a particular destination node. Transshipment problems can be converted to larger transportation problems and solved by a special transportation program. Transshipment problems can also be solved by general purpose linear programming codes. The network representation for a transshipment problem with two sources, three intermediate nodes, and two destinations is shown on the next slide.

27
27 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Transshipment Problem Network Representation 2 2 33 44 55 66 7 7 1 1 c 13 c 14 c 23 c 24 c 25 c 15 s1s1s1s1 c 36 c 37 c 46 c 47 c 56 c 57 d1d1d1d1 d2d2d2d2 Intermediate Nodes Sources Destinations s2s2s2s2 Demand Supply

28
28 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Transshipment Problem Linear Programming Formulation Using the notation: Using the notation: x ij = number of units shipped from node i to node j x ij = number of units shipped from node i to node j c ij = cost per unit of shipping from node i to node j c ij = cost per unit of shipping from node i to node j s i = supply at origin node i s i = supply at origin node i d j = demand at destination node j d j = demand at destination node j continued

29
29 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Transshipment Problem x ij > 0 for all i and j Linear Programming Formulation (continued) continued

30
30 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Transshipment Problem LP Formulation Special Cases Total supply not equal to total demand Total supply not equal to total demand Maximization objective function Maximization objective function Route capacities or route minimums Route capacities or route minimums Unacceptable routes Unacceptable routes The LP model modifications required here are identical to those required for the special cases in the transportation problem.

31
31 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. The Northside and Southside facilities of Zeron Industries supply three firms (Zrox, Hewes, Rockrite) with customized shelving for its offices. They both order shelving from the same two manufacturers, Arnold Manufacturers and Supershelf, Inc. Currently weekly demands by the users are 50 for Zrox, 60 for Hewes, and 40 for Rockrite. Both Arnold and Supershelf can supply at most 75 units to its customers. Additional data is shown on the next slide. Transshipment Problem Example

32
32 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Because of long standing contracts based on past orders, unit costs from the manufacturers to the suppliers are: Zeron N Zeron S Zeron N Zeron S Arnold 5 8 Arnold 5 8 Supershelf 7 4 Supershelf 7 4 The costs to install the shelving at the various locations are: Zrox Hewes Rockrite Zrox Hewes Rockrite Thomas 1 5 8 Thomas 1 5 8 Washburn 3 4 4 Washburn 3 4 4 Transshipment Problem Example

33
33 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Network Representation ARNOLD WASH BURN ZROX HEWES 75 75 50 60 40 5 8 7 4 1 5 8 3 4 4 Arnold SuperShelf Hewes Zrox ZeronN ZeronS Rock-Rite Transshipment Problem Example

34
34 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Linear Programming Formulation Decision Variables Defined Decision Variables Defined x ij = amount shipped from manufacturer i to supplier j x jk = amount shipped from supplier j to customer k x jk = amount shipped from supplier j to customer k where i = 1 (Arnold), 2 (Supershelf) where i = 1 (Arnold), 2 (Supershelf) j = 3 (Zeron N), 4 (Zeron S) j = 3 (Zeron N), 4 (Zeron S) k = 5 (Zrox), 6 (Hewes), 7 (Rockrite) k = 5 (Zrox), 6 (Hewes), 7 (Rockrite) Objective Function Defined Objective Function Defined Minimize Overall Shipping Costs: Min 5 x 13 + 8 x 14 + 7 x 23 + 4 x 24 + 1 x 35 + 5 x 36 + 8 x 37 Min 5 x 13 + 8 x 14 + 7 x 23 + 4 x 24 + 1 x 35 + 5 x 36 + 8 x 37 + 3 x 45 + 4 x 46 + 4 x 47 + 3 x 45 + 4 x 46 + 4 x 47 Transshipment Problem: Example

35
35 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Constraints Defined Amount Out of Arnold: x 13 + x 14 < 75 Amount Out of Supershelf: x 23 + x 24 < 75 Amount Through Zeron N: x 13 + x 23 - x 35 - x 36 - x 37 = 0 Amount Through Zeron S: x 14 + x 24 - x 45 - x 46 - x 47 = 0 Amount Into Zrox: x 35 + x 45 = 50 Amount Into Hewes: x 36 + x 46 = 60 Amount Into Rockrite: x 37 + x 47 = 40 Non-negativity of Variables: x ij > 0, for all i and j. Transshipment Problem: Example

36
36 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Computer Output Objective Function Value = 1150.000 Objective Function Value = 1150.000 Variable Value Reduced Costs Variable Value Reduced Costs X13 75.000 0.000 X13 75.000 0.000 X14 0.000 2.000 X14 0.000 2.000 X23 0.000 4.000 X23 0.000 4.000 X24 75.000 0.000 X24 75.000 0.000 X35 50.000 0.000 X35 50.000 0.000 X36 25.000 0.000 X36 25.000 0.000 X37 0.000 3.000 X37 0.000 3.000 X45 0.000 3.000 X45 0.000 3.000 X46 35.000 0.000 X46 35.000 0.000 X47 40.000 0.000 X47 40.000 0.000 Transshipment Problem: Example

37
37 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Solution ARNOLD WASH BURN ZROX HEWES 75 75 50 60 40 5 8 7 4 1 5 8 3 4 4 Arnold SuperShelf Hewes Zrox ZeronN ZeronS Rock-Rite 75 75 50 25 35 40 Transshipment Problem: Example

38
38 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Computer Output (continued) Constraint Slack/Surplus Dual Values Constraint Slack/Surplus Dual Values 1 0.000 0.000 1 0.000 0.000 2 0.000 2.000 2 0.000 2.000 3 0.000 -5.000 3 0.000 -5.000 4 0.000 -6.000 4 0.000 -6.000 5 0.000 -6.000 5 0.000 -6.000 6 0.000 -10.000 6 0.000 -10.000 7 0.000 -10.000 7 0.000 -10.000 Transshipment Problem: Example

39
39 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Computer Output (continued) OBJECTIVE COEFFICIENT RANGES OBJECTIVE COEFFICIENT RANGES Variable Lower Limit Current Value Upper Limit Variable Lower Limit Current Value Upper Limit X13 3.000 5.000 7.000 X13 3.000 5.000 7.000 X14 6.000 8.000 No Limit X14 6.000 8.000 No Limit X23 3.000 7.000 No Limit X23 3.000 7.000 No Limit X24 No Limit 4.000 6.000 X24 No Limit 4.000 6.000 X35 No Limit 1.000 4.000 X35 No Limit 1.000 4.000 X36 3.000 5.000 7.000 X36 3.000 5.000 7.000 X37 5.000 8.000 No Limit X37 5.000 8.000 No Limit X45 0.000 3.000 No Limit X45 0.000 3.000 No Limit X46 2.000 4.000 6.000 X46 2.000 4.000 6.000 X47 No Limit 4.000 7.000 X47 No Limit 4.000 7.000 Transshipment Problem: Example

40
40 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. or duplicated, or posted to a publicly accessible website, in whole or in part. Computer Output (continued) RIGHT HAND SIDE RANGES Constraint Lower Limit Current Value Upper Limit Constraint Lower Limit Current Value Upper Limit 1 75.000 75.000 No Limit 1 75.000 75.000 No Limit 2 75.000 75.000 100.000 2 75.000 75.000 100.000 3 -75.000 0.000 0.000 3 -75.000 0.000 0.000 4 -25.000 0.000 0.000 4 -25.000 0.000 0.000 5 0.000 50.000 50.000 5 0.000 50.000 50.000 6 35.000 60.000 60.000 6 35.000 60.000 60.000 7 15.000 40.000 40.000 7 15.000 40.000 40.000 Transshipment Problem: Example

Similar presentations

Presentation is loading. Please wait....

OK

Chapter 2: Introduction to Linear Programming

Chapter 2: Introduction to Linear Programming

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on albert einstein biography Ppt on condition monitoring training Ppt on political parties class 10 Ppt on model view controller example Ppt on bluetooth broadcasting hardware Ppt on carl friedrich gauss contribution Ppt on formal non-formal and informal education Ppt on abstract art pictures Ppt on employee motivation Download ppt on squares and square roots