Consider the standard primal linear programming problem:
where The standard dual linear programming problem is
Find vectors $$b = [b_1, b_2], c = [c_1, c_2]$$ such that both the primal and dual are infeasible. Note: -
\(c\) **is a row vector**. I think the rest are column vectors. -
\(x \ge 0\) means \(x_i \ge 0\)
I tried using $$b = [-1 -1], c = -b$$ but this seems too simple. Is it right? Wrong? Why? I happened noticed that we need to have $$-b_2 \le x_1 - x_2 \le b_1$$ and $$-c_2 \le y_1 - y_2 \le c_1$$ Must it be then that $$-b_2 \le b_1, -c_2 \le c_1$$ ? In that case, it doesn't seem like $b = [-1, -1], c= -b$ satisfy those inequalities Please suggest what I can use instead, or please explain why I am correct.
asked
BCLC |