Consider the following linear programming model and Analytic Solver Platform sensitivity output.

MAX: $7$X$1+4$X$2$

Subject to: $2$X$1+$ X$2<=16$

X$1+$ X$2<=10$

$2$X$1+5$X$2<=40$

X$1,$ X$2>=0$

Changing Cells

Cell Name Final

Value Reduced

Cost Objective

Coefficient Allowable

Increase Allowable

Decrease

$ B$$4$ Number to make: X$160713$

$ C$$4$ Number to make: X$240430\mathrm{.}5$

Constraints

Cell Name Final

Value Shadow

Price Constraint

R$.$ H$.$ Side Allowable

Increase Allowable

Decrease

$ D$$8$ Used $1631642\mathrm{.}67$

$ D$$9$ Used $1011012$

$ D$$10$ Used $320401$E$+308$

What is the smallest value that the objective function coefficient for X$1$ can assume without changing the optimal solution?