数学专业英语-Liear Programming0.docVIP

数学专业英语－Linear Programming Linear Programming is a relatively new branch of mathematics. The cornerstone of this exciting field was laid independently b Leonid V. Kantorovich, a Russian mathematician, and by Tjalling C,Koopmans, a Yale economist, and George Bernard. Dantzig, a Stanford mathematician. 线性规划是一个相对较新的数学分支。这一令人兴奋领域基石的奠定由俄罗斯的数学家列奥尼德·康托罗维奇佳林·库普曼斯斯坦福大学·(伯纳德·)丹齐格分别独立完成. Kantorovich’s pioneering work was motivated by a production-scheduling problem suggested by the Central Laboratory of the Leningrad Plywood Trust in the late 1930’s. 康托罗维奇 The development in the United States was influenced by the scientific need in World War II to solve logistic military problems, such as deploying aircraft and submarines at strategic positions and airlifting supplies and personnel.在第二次世界大战中，解决军事后勤问题的科学需要影响了线性规划在美国的发展，比如飞机和潜艇的战略部署以及物资和人员的空中运输。 The following is a typical linear programming problem:下面是一个典型的线性规划问题： A manufacturing company makes two types of television sets: one is black and white and the other is color. 一个生产制造企业生产两种电视机：一种是黑白的，一种是彩色的。The company has resources to make at most 300 sets a week.企业每周最多有300台的生产能力。 It takes $180 to make a black and white set and $270 to make a color set. 生产一台黑白电视机需要花费180美元，而生产一台彩色电视机需要花费270美元。 The company does not want to spend more than $64,800 a week to make television sets. 公司每周生产电视机的预算至多64，800美元。 If they make a profit of $170 per black and white set and $225 per color set, how many sets of each type should the company make to have a maximum profit? 如果生产一台黑白电视机的利润是170美元，彩色电视机是225美元，每种电视机生产多少台能使公司取得最大利润？ This problem is discussed in detail in Supplementary Reading Material Lesson 14.这个问题在补充读物十四课中有详细的讨论。 Since mathematical models in linear programming problems consist of linear inequalities, the next section is devoted to such inequalities.由于线性规划问题的数学模型由线性不等式构成，在下一节将致力于这些不等式的讨论。 Recall that the linear equation lx+my+n=0 represents a straight line in a plane. 回顾描述平面上一条直线的线性方程lx+my+n=0。Every solution (x,y) of the equation lx+my+n=0 is a p