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:

Straight-Line Amortization

A method of amortizing a bond discount or premium on a linear basis over the life of the bond or another asset.

Carrying Value

The book value of an asset or liability on a company's balance sheet, calculated as the original cost minus any depreciation, amortization, or impairment costs.

Interest Paid

The amount of money paid over a period for the use of borrowed funds.

Partial Amortization Schedule

A table detailing periodic loan payments that are not sufficient to fully amortize the loan over its term, leading to a remaining lump sum payment or balloon payment at the end.