The Dual Formulation of a Linear Programming Problem Has a Maximize

True/False

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.