In a Linear Programming Problem How Can the Optimum, Minimising

question 6

Multiple Choice

In a linear programming problem how can the optimum, minimising, 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:

Shareholders' Meeting

An official gathering of the shareholders of a company to discuss the company's affairs, make decisions, and vote on corporate issues.

Cumulative Voting

A voting system used in corporate elections that allows shareholders to accumulate their votes and allocate them to one or several candidates, enhancing minority shareholders' chances of representation.

Revised Act

Refers to an updated or amended legislative act or statute.

Incorporation Statutes

Laws that govern how companies can be legally established, regulated, and dissolved.