| 释义 |
standard form (of a linear programming problem) Where the objective function ∑aixi is to be maximized, and all constraints other than the non-negativity conditions can be rewritten in the form ∑bj xj ≤ cj. If the objective function is to be minimized, then the problem can be converted to standard form by making the objective function −∑aixi and maximizing this, with the proviso that the optimal solution must be multiplied by −1 at the end. Linear programming problems in standard form can be solved by the simplex method.
|