Practical Management Science, Loose-leaf Version
Practical Management Science, Loose-leaf Version
5th Edition
ISBN: 9781305631540
Author: WINSTON, Wayne L.; Albright, S. Christian
Publisher: Cengage Learning
bartleby

Concept explainers

Question
Book Icon
Chapter 5, Problem 42P
Summary Introduction

To determine: The way to minimize the total distance.

Introduction: In linear programming, the unbounded solution would occur when the objective function is infinite. If no solution satisfied the constraints, then it is said to be an unfeasible solution.

Expert Solution & Answer
Check Mark

Explanation of Solution

Determine the number of students in districts from each community:

Practical Management Science, Loose-leaf Version, Chapter 5, Problem 42P , additional homework tip  1

Determine the busing distance:

Practical Management Science, Loose-leaf Version, Chapter 5, Problem 42P , additional homework tip  2

Determine the number of students on the bus from each community:

Practical Management Science, Loose-leaf Version, Chapter 5, Problem 42P , additional homework tip  3

Determine the busing distances:

Practical Management Science, Loose-leaf Version, Chapter 5, Problem 42P , additional homework tip  4

Practical Management Science, Loose-leaf Version, Chapter 5, Problem 42P , additional homework tip  5

Formula to determine the number of students in districts from each community:

Practical Management Science, Loose-leaf Version, Chapter 5, Problem 42P , additional homework tip  6

Formulae to determine the number of students in the bus from each community:

Practical Management Science, Loose-leaf Version, Chapter 5, Problem 42P , additional homework tip  7

Formula to determine the busing distances:

Practical Management Science, Loose-leaf Version, Chapter 5, Problem 42P , additional homework tip  8

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
The Hamilton County Local Government has eight sectors which need fire protection. Adequate Fire protection can be provided in each sector either by building a fire station in that sector, or by  building a fire station in another sector which is no more than a 12-minute drive away. The time to drive between the centers of each pair of sectors is given in the following table. (Because of one-way streets and left turns the times are not symmetric.) The cost to build a fire station is the  same in each sector.              Formulate an integer programming model to choose which sectors should have their own fire station.   Solve the model by using Excel Solver.
A person starting in Columbus must visit Great Falls, Odessa, and Brownsville, and then return home to Columbus in one car trip. The road mileage between the cities is shown.   Columbus Great Falls Odessa Brownsville Columbus --- 102 79 56 Great Falls 102 --- 47 69 Odessa 79 47 --- 72 Brownsville 56 69 72 --- a)Draw a weighted graph that represents this problem in the space below. Use the first letter of the city when labeling each b) Find the weight (distance) of the Hamiltonian circuit formed using the nearest neighbor algorithm. Give the vertices in the circuit in the order they are visited in the circuit as well as the total weight (distance) of the circuit.
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…

Chapter 5 Solutions

Practical Management Science, Loose-leaf Version

Knowledge Booster
Background pattern image
Operations Management
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, operations-management and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,