The simplex method - Matrix + 6 Dual theory

8 important questions on The simplex method - Matrix + 6 Dual theory

How can we interpret the optimal solution in matrix form?

                Xnb               Xbv           RHS

Xbv      B^-1*N             I                B^-1*b

Z      CbB^-1*N - Cn         O              CbB^-1*b

Xbv being vector of basic variables
Xnbv being vector of non basic variables
Cb being vector of coefficients in max function of BV
Cn being vector of coefficients in max function of NBV
Aj being column of variable i in start solution
B = matrix of a,j related to the BV
N = matrix of a,j related to the NBV
b = rhs of constraints

What is weak duality?

For a primal-dual pair, the objective function value of any feasible solution to the minimization problem is an upper bound on the objective function value of any feasible solution to the maximization problem

How do we proof weak duality?

Suppose x is feasible for P and w is feasible for D. Since x>= 0 and WA <= c, we have
wAx <= xc
Since w>=0 and Ax >= b, we have
wAx >= wb
which makes
cx >= wAx >= wb
Corollary 1: if x is feasible for P, w is feasible for D and cx = wb then x is an opimal solution for P and w is an optimal solution for D

from WDT we know that xc>=wb for any feasible for P. Since cx = wb, x is optimal for P, similary from WFT we know that xc >= wb for any w feasible for D. Since cx = wb
  • Higher grades + faster learning
  • Never study anything twice
  • 100% sure, 100% understanding
Discover Study Smart

Give proof: if P is unbounded then D is infeasible

This is the same as "if D is not infeasible then P cannot be unbounded" Suppose that D Is feasible and let w be a feasible solution for D. Then wb is a lower bound on the optimal value of P. So the optimal value of P cannot be arbitrarily small and P is not unbounded

Which relations can we make between primal and dual?

PRIMAL                       DUAL
Optimal                      Optimal
B optimal basis  <->  cbB^-1 is an optimal
unbounded         <-> infeasible
infeasible             <-> unbounded or infeasible

What can we say about type of constraint i and optimal value of the ith dual variable

<=      gives     row 0 coefficient of slack,i
>=      gives    -row 0 coefficient of surplus,i
=        gives     row 0 coefficient of artificial,i - M

What are the primal-dual pairs?

Primal | Dual
Min | Max
ith constraint >= | ith variable >= 0
ith constraint <= | ith variable <= 0
ith constraint = | ith variable = 0 
jth variable >= 0 | jtth constraint <=
jth variable <= 0 | jtth constraint >= 
jth variable free | jtth constraint =

What is complementary slackness?

If a variable in one LP is greater than zero, the corresponding constraint in the other LP is binding.
If a slack variable in one LP is greater than zero, the corresponding variable in the other LP is zero

If a variable in one LP equals zero, the corresponding constraint in the other LP is non-binding
If a slack variable in one LP equals zero, the corresponding variable in the other LP is greater than zero

The question on the page originate from the summary of the following study material:

  • A unique study and practice tool
  • Never study anything twice again
  • Get the grades you hope for
  • 100% sure, 100% understanding
Remember faster, study better. Scientifically proven.
Trustpilot Logo