If a Maximization Linear Programming Problem Consists of All Less-Than-Or-Equal-To

question 90

Multiple Choice

If a maximization linear programming problem consists of all less-than-or-equal-to constraints with all positive coefficients and the objective function consists of all positive objective function coefficients, then rounding down the linear programming optimal solution values of the decision variables will ________ result in a feasible solution to the integer linear programming problem.

• A) always
• B) sometimes
• C) optimally
• D) never

---

Definitions:

Held to Maturity

A classification of debt securities that a company intends and is able to hold until they mature.

Market Price

The current price at which an asset or service can be bought or sold.

Journal Entries

Records of financial transactions in the accounting system, showing the accounts affected and the amounts for each transaction.

Available for Sale

A classification for financial assets indicating they are not primarily held for trading or immediate sale but may be sold in the future.