Loading subjects
Linear Programming · Part 3 of 3
3 exam-style questions with model answers, plus 4 quick multi-choice questions — every question on this part of the standard, grouped by the 1 page of notes they come from.
Write a full answer before you reveal the model one. That comparison is where the learning happens.
A continuous optimum is at with the constraints and , both variables counting whole items. Find the best whole-number plan for the objective .
A bus company's optimum is 6.25 minibuses and 3.5 coaches, giving a continuous minimum cost of $4,850, subject to (seats) and (drivers), with cost . Find the best whole-number solution and explain the cost of integrality.
Explain why the optimal whole-number solution to a linear programme is not always the lattice point nearest the continuous optimum, construct an example demonstrating this, and describe a reliable procedure for finding the integer optimum in a two-variable problem.