See image for Question. Please only provide the working to part c. Please show all steps/formulas for the excel solver solution.Solution to b for reference: LINEAR PROGRAMMING PROBLEMMIN 4X14 + 7X15 + 8X24 + 5X25 + 5X34 + 6X35 + 6X46 + 4X47 + 8X48 + 4X49 + 3X56 + 6X57 + 7X58 + 7X59S.T.(1) X14 + X15 < 450(2) X24 + X25 < 600(3) X34 + X35 < 380 (4) X46 + X47 + X48 + X49 - X14 - X24 - X34 = 0(5) X56 + X57 + X58 + X59 - X15 - X25 - X35 = 0(6) X46 + X56 = 300(7) X47 + X57 = 300(8) X48 + X58 = 300(9) X49 + X59 = 400Soution to c for reference: OPTIMAL SOLUTIONObjective Function Value =11850.000 Variable Value Reduced Costs------------ ------------ ---------------X14 450.000 0.000 X15 0.000 3.000 X24 0.000 3.000 X25 600.000 0.000 X34 250.000 0.000 X35 0.000 1.000 X46 0.000 3.000 X47 300.000 0.000 X48 0.000 1.000 X49 400.000 0.000 X56 300.000 0.000 X57 0.000 2.000 X58 300.000 0.000 X59 0.000 3.000 11. The distribution system for the Herman Company consists of three plants, two warehouses,and four customers. Plant capacities and shipping costs per unit (in $) from each plant toeach warehouse are as follows:WarehousePlant12Сараcity45060038014728535Customer demand and shipping costs per unit (in $) from each warehouse to each customerare as follows:a. Develop a network representation of this problem.b. Formulate a linear programming model of the problem.c. Solve the linear program to determine the optimal shipping plan.с.CustomerWarehouse12346.3148426.77Demand300300300400 11. a. Network ModelDemand300Supply450PI4WI300C28.2600P25W2 730036380P3400C4

Given that: Following LPP- MIN 4X14 + 7X15 + 8X24 + 5X25 + 5X34 + 6X35 + 6X46 + 4X47 + 8X48 + 4X49 +…

See image for Question. Please only provide the working to part c. Please show all steps/formulas for the excel solver solution. Solution to b for reference: LINEAR PROGRAMMING PROBLEM MIN 4X14 + 7X15 + 8X24 + 5X25 + 5X34 + 6X35 + 6X46 + 4X47 + 8X48 + 4X49 + 3X56 + 6X57 + 7X58 + 7X59 S.T. (1) X14 + X15 < 450 (2) X24 + X25 < 600 (3) X34 + X35 < 380 (4) X46 + X47 + X48 + X49 - X14 - X24 - X34 = 0 (5) X56 + X57 + X58 + X59 - X15 - X25 - X35 = 0 (6) X46 + X56 = 300 (7) X47 + X57 = 300

See image for Question. Please only provide the working to part c. Please show all steps/formulas for the excel solver solution. Solution to b for reference: LINEAR PROGRAMMING PROBLEM MIN 4X14 + 7X15 + 8X24 + 5X25 + 5X34 + 6X35 + 6X46 + 4X47 + 8X48 + 4X49 + 3X56 + 6X57 + 7X58 + 7X59 S.T. (1) X14 + X15 < 450 (2) X24 + X25 < 600 (3) X34 + X35 < 380 (4) X46 + X47 + X48 + X49 - X14 - X24 - X34 = 0 (5) X56 + X57 + X58 + X59 - X15 - X25 - X35 = 0 (6) X46 + X56 = 300 (7) X47 + X57 = 300

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter5: Network Models

Section5.4: Other Logistics Models

Problem 19P

See similar textbooks

Similar questions

A beer distributor needs to plan how to make deliveries from its warehouse (node 1) to a supermarket (node 7), as shown in the network below. A graph with 7 nodes and 9 arcs is shown. Node 1 is connected to node 2 by arc of value 3, to node 5 by arc of value 3, and to node 6 by arc of value 11. Node 2 is connected to node 3 by arc of value 4. Node 3 is connected to node 2 by arc of value 4 and to node 4 by arc of value 7. Node 4 is connected to node 3 by arc of value 7, to node 6 by arc of value 5, and to node 7 by arc of value 6. Node 5 is connected to node 6 by arc of value 7. Node 6 is connected to node 4 by arc of value 5, to node 5 by arc of value 7, and to node 7 by arc of value 3. Develop the LP formulation for finding the shortest route from the warehouse to the supermarket. (Let xij represent the flow from node i to node j.) Min s.t.Node 1 Flows Node 2 Flows Node 3 Flows Node 4 Flows Node 5 Flows Node 6 Flows Node 7…
Transportation Problems: The EBKK company has three plants producing child push chairs that are to be shipped to four distribution centers. Plans 1, 2, and 3 produce 12, 17, and 11 shipments per month, respectively. Each distribution center needs to receive 10 shipments per month. The distance from each plant to the respective distribution center is given below: DISTRIBUTION CENTER Plant 1 2 3 4 1 800 1300 400 700 2 1100 1400 600 800 3 600 1200 800 900 a. Draw a complete network representation of the problem b. Is the initial solution optimal? c. Find the optimal solution using the MODI Method d. The freight cost for each shipment is $100 plus 50 cents per mile. How much should be shipped from each plant to each of the distribution centers to minimize the total shipping cost?
KCS Ltd has got three production lines with the same production costs namely; K, L, and S whose production capacities are 140, 160, and 200 units respectively. These are marketed through four destinations B, C, J, and M having demands of 110, 150, 140, and 100 units respectively. The transportation cost between the production lines and market destinations are; K to B, K to C, K to J, K to M, L to B, L to C, L to J, L to M, S to B, S to C, S to J, and S to M as 18, 11, 13, 29, 19, 25, 15, 28, 24, 27, 19, and 12 respectively all costs are US dollars. a).Create a working table taking lines as rows and destinations as columns b). Determine the Cheapest route and Most expensive route to use c).Use the Northwest Corner Method to distribute the products d).Vogel’s Approximation Technique e).Compute their respective total costs incurred
he Midvale Sand and Gravel Company desires to allocate its products (load) to their three projects from their three warehouses. The three warehouses, designated as A, B, and C have a capacity of 51, 23, and 38 respectively. The three projects, designated as D, E, and F have a demand of 46, 40 and 26 respectively. The shipping costs per load to its destination are as follows: From A to its projects are 4, 9 and 2 respectively; From B to its projects are 3, 5 and 8 respectively; and From C to its projects are 6, 2 and 5 respectively. 1. Show the Network presentation of the company. 2. Formulate the objective functions and constraints only using the Linear Programming Model. The objective is to minimize the total transportation costs. 3. Find the optimal solution using the NWC and stepping stone method.
The north-south highway system passing through Albany, New York can accommodate the capacities shown in the table below. From To Capacities 1 2 3 1 3 6 1 4 3 2 4 2 2 5 4 3 4 3 3 6 2 4 2 2 4 3 3 4 5 2 4 6 3 5 2 4 5 4 2 5 6 6 How many units go from Node 1 to 3 and 4 to 2, respectively, in order to maximize the flow. a. 5 and 1. b. 5 and 2. c. none of the answers proposed apply d. 6 and 1. e. 6 and 2.
9-7 The management of the Executive Furniture Corporation decided to expand the production capacity at its Des Moines factory and to cut back the production capacities at its other two factories. It also recognizes a shifting market for its desks and revises the requirements at its three warehouses. The table on this page provides the requirement at each of the warehouses, the capacity at each of the factories, and the shipping cost per unit to ship from each factory to each warehouse. Find the least-cost way to meet the requirements given the capacity at each factory.
The following diagram represents a flow network. Each edge is labeled with its capacity, the maximum amount of stuff that it can carry. a. Formulate an algebraic model for this problem as a maximum flow problem. b. Develop a spreadsheet model and solve this problem. What is the optimal flow plan for this network? What is the optimal flow through the network?
ASAP PLEASE.. The distribution of goods from the source (factory) to the target (warehouse) will cause problems regarding TRANSPORT, namely how the goods are sent from the factory to the warehouse which produces minimum costs. If it is known that - the capacity of 3 factories is 40000, 30000 and 20000, - the need for 3 warehouses is 20000, 50000 and 30000 respectively. The cost of shipping goods from the factory to the warehouse is shown in the following table Solve the above TRANSPORTATION problems with VAM and MODI
The figure below shows the nodes (A−I) and capacities (labelled on arcs in TB/s) of a computer network. The firm would like to know how much information can flow from node A to node I. Which nodes are the sink and source for this problem? Multiple Choice: Node A is the source, Node I is the sink. Node A is the sink, Node B is the source. Node A is the sink, Node I is the source. Node B is the sink, Node I is the source. Node B is the source, Node I is the sink.
Draw the network for this transportation problem. (Let xij represent the flow from node i to node j.) Min 2x13 + 4x14 + 6x15 + 8x23 + 11x24 + 9x25 s.t. x13 + x14 + x15 ≤ 500 x23 + x24 + x25 ≤ 400 x13 + x23 = 300 x14 + x24 = 300 x15 + x25 = 300 xij ≥ 0
Suisan Fish Company contracts with fishers in Hilo, Kona, and Puna, Big Island to purchase fishes. The fishes are cleaned and stored at the local processing facilities. Then the fishes are shipped to two plants, where they are cut, processed, and packaged as sushi and sashimi. The sushi and sashimi are then transported to three restaurants. The transportation costs per fish from the fishers to the plants and from the plants to the restaurants are summarized in the following tables: Determine the optimal shipments from fishers to plants and from plants to restaurants to minimize total transportation costs. Include the formulation and solver outputs. What would be the effect on the solutions if the capacity at each plant were 70 fishes?
A salesman for Healthproof Pharmaceutical Company travels each week from his office in Atlanta to one of five cities in the Southeast where he has clients. The travel time (in hours) between cities along interstate highways is shown along each branch in the following network: A. Determine the shortest route from Atlanta to each of the other five cities in the network. B. Assume that the network now represents six different communities in a city and that the local transportation authority wants to design a rail system that will connect all six communities with the minimum amount of track. The miles between each community are shown on each branch. Develop a minimal spanning tree for this problem.