If each van can transport 7 people and there are 35 available chaperones, show that the optimal solution found graphically involves decimals. Find all feasible solutions with integer coordinates and identify the one that minimizes the transportation costs. Can this optimal integer solution be obtained by rounding the optimal decimal solution? Explain.
In Problem construct a mathematical model in the form of a linear programming problem.
For Information: Refer to Problem 35.