Question $22$

Refer to the following Answer Report for an optimal solution:

A

B

C

D

E

F

G

Solver Engine

Engine: Simplex LP

Solution Time: $1029\mathrm{.}902$ Seconds.

Iterations: $1$ Subproblems: $14$

Solver Options

Max Time Unlimited, Iterations Unlimited, Precision $1$E$-06,$ Use Automatic Scaling

Max Subproblems Unlimited, Assume NonNegative

Objective Cell $($Max$)$

$\backslash$table$[[$Cell$,$Name,Original Value,Final Value$],[$$$$,$MAX PROFIT TOWN HOUSE,$25000,70000,]]$

Variable Cells

$\backslash$table$[[$Cell$,$Name,Original Value,Final Value$],[$$C$$3,$NUMBER TO BUY TOWN HOUSE,$1,4$ Integer$],[$$D$$3,$NUMBER TO BUY APARTMENT,$1,2$ Integer$]]$

Constraints

$\backslash$table$[[$Cell$,$Name,Cell Value,Formula,Status,Slack$],[$$E$$6,$COST LHS$,1928000,$ES$$6$$G$$6,$Not Binding,$72000],[$$ES$7,$MANAGER TIME LHS$,,$EST$G$$7,$Not Binding,$44]]$

What type of linear programming model is this problem?

A$.$ Transportation Model

B$.$ Basic LP Model

C$.0-1$ Integer Model

D$.$ Total Integer Model