Linear programming bingo

Exercise and reference answers

Clues and terms

1. Clue

   Class of problems seeking a best value.

   Item

   Optimisation

2. Clue

   The linear function Z being optimised.

   Item

   Objective

3. Clue

   A linear restriction on the variables.

   Item

   Constraint

4. Clue

   The conditions x and y at least zero.

   Item

   Non-negative

5. Clue

   Region where every constraint holds.

   Item

   Feasible

6. Clue

   Any point lying outside that region.

   Item

   Infeasible

7. Clue

   Vertex where the optimum is found.

   Item

   Corner point

8. Clue

   Region that fits inside a circle.

   Item

   Bounded

9. Clue

   Region where an optimum may not exist.

   Item

   Unbounded

Instructions

Read each clue and tap the term it describes.

Explanation