TOPIC: LINEAR PROGRAMMING

How do I solve the following? Thank you.

SIMPLEX MAXIMIZATION METHOD Step 1: Transform the model constraint inequalities into equations. Symbols Explicit Constraint Objective Function " + 15 + 05 2 " Multiply both side of the + 05 inequality by -1 to reverse the symbol into s . + 15 + 15 HOS Step 2: Set-up the initial tableau for the basic feasible solution at the origin and compute for the Zj and Cj-Zj row values. Step 3: Determine the pivot/optimal column (entering solution variable) by selecting the column with the highest positive value in the Cj-Zj row. Step 4: Determine the pivotal row (leaving variable) by dividing the quantity column values (SVal column) and selecting the row with the smallest non-negative quotient (Smallest Quotient Rule). Step 5: Compute the new pivot row values using the formula: Old tableau pivot row values New tableau pivot row values = Pivot element Step 6: Compute all other row values using the formula: NTRV = OTRV - (CCPC x CNTPRV) Where: NTRV = New Tableau Row Values OTRV = Old Tableau Row Values CCPC = Corresponding Coefficients in Pivot Column CNTPRV . Corresponding New Tableau Pivot Row Values Step 7: Compute the new Zj and Cj-ZI rows. Step 8: Determine whether or not the new solution is optimal by checking the Cj-Zj row. If all Cj-Zj row values are zero and negative, the solution is optimal. If a positive value exists, return to step 3 and repeat the simplex process