Consider the Following Integer Programming Problem \mathrm    { Z } = 2 x _ { 1 } + x _ { 2 }

question 21

Multiple Choice

Consider the following integer programming problem. Solve it using the branch and bound method. What are the optimal values of x1, x2, and Z?
Maximize \mathrm    { Z } = 2 x _ { 1 } + x _ { 2 }
Subject to: \quad    2 x _ { 1 } + 2 x _ { 2 } \leq 7
           $4 x _ { 1 } + x _ { 2 } \leq 11$
             $x _ { 1 }$ and $x _ { 2 } \geq 0$

• A) x₁ = 1, x₂ = 2, Z = 4
• B) x₁= 2, x₂ = 1, Z = 5
• C) x₁ = 1, x₂ = 1, Z = 3
• D) x₁ = 0, x₂= 3, Z = 3
• E) x₁ = 2, x₂ = 2, Z = 6

---

Definitions:

Residual Value

The estimated value that an asset will realize upon its sale at the end of its useful life.

Straight-Line Depreciation

A method of calculating the depreciation of an asset, distributing its cost evenly across its useful life.

Depreciable Cost

The cost of a fixed asset minus its estimated salvage value, which is the basis for calculating depreciation expense.

Useful Life

The expected period over which an asset is anticipated to be useful and productive for its intended purpose.