dual simplex

# What does this mean the dual problem is unbounded 3 4

This preview shows page 1. Sign up to view the full content.

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

Unformatted text preview: -4 1 -4 -1 -2 1 -2 2 1 -1 -1 1 0 0 0 0 1 0 0 0 0 1 0 -3 -4 2 0 ← pivot row -1 -4 1 -4 1 -2 0 -2 -1 -2 1 -2 1 0 0 0 2 1 -1 -1 -2 -3 1 -5 1 0 0 0 -1 -2 1 -2 0 1 0 0 0 1 0 0 0 0 1 0 0 0 1 0 -3 -4 2 0 3 2 -1 6 ← pivot row -1 -4 1 -4 1 -2 0 -2 -1 -2 1 -2 1 0 0 0 2 1 -1 -1 -2 -3 1 -5 1 0 0 0 -1 -2 1 -2 0 1 0 0 0 1 0 0 0 0 1 0 0 0 1 0 -3 -4 2 0 3 2 -1 6 ← pivot row ← pivot row -1 -4 1 -4 1 -2 0 -2 -1 -2 1 -2 1 0 0 0 2 1 -1 -1 -2 -3 1 -5 1 0 0 0 -1 -2 1 -2 0 1 0 0 0 1 0 0 0 0 1 0 0 0 1 0 No negative entry in the pivot row! What does this mean? -3 -4 2 0 3 2 -1 6 ← pivot row ← pivot row -1 -4 1 -4 1 -2 0 -2 -1 -2 1 -2 1 0 0 0 2 1 -1 -1 -2 -3 1 -5 1 0 0 0 -1 -2 1 -2 0 1 0 0 0 1 0 0 0 0 1 0 0 0 1 0 No negative entry in the pivot row! What does this mean? The dual problem is unbounded. -3 -4 2 0 3 2 -1 6 ← pivot row ← pivot row -1 -4 1 -4 1 -2 0 -2 -1 -2...
View Full Document

Ask a homework question - tutors are online