A linear programming model where all constraints are $$ is always feasible.

$($D$)$ Do$$ru

Yanl$$

Soru $12$

Write down the values of the decisions variables for this optimal solution.

$\backslash$table$[[z,x_1,x_2,x_3,x_4,s_1,s_2,s_3,s_4,$RHS$],[1,a,5,c,1,d,g,6,6,{50}^{\text{@}*}$