The dual formulation of a linear programming problem has a maximize objective function, all $\leq$ constraints and non-negative variables, and a minimize objective function, all $\geq$ constraints and nonnegative decision variables.

Question

Quizplus · Accepted Answer

The dual of a linear programming problem with a minimize objective and $\geq$ constraints will have a maximize objective and $\leq$ constraints, with non-negative variables in both primal and dual.

The Dual Formulation of a Linear Programming Problem Has a Maximize