This preview shows page 1. Sign up to view the full content.
Unformatted text preview: maximization problem. Original Problem Dual Problem 45 16 27 3 50 5 2 2 1 2 1 2 1 2 1 ≥ ≥ + = ≥ + ≥ + x x x x C x x x x 27 50 4 3 5 16 2 2 1 2 1 2 1 2 1 ≥ ≥ + = ≤ + ≤ + x x y y P y y y y Solution of a minimization Problem Given a minimization problem with nonnegative coefficients in the objective function, Step 1: Write all constraints as ≥ inequalities. Step 2: Form the dual problem. Step 3: Use variables from minimization problem as slack variables. Step 4: Use simplex method to solve this problem. Step 5: If solution exist, read it from bottom row. If dual problem has no solution, neither does the original problem....
View
Full
Document
This note was uploaded on 09/08/2010 for the course MATH 70 at San Jose State.
 '10
 Arabhi,Sundararajan

Click to edit the document details