Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

The usual problem is to maximize some linear function
$f(x_0, x_1 ... x_n)$
subject to linear constraints
$g_i(x_0, x_1 ... x_n) \leq b_i$.

My question is: What happens when all (or most) of the $b_i$ are zero?

You start with a basic solution which is degenerate, and then hit the problem of deciding which row to use for your pivot, since all the $b_i$ are zero.

Thanks for the help.

share|cite|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.