The Dual Algorithm
In section 2.4.1, for the standard form of the LP, it was shown that the dual feasibility and primal optimality conditions are identical and the primal reduced cost vector d is the same as the vector of dual logical variables. In case of CF-1 or CF-2 similar statements are true. This fact can be utilized to introduce some efficient dual algorithms.
KeywordsBreak Point Dual Objective Dual Algorithm Dual Constraint Nonbasic Variable
Unable to display preview. Download preview PDF.