WORKSHEET (6.3)

WORKSHEET (6.3) - WORKSHEET (6.3) Part I Solve the...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
WORKSHEET (6.3) Part I Solve the following minimization problem by maximizing the dual: Minimize 2 1 2 x x C + = Subject to 6 2 1 + x x 12 3 2 1 + x x 0 , 2 1 x x Step1: Form a matrix A, using the coefficients and constants in the problem constraints and the objective function. = A Step 2: Interchange rows and columns of A to get T A . = A = T A Step 3: Use rows of T A to write down the dual maximization problem with constraints.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Original Problem Dual Problem Minimize 2 1 2 x x C + = Maximize 2 1 12 6 y y P + = Subject to 6 2 1 + x x Subject to 1 2 1 + y y 12 3 2 1 + x x 2 3 2 1 + y y 0 , 2 1 x x 0 , 2 1 y y Corner Points Corner Points ( x , y ) 2 1 2 x x C + = (0,6) (3,3) (12,0) Step 4: Write the initial system of the dual problem, using the variables from minimization
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/08/2010 for the course MATH 70 at San Jose State.

Page1 / 7

WORKSHEET (6.3) - WORKSHEET (6.3) Part I Solve the...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online