In Problems 39-47, construct a mathematical model in the form of a linear programming problem. Do not solve. Transportation. Three towns are forming a consolidated school district with two high schools. Each high school has a maximum capacity of 2 , 000 students. Town A has 500 high school students, town B has 1 , 200 , and town C has 1 , 800 . The weekly costs of transporting a student from each town to each school are given in the table. In order to balance the enrollment, the school board decided that each high school must enroll at least 40 % of the total student population. Furthermore, no more than 60 % of the students in any town should be sent to the same high school. How many students from each town should be enrolled in each school in order to meet these requirements and minimize the cost of transporting the students?
In Problems 39-47, construct a mathematical model in the form of a linear programming problem. Do not solve. Transportation. Three towns are forming a consolidated school district with two high schools. Each high school has a maximum capacity of 2 , 000 students. Town A has 500 high school students, town B has 1 , 200 , and town C has 1 , 800 . The weekly costs of transporting a student from each town to each school are given in the table. In order to balance the enrollment, the school board decided that each high school must enroll at least 40 % of the total student population. Furthermore, no more than 60 % of the students in any town should be sent to the same high school. How many students from each town should be enrolled in each school in order to meet these requirements and minimize the cost of transporting the students?
Solution Summary: The author describes the mathematical model in the form of a linear programming problem to determine the number of students from each town that must be enrolled in each school in order to satisfy the requirements and minimize the transportation cost.
In Problems 39-47, construct a mathematical model in the form of a linear programming problem. Do not solve.
Transportation. Three towns are forming a consolidated school district with two high schools. Each high school has a maximum capacity of
2
,
000
students. Town
A
has
500
high school students, town
B
has
1
,
200
, and town
C
has
1
,
800
. The weekly costs of transporting a student from each town to each school are given in the table. In order to balance the enrollment, the school board decided that each high school must enroll at least
40
%
of the total student population. Furthermore, no more than
60
%
of the students in any town should be sent to the same high school. How many students from each town should be enrolled in each school in order to meet these requirements and minimize the cost of transporting the students?
Mathematics with Applications In the Management, Natural and Social Sciences (11th Edition)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.
Solve ANY Optimization Problem in 5 Steps w/ Examples. What are they and How do you solve them?; Author: Ace Tutors;https://www.youtube.com/watch?v=BfOSKc_sncg;License: Standard YouTube License, CC-BY
Types of solution in LPP|Basic|Multiple solution|Unbounded|Infeasible|GTU|Special case of LP problem; Author: Mechanical Engineering Management;https://www.youtube.com/watch?v=F-D2WICq8Sk;License: Standard YouTube License, CC-BY