The dual price for a < constraint will
always be < 0.
always be > 0.
be < 0 in a minimization problem and > 0 in a maximization problem.
always equal 0.
The dual price for a < constraint will
always be < 0.
always be > 0.
be < 0 in a minimization problem and > 0 in a maximization problem.
always equal 0.
Leave a Reply