Reformulate this problem so all variables have nonnegativity constraints.

1. Consider the following problem. Maximize Z _ x1 _ 4×2 _ 2×3, subject to
4×1 _ x2 _ x3 _ 5

ORDER NOW FOR CUSTOMIZED SOLUTION PAPERS

_x1 _ x2 _ 2×3 _ 10
and
x2 _ 0, x3 _ 0 (no nonnegativity constraint for x1).
(a) Reformulate this problem so all variables have nonnegativity constraints.
(b) Work through the simplex method step by step to solve the problem.
(c) Use a software package based on the simplex method tosolve the problem.