Type Min (Max) linear programming problem is how to pursue the minimization (maximization) of problem under a condition with limited resources. Examples with type Max have been adopted to present the solutions of linear programming problems for scholars in majority of textbooks;but how about the solutions of type Min linear programming problems? Grounded on the type Max solutions, solutions of type Min problems will be figured out in the following essay, which aims at offering scholars a better distinction and clearer recognization of solutions for different linear programming problems.%min型（max型）线性规划问题就是如何在有限的资源条件下，追求最小化（最大化）的问题。大量教材中多以max型为例向学者展示了线性规划问题的求解。如何求解min型线性规划问题？文章在给出max型解法的基础上，给出了min型问题的解法，帮助学者更好的区分和认识不同类型线性规划问题的求解。
展开▼
