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

Consider the following LP: \begin{align*} \max 8x_1 + 14x_2 + 12x_3 + 50x_4\\ \text{s. t. } x_1 + 2x_2 + 2x_3 + 16x_4 &\le 8\\ 2x_1 + 3x_2 + 4x_3 + 5x_4 &\le 15\\ 5x_1 + 6x_2 + 8x_3 + 10x_4 &\le 40\\ x_1, x_2, x_3, x_4 &\ge 0 \end{align*}

a) Is the solution $(x_1, x_2, x_3, x_4) = (1,3,0,0)$ feasible? basic?

b) Is the solution $(x_1, x_2, x_3, x_4) = (8,0,0,0)$ feasible? basic? degenerate?

So far, I have: (a) The solution is feasible because it satisfies all the three constraints. (b) The solution is not feasible because it does not satisfy the second constraint.

How do you know if the solutions are basic and degenerate?

share|cite|improve this question
up vote 0 down vote accepted

I will name the objective function eq-1.

I will name the constraints with ($\leq$) eq-2. I will name the constraints $x_{i} >= 0$ eq-3.

(a) Is the solution $(1,3,0,0)$ feasible? basic?

Feasibility is granted when eq-2 is satisfied.

A basic feasible solution must satisfy eq-2 and eq-3. Since both are satisfied in your case, (1,3,0,0) is a basic feasible solution.

(b) Hint: use the same definitions as in (a) above.

For all the other definitions in your question clearly stated, see this nice book (page 20 - Section 1.6): Operations Research for Management.

share|cite|improve this answer

Your Answer


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

Not the answer you're looking for? Browse other questions tagged or ask your own question.