LP Simplex Algorithm Examples 9-16

# LP Simplex Algorithm Examples 9-16 - Linear Programming...

This preview shows pages 1–2. Sign up to view the full content.

SimpleLP.mle in MORML Models Data: Ax=b, x>= 0, b>= 0, Maximize (A,b) 1.000 -3.000 -6.000 -4.000 0.000 0.000 0.000 0.000 0.000 1.000 2.000 1.000 1.000 0.000 0.000 10.000 0.000 -2.000 4.000 3.000 0.000 1.000 0.000 8.000 0.000 3.000 1.000 2.000 0.000 0.000 1.000 6.000 { x0, x1, x2, x3, s1, s2, s3} number of equations: 4 number of variables: 7 Basis Indices: { 1, 5, 6, 7} Names: { x0, s1, s2, s3} B 1.000 0.000 0.000 0.000 0.000 1.000 0.000 0.000 0.000 0.000 1.000 0.000 0.000 0.000 0.000 1.000 Inv[B] 1.000 0.000 0.000 0.000 0.000 1.000 0.000 0.000 0.000 0.000 1.000 0.000 0.000 0.000 0.000 1.000 Inv[B].(A,b) 1.000 -3.000 -6.000 -4.000 0.000 0.000 0.000 0.000 0.000 1.000 2.000 1.000 1.000 0.000 0.000 10.000 0.000 -2.000 4.000 3.000 0.000 1.000 0.000 8.000 0.000 3.000 1.000 2.000 0.000 0.000 1.000 6.000 x: { x0, s1, s2, s3} values: { 0.000, 10.000, 8.000, 6.000} entering variable: 3 slope increase value: 6.000 leaving variable row: 3 name: s2 ratio: 2.000 Basis Indices: { 1, 5, 3, 7} Names: { x0, s1, x2, s3} B 1.000 0.000 -6.000 0.000 0.000 1.000 2.000 0.000 0.000 0.000 4.000 0.000 0.000 0.000 1.000 1.000

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 5

LP Simplex Algorithm Examples 9-16 - Linear Programming...

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

View Full Document
Ask a homework question - tutors are online