Maximum flow: It is about finding a feasible flow through a single-source, singl
ID: 374365 • Letter: M
Question
Maximum flow: It is about finding a feasible flow through a single-source, single-sink flow network that is maximum.
Minimum Cost: The minimum-cost is an optimization and decision problem to find the cheapest possible way of sending a certain amount of flow through a flow network.
Shortest Path: The shortest-path algorithm creates a tree of shortest paths from the highest point, the source, to all other points in the graph.
Minimal spanning tree: A minimum spanning tree is a division of the edges of a connected, edge-weighted graph that connects all the points together, without any cycles and with the minimum possible total edge weight.
So, the answers to the questions are as follows:
Explanation / Answer
PART A Match the following network optimization model that could be useful for the scenarios encountered by Company JunkRUs- A- Maximum Flow B- Minimum Cost C- Shortest Path D-Minimal Spanning Tree JunkRUs needs to determine the number of products to ship from its factories to its network of warehouses and retail outlets. Production quantities at the factories, demand at the retailers, and transportation costs have been determined and can be used in your model. In preparation for the start of the summer season and feeling VERY optimistic, the company wants to plan for its factories' production quantities. It would like to produce the most quantity of its summer items that it can ship through its network of warehouses and retail outlets. Its best selling product has sold out in its prime outlet, you commission one of the trucks to get a new shipment out there ASAP! JunkRUs R&D; is laying out Golga Fiber (1000xXx Gbps high speed Internet connection) for its seven product development facilities. Golga Fiber is expensive @$1K per foot. A truck replacement plan for the company.