Consider the LP problem
minc^(T)x
subject to Ax=b
x>=0
with c=[[1],[1],[1]],A=[[1,-1,0],[0,0,1]] and b=[[0],[1]]. Let mu =1.
Show that
x=[[1],[1],[1]],p=[[0],[0]] and s=[[1],[1],[1]]
is a primal and dual feasible solution.
Let mu =1 and alpha =0.9. Perform 3 steps of the primal path following algorithm
starting from (12). Write down clearly the computation in each step.
1. Consider the LP problem
min cTx
subject to Ax= b x>0
with c =
and b
Let
Show that
(12)
is a primal and dual feasible solution.
Let = 1 and a = 0.9. Perform 3 steps of the primal path following algorithm starting from
