问题求解 2019Spring
4.1线性规划
In linear programming, we do not allow strict inequalities.
minimization linear program and maximization program
The simplex algorithm does not run in polynomial time in the worst case, but it is fairly efficient and widely used in practice.
We use two forms, standard and slack.
Informally, a linear program in standard form is the maximization of a linear function subject to linear inequalities, whereas a linear program in slack form is the maximization of a linear function subject to linear equalities.
more >>