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$],[$$C$$14,$MAX PROFIT TOWN HOUSE,$25000,70000,]]$

Variable Cells

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

Constraints

$\backslash$table$[[$Cell$,$Name,Cell Value,Formula,Status,Slack$],[$$E$$6,$COST LHS$,1928000,$$E$$6$$S$,$Not Binding,$72000],[$$ES$7,$MANAGER TIME LHS$,96,$$E$$$9,$Not Binding,$44],[$$C$$3$:$D$$3=,,,,,]]$

What is the final result for the Objective Function?

A$.$ Cost is Minimized $$70,000.$

B$.$ Profit is Maximized $$25,000.$

C$.$ Transportation Cost is Optimized.

D$.$ Profit is Maximized $$70,000.$