Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Problem 1 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/ton $5/ton $11/ton.. $18/ton $28/ton Los Angeles . The cost of building plants in these cities is fi $10,000,000 in Seattle. Topeka New York City Figure 1: Graphical representation of the given data = Unmet Demand 300 tons/day 100 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. 500 tons/day $5,000,000 in Denver and f2 = • The cost c¿j 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 York City are 300 tons/day, 100 tons/day, and 500 tons/day, respectivey. The problem is to decide which plants to build, how much paper to produce in each plant, and how best to ship paper from the plants to the customers in the way which minimizes total expense.

Problem 1 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/ton $5/ton $11/ton.. $18/ton $28/ton Los Angeles . The cost of building plants in these cities is fi $10,000,000 in Seattle. Topeka New York City Figure 1: Graphical representation of the given data = Unmet Demand 300 tons/day 100 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. 500 tons/day $5,000,000 in Denver and f2 = • The cost c¿j 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 York City are 300 tons/day, 100 tons/day, and 500 tons/day, respectivey. The problem is to decide which plants to build, how much paper to produce in each plant, and how best to ship paper from the plants to the customers in the way which minimizes total expense.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

(a) Model this problem as an Integer Program.

(b) Ignoring any integer constraints, derive the dual of the IP you found in part (a). Hint: remember
that a binary constraint decomposes into ≥ 0, ≤ 1, and Integer.

Problem 1 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/tom $5/ton $11/ton............... $18/ton $28/ton Los Angeles Topeka New York City Figure 1: Graphical representation of the given data 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. • The cost fi of building plants in these cities is f₁ = $5,000,000 in Denver and f2 $10,000,000 in Seattle. • 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 York City are 300 tons/day, 100 tons/day, and 500 tons/day, respectivey. The problem is to decide which plants to build, how much paper to produce in each plant, and how best to ship paper from the plants to the customers in the way which minimizes total expense.
Transcribed Image Text:Problem 1 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/tom $5/ton $11/ton............... $18/ton $28/ton Los Angeles Topeka New York City Figure 1: Graphical representation of the given data 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. • The cost fi of building plants in these cities is f₁ = $5,000,000 in Denver and f2 $10,000,000 in Seattle. • 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 York City are 300 tons/day, 100 tons/day, and 500 tons/day, respectivey. The problem is to decide which plants to build, how much paper to produce in each plant, and how best to ship paper from the plants to the customers in the way which minimizes total expense.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 7 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS