The document discusses two linear programming problems. The first problem involves determining the optimal placement of fire stations among six cities to minimize costs, with the optimal solution being to place stations in cities 2 and 4. The second problem involves determining the optimal quantities of various food items to minimize costs, subject to nutritional constraints, with the optimal solution being butter=0, bread=3, orange juice=1, fat=0, with a minimum cost of $9.
The document discusses two linear programming problems. The first problem involves determining the optimal placement of fire stations among six cities to minimize costs, with the optimal solution being to place stations in cities 2 and 4. The second problem involves determining the optimal quantities of various food items to minimize costs, subject to nutritional constraints, with the optimal solution being butter=0, bread=3, orange juice=1, fat=0, with a minimum cost of $9.
The document discusses two linear programming problems. The first problem involves determining the optimal placement of fire stations among six cities to minimize costs, with the optimal solution being to place stations in cities 2 and 4. The second problem involves determining the optimal quantities of various food items to minimize costs, subject to nutritional constraints, with the optimal solution being butter=0, bread=3, orange juice=1, fat=0, with a minimum cost of $9.