WRITE CODE TO SOLVE THE ABOVE LP USING PYTHON

LP Formulation:

Decision Variables:

$x_1$ : Number of chairs produced.

$x_2$ : Number of office tables produced.

$x_3$ : Number of computer tables produced.

$x_4$ : Number of book shelves produced.

Objective Function:

Maximize $z=35x_1+30x_2+55x_3+20x_4$

Constraints:

Subject to:

$4x_1+3x_2+5x_3+2x_{4}1750(Cutting$ labor constraint$)$

$3x_1+4x_2+2x_3+x_{4}1000(Painting$ labor constraint$)$

$2x_1+2x_2+3x_3+3x_{4}1400(Assembly$ labor constraint$)$

$2x_1+3x_2+x_3+2x_{4}650(Distributor$ A contract$)$

$x_1+x_2+2x_3+x_{4}450(DistributorB$ contract$)$

$x_1,x_2,x_3,x_{4}0(Non-$negativity constraints$)$

The problem is solved using the Big$-$M Method $(M=100)$ and the optimal tableau is given below: