A minimization Inear programing problem has been convertes to its dual maximization problem. The simplex method was then applied to the maximization problem. The final maxximization simplex table is...

Extracted text: A minimization Inear programing problem has been convertes to its dual maximization problem. The simplex method was then applied to the maximization problem. The final maxximization simplex table is below S1 S2 S3 1 4 1 8 -3 1 5 3 1 1 3 4 2 22 15 17 1 300 O (x1, x2)= (8, 2) (s1, s2, s3) = (22, 15, 17) O (s1, s2, s3) = (2, 3, 8) (s1, s2, s3) = (8, 3, 2)