Using a software the linear programming problem was solved and the following sensitivity report was$$ obtained:

Adjustable Cells

Variable

Final Value

Reduced Cost

Objective Coefficient

Allowable Increase

Allowable Decrease

Upper V Subscript Upper A $1$

$0$

$1\mathrm{.}50$

$ $7\mathrm{.}50$

$1$E$+30$

$1\mathrm{.}50$

Upper V Subscript Upper A $2$

$100$

$0\mathrm{.}00$

$ $6\mathrm{.}25$

$0\mathrm{.}25$

$0\mathrm{.}75$

Upper V Subscript Upper A $3$

$550$

$0\mathrm{.}00$

$ $6\mathrm{.}50$

$0\mathrm{.}75$

$0\mathrm{.}25$

Upper V Subscript Upper B $1$

$400$

$0\mathrm{.}00$

$ $6\mathrm{.}75$

$0\mathrm{.}50$

$1$E$+30$

Upper V Subscript Upper B $2$

$400$

$0\mathrm{.}00$

$ $7\mathrm{.}00$

$0\mathrm{.}75$

$0\mathrm{.}50$

Upper V Subscript Upper B $3$

$0$

$0\mathrm{.}75$

$ $8\mathrm{.}00$

$1$E$+30$

$0\mathrm{.}75$

Constraints

Name

Final Value

Shadow Price

Constraint RH Side

Allowable Increase

Allowable Decrease

Upper C $1$

$650$

$6\mathrm{.}50$

$650$

$50$

$550$

Upper C $2$

$800$

$7\mathrm{.}25$

$800$

$50$

$400$

Upper C $3$

$400$

negative $0\mathrm{.}50$

$400$

$400$

$50$

Upper C $4$

$500$

negative $0\mathrm{.}25$

$500$

$550$

$50$

Upper C $5$

$550$

$0\mathrm{.}00$

$600$

$1$E$+30$

$50$

Part $11$

$$d$)$ Based on the information given in the sensitivity$$ reports, the number of constraints that are binding$=$