Question

Without using a two-phase approach, the dual simplex algorithm can only be used under

certain circumstances. What are those circumstances, i.e., what properties must a linear

program satisfy so that the dual simplex algorithm can be used to find its optimal objective

function value without a two-phase approach

Answer 1

• Transpose the rows and columns of the constraint coefficient
• Transpose the coefficient of the objective function and the right side constants
• Change the inequalities from "$\leq$ " to "$\geq$ " sign
• Minimize the objective function instead of maximizing it