Handout #$3-$ IND$315$ Operations Research, Fall $2022$

$7.$ Simplex Algorithm: A Maximization Example. We use the Reddy Mikks model to explain the details $($steps$)$ of the simplex algorithm. Recall the model

Maximize $(max)z=5x_1+4x_2$

Subject $to(s.t.)6x_1+4x_{2}24(Raw$ material $M1)$

$x_1+2x_{2}6(Raw$ material $M2)$

$-x_1+x_{2}1(Production$ relationship$)$

$x_{2}2(Demand$ constraint$)$

$x_1,x_{2}0(Sign$ restriction$)$