PROBLEM 2From the next network, answer the questions.8AD9.6.GS171582422208FH112214531848BEU5a) Find the maximum flow from points A and B to point U, using the augmented pathalgorithm.b) Model this maximum flow problem according to minimum cost flow modeling(minimization)c) Model this_problem in maximization.

Find the Given flow details below: To A B C D E F G H I S T U From A 0 0 15 8 0 0 0 0 0 0…

Answered: PROBLEM 2 From the next network, answer…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter2: Introduction To Spreadsheet Modeling

Section: Chapter Questions

Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...

See similar textbooks

Similar questions

1. Given 6 customers and the costs (distances) between them, find the best route/scheduling using the savings method. Figure 1. Customers' locations (One of the customers is chosen as 0 for your convenience) 3 O 5 Table 1. The costs (distances) between customers Cu 0 1 0 1 2 3 4 5 10 6 13 17 5 10 5 8 6 8 6 5 7 11 9 2 13 8 7 10 16 3 17 6 11 10 10 5 8 9 16 10 1 5
Network Analysis Given this WBS, draw out a network diagram and use the two-pass and enumera methods to answer the following questions. Activity LCT 50 - b a-d-g-j Predecessor Ob-f-i Oa-c-f-i a-e-h-j a a a b, c d d, e f g, h <*** Duration 5 days Saved 434 994 6 4 5 Question 6 (1 point) Consider the network above. What is the critical path for this project? 6 6
Facility Location. A paper products manufacturer has enough capital to build and manage some additional manufacturing plants in the United States in order to meet increased demand in three cities: New York City, NY; Los Angeles, CA; and Topeka, KS. The company is considering building in Denver, CO; Seattle, WA; and St. Louis, MO. Max Operating Capacity 400 tons/day 700 tons/day Denver Seattle $10/ton $17/tor $5/ton $11/ton.... $18/ton.... $28/ton Los Angeles Topeka New York City Figure 1: Graphical representation of the given data = • The cost fi of building plants in these cities is fi $10,000,000 in Seattle. Unmet Demand 300 tons/day 100 tons/day 500 tons/day • Due to geographic constraints, plants in Denver and Seattle would have a maximum operating capacity kį of 400 tons/day and 700 tons/day respectively. $5,000,000 in Denver and f2 = • The cost cij per ton of transporting paper from city i to city j is outlined in Figure 1. • The unmet demand d, for Los Angeles, Topeka, and New…
Ocean Wave Apartment Case Study Dar es Salaam is a coastal capital in the process of reinventing itself, and is emerging as a cosmopolitan city that is enjoyable to explore. Dar remains at heart a bustling Swahili market town, yet is a center of trade and commerce which attracts ambitious Africans from all of Tanzania and its neighboring countries, and international communities who come to this port for all manner of business. This is Tanzania's communication hub, a world apart from the lifestyle of the rural majority. Because of the nature of the city, Dar es Salam is surrounded by a number of specious hotels and apartments for its cross boarder/ international business people one of which is Ocean Wave apartments. Located on the shores of the Indian Ocean within 9 km of Kivukoni Fish Market in Dar es Salaam and 0.6 miles from East Africa International School, Ocean Wave provides accommodation with free WiFi and flat-screen TV. The accommodation features a hot tub. Opening to a…
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.
15 X 10 6 15.5 1 (Max Flow Problem) 2 12 3 5 4.5 5 4 14.5 6 5 15.5 4.5 N Find the maximum flow from Node X to Node Z.
23. Find the shortest route from node 1 to node 7 in the network shown. 5 4 6. 9. 3 18 3 3
Draw a network diagram, including ES, EF, LS, LF, Float and Duration for the following scenario:
Maladroit Cosmetics Company The plant manager of the Maladroit Cosmetics Company must replace several of her filling machines that have become obsolete. She is about to take delivery of six machines at a total cost of $4 million. These machines must be installed and fully tested in time to be used on a new production line scheduled to begin operation in 6 months. Because this project is important, the plant manager would like to devote as much time as possible to the job, but she is currently handling several other projects. She thinks she has three basic choices: (1) she can handle the project informally out of her office; (2) she can assign the project to a member of her staff; or (3) the company that manufactures the machines can handle the installation project for a fee close to what the installation would cost Maladroit. Questions A. Would you classify the work of installing the six machines as a project? B. Why or why not? C. Explain how the PM might trade off one of the…
Consider the following information about sites A, B, and C: Site A B C FC (annual) $100.000 $120.000 $150.000 VC (per unit) $10 $8 $7 For what quantity would you be indifferent between selecting site A or site B?
Ross Hopkins, president of Hopkins Hospitality, has developed the tasks, durations, and predecessor relationships in the following table for building new motels. Activity a m b Immediate Predecessor(s) Activity a m b Immediate Predecessor(s)A 6 8 12 - G 2 3 4 C, EB 1 9 24 A H 2 2 2 FC 8 14 16 A I 7 7 7 FD 4 7 10 A J 6 7 12 D, G, HE 1 2 4 B K 1 1 4 I, JF 6 9 20 C, E a) The expected (estimated) time for activity C is 13.33weeks. (Round your response to two decimal places.) b) The variance for activity C is 1.78weeks. (Round your response to two decimal places.) c) Based on the calculation of the estimated times, the critical path is A - C - F - H - J - K . d) The estimated time for the critical path is [ ? ] enter your response here weeks. (Round your response to two…

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Operations Management

ISBN:

9781259667473

Author:

William J Stevenson

Publisher:

McGraw-Hill Education

Operations and Supply Chain Management (Mcgraw-hi…

Operations Management

ISBN:

9781259666100

Author:

F. Robert Jacobs, Richard B Chase

Publisher:

McGraw-Hill Education

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Operations Management

ISBN:

9781259667473

Author:

William J Stevenson

Publisher:

McGraw-Hill Education

Operations and Supply Chain Management (Mcgraw-hi…

Operations Management

ISBN:

9781259666100

Author:

F. Robert Jacobs, Richard B Chase

Publisher:

McGraw-Hill Education

Business in Action

Operations Management

ISBN:

9780135198100

Author:

BOVEE

Publisher:

PEARSON CO

Purchasing and Supply Chain Management

Operations Management

ISBN:

9781285869681

Author:

Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson

Publisher:

Cengage Learning

Production and Operations Analysis, Seventh Editi…

Operations Management

ISBN:

9781478623069

Author:

Steven Nahmias, Tava Lennon Olsen

Publisher:

Waveland Press, Inc.

SEE MORE TEXTBOOKS

PROBLEM 2 From the next network, answer the questions. 8 A D 6 G S 17 15 8 24 2 2 20 5 8 F H T 11 22 14 3 18 4 8 B E U 6 5 a) Find the maximum flow from points A and B to point U, using the augmented path algorithm.