Multiple ChoiceOONode A is the origin, Node I is the destination.Node A is the origin, Node M is the destination.Node B is the origin, Node I is the destination.Node B is the destination, Node I is the origin.Node A is the destination, Node I is the origin. The figure below shows the possible routes from city A to city M as well as the cost (in dollars) of a trip between each pair of cities (note that if no arcjoins two cities it is not possible to travel non-stop between those two cities). A traveler wishes to find the lowest cost option to travel from city A to cityM.A2016B1121DE142314H151410J11K182321MWhich nodes are the origin and destination for this problem?

Ans) In the current diagram we can see that traveller wanted to reach from A to M in minimum cost.…

Answered: The figure below shows the possible…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter5: Network Models

Section: Chapter Questions

Problem 47P

See similar textbooks

Similar questions

This problem is based on Motorolas online method for choosing suppliers. Suppose Motorola solicits bids from five suppliers for eight products. The list price for each product and the quantity of each product that Motorola needs to purchase during the next year are listed in the file P06_93.xlsx. Each supplier has submitted the percentage discount it will offer on each product. These percentages are also listed in the file. For example, supplier 1 offers a 7% discount on product 1 and a 30% discount on product 2. The following considerations also apply: There is an administrative cost of 5000 associated with setting up a suppliers account. For example, if Motorola uses three suppliers, it incurs an administrative cost of 15,000. To ensure reliability, no supplier can supply more than 80% of Motorolas demand for any product. A supplier must supply an integer amount of each product it supplies. Develop a linear integer model to help Motorola minimize the sum of its purchase and administrative costs.
The figure below shows the possible routes from city A to city M as well as the cost (in dollars) of a trip between each pair of cities (note that if no arc joins two cities it is not possible to travel non-stop between those two cities). A traveler wishes to find the lowest cost option to travel from city A to city M. Which type of network optimization problem is used to solve this problem? Multiple Choice: Minimum Flow Problem Average-Cost Flow problem Maximum Flow Problem Shortest Path Problem Maximum-Cost Flow problem
Consider the following linear programming model with 4 regular constraints:Maximize 3X + 5Y (a) Draw your graph in the space below:subject to: 4X + 4Y ≤ 48 (constraint #1) 4X + 3Y ≤ 50 (constraint #2) 2X + 1Y ≤ 20 (constraint #3) X ≥ 2 (constraint #4) X, Y ≥ 0 (non-negativity constraints)(a) Which of the constraints is redundant? Constraint #______.Justify by drawing a graph similar to Figure 7.14 on p.263.(b) Is point (9,3) a feasible solution? _____. Explain your answer (by analyzing each of the constraints).Constraint #1: _______________________________________________________________Constraint #2: _______________________________________________________________Constraint #3: _______________________________________________________________Constraint #4: ______________________________________________________________
Please use excel for this problem A furniture manufacturer produces two types of tables – country and contemporary – using three types of machines. The time required to produce the tables on each machine is given in the following table: Machine Country Contemporary Total Machine Time Available Per Week Router 3.5 4.0 1,000 Sander 4.5 6.5 2,000 Polisher 3.0 2.0 1,500 Country tables sell for $395 and contemporary tables sell for $515. Management has determined that at least 25% of the tables made should be country and at least 38% should be contemporary. How many of each type of table should the company manufacture if it wants to maximize its revenue? Formulate an LP model for this problem Create the spreadsheet model and use Solver to solve the problem.
Jefferson Distributing is analyzing distribution networks with either 4, 5, 6 or 7 warehouses to serve 200 major customers in Europe. Relevant costs include transportation cost from the warehouses to customers, fixed facility costs, and inventory costs in the warehouses. The table below shows the annual transportation cost produced by a facility location software tool for locating 4, 5, 6 or 7 warehouses for this company. Suppose that annual inventory cost for the network can be modeled as $800,000 times the square root of the number of warehouses. Thus, if the network has 4 warehouses, then the annual inventory cost would be $800,000 x √4= $1,600,000. Number of Warehouses Transportation Cost 4 8,000,000 5 6,500,000 6 5,000,000 7 4,400,000 a) If the annual fixed cost per warehouse is $1,000,000, how many warehouses should there be to minimize the total (transportation + warehouse + inventory) cost? b) Now suppose the…
A company has three manufacturing plants (in Atlanta,Tulsa, and Springfi eld) that produce a product that is then shipped to one of four distribution centers. Th e three plants can produce13, 18, and 12 truckloads of product each week, respectively. Eachdistribution center needs 10 truckloads of product each week. Th eshipping costs per truckload between the plants and distributioncenters are given in the table. Th e company needs to determinehow much to ship from each plant to each distribution center andwould like to minimize total shipping costs (a) Formulate an LP to minimize the total shipping costs.(b) Set up and solve the problem on a spreadsheet.(c) What is the optimal solution? Explain the rationale for thesolution
A refinery manufactures two grades of jet fuel, Fl and F2, by blending four types of gasoline, A. B, C, and D. Fuel Fl uses gasolines A. B. C, and D in the ratio 1:1:2:4, and fucl F2 uses the ratio 2:2:1:3. The supply limits for A, B.C, and D are 1000, 1200, 900, and 1500 bbl/day, respectively. The costs per bbl for gasolines A, B, C, and D are $120, $90, $100, and $150, respectively. Fucls Fl and F2 sell for $200 and $250 per bbl, respectively. The minimum demand for F1 and F2 is 200 and 400 bbl/day, respectively. Develop an LP model to determine the optimal production mix for F1 and F2, and find the solution using Solver
A refinery manufactures two grades of jet fuel, Fl and F2, by blending four types of gasoline, A. B, C, and D. Fuel Fl uses gasolines A. B. C, and D in the ratio 1:1:2:4, and fucl F2 uses the ratio 2:2:1:3. The supply limits for A, B.C, and D are 1000, 1200, 900, and 1500 bbl/day, respectively. The costs per bbl for gasolines A, B, C, and D are $120, $90, $100, and $150, respectively. Fucls Fl and F2 sell for $200 and $250 per bbl, respectively. The minimum demand for F1 and F2 is 200 and 400 bbl/day, respectively. Develop an LP model to determine the optimal production mix for F1 and F2,
Solve the following problems using Excel Solver or R Studio. A company produces cars in Atlanta, Boston, Chicago, and Los Angeles. The cars are then shipped to warehouses in Memphis,Milwaukee, New York City, Denver, and San Francisco. The number of cars available at each plant is given in Table 1. Eachwarehouse needs to have available the number of cars given in Table 2. The distance (in miles) between the cities is given inTable 3. Assuming that the cost (in dollars) of shipping a car equals the distance between two cities, determine an optimalshipping schedule.
The figure below shows the possible routes from city A to city J as well as the time (in minutes) required for a trip between each pair of cities (note that if no arc joins two cities it is not possible to travel non-stop between those two cities). A traveler wishes to find the quickest option to travel from city A to city J. What is the shortest time possible to travel from node F to node J. Multiple Choice: 200 140 110 180 160
A minimum-cost flow problem has 5 supply nodes, 2 transshipment nodes, and 5 demand nodes. Each supply node can ship to each transshipment node but cannot ship to any demand node or to any other supply node. Each transshipment node can ship to each demand node, but cannot ship to any supply node or to any other transshipment node. How many arcs will be included in the model?
Mad Max wants to travel from New York to Dallas bythe shortest possible route. He may travel over the routesshown in Table 8. Unfortunately, the Wicked Witch canblock one road leading out of Atlanta and one road leadingout of Nashville. Mad Max will not know which roads havebeen blocked until he arrives at Atlanta or Nashville. ShouldMad Max start toward Atlanta or Nashville? Which routesshould the Wicked Witch block? Route (Miles)New York–Atlanta 800New York–Nashville 900Nashville–St. Louis 400Nashville–New Orleans 200Atlanta–St. Louis 300Atlanta–New Orleans 600St. Louis–Dallas 500New Orleans–Dallas 300

SEE MORE QUESTIONS

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

SEE MORE TEXTBOOKS