In a Linear Programming Problem, Multiple Optimal Solutions Are Possible

question 15

Multiple Choice

In a linear programming problem, multiple optimal solutions are possible if:

• A) the contour of objective function touches one corner of the feasible region.
• B) there are more than two nonbinding constraints.
• C) the objective function is non-linear.
• D) the slope of the objective function equals the slope of a binding constraint.
• E) the feasible region is unbounded.

---

Definitions:

Compounded Semiannually

Refers to the process where interest is added to the principal balance of an investment, loan, or deposit twice a year, resulting in interest being earned on interest.

Future Value

The worth of a current asset or amount of money at a specified time in the future, accounting for specific interest or growth rates.

Future Value Table

A mathematical table used to calculate the future value of an investment or loan based on a specific interest rate and time period.

Present Value Table

A table used to calculate the present value of a future amount of money or stream of cash flows given a specific discount rate.