In a Linear Programming Problem How Can the Optimum, Maximising

question 2

Multiple Choice

In a linear programming problem how can the optimum, maximising, solution be identified?

• A) The point within the feasibility region, intersecting the line defining the objective function, furthest up the vertical (y) axis
• B) The point within the feasibility region, intersecting the line defining the objective function, furthest along the horizontal (x) axis
• C) The point within the feasibility region, intersecting the line defining the objective function, that is closest to the origin
• D) The point within the feasibility region, intersecting the line defining the objective function, that is furthest away from the origin

---

Definitions:

Evacuation system

A set of procedures and equipment designed for the safe exit of people from a building or area in case of emergency.

Interchangeable

Capable of being exchanged or substituted for each other without making any difference or without altering the function.

Collection tubes

Tubes specifically designed for the collection and transport of specimens, such as blood, for medical testing.

Calibrated

Adjusted precisely for a particular function.