one can directly read the current dual solution from the current simplex tableau and they are on the raw #0 of the tableau (T-F)

if the current Xj is a basic variable then its corresponding Zj-Cj entry on Column j must be Zero Reversely if the Zj-Cj entry on Column j =0 then, the corresponding Xj must currently be a basic variable with the value >0 (T-F)

The dual problem of the dual problem it has to be the original primal problem (T-F)

suppose we have less resource i then available if we are able to make more of the resource i available, would you expect total profit increase (T-F)

suppose we can increase the total profit by making resource i more available would you expect all of the resources i to be used up (T-F)

dual simplex method should always start with all reduce cost entries Zj-Cj >=0 and some RHS <0 (an infeasible solution) (T-F)

if the primal s solution is infeasible, it is corresponding dual problem will be infeasible for sure (T-F)

if the primal constraint is greater than or equal to constraint then the corresponding dual constraint in the dual problem will be a less than or equal to constraint (T-F)

Complementary slackness condition are primal variable times its corresponding dual constraint =o, dual variable times its corresponding primal constraint =0 (T-F)