现代优化技术-靳志宏-附件1：传统优化技术
合集下载
相关主题
- 1、下载文档前请自行甄别文档内容的完整性，平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益，请联系客服反馈,我们会尽快为您处理(人工客服工作时间：9:00-18:30)。
Supplement 1
附件1：精确解技术
Linear Programming
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Sixth Edition © 2002 Prentice Hall, Inc. All rights reserved.
Stratton Company
Pipes ‘R Us
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Sixth Edition © 2002 Prentice Hall, Inc. All rights reserved.
Linear Programming
Step 2—Define the objective function
Max Z = x1 + x2
Example F.1
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Sixth Edition © 2002 Prentice Hall, Inc. All rights reserved.
Linear Programming
Step 2—Define the objective function
Max Z =
Example F.1
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Sixth Edition © 2002 Prentice Hall, Inc. All rights reserved.
Linear Programming
Step 2—Define the objective function
Max Z = x1 + x2
Example F.1
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Sixth Edition © 2002 Prentice Hall, Inc. All rights reserved.
Linear Programming
Step 2—Define the objective function
Basic Concepts
• Objective function • Decision variables • Constraints • Feasible region • Parameters • Linearity • Nonnegativity
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Sixth Edition © 2002 Prentice Hall, Inc. All rights reserved.
Linear Programming
Step 1–Define the decision variables
x1 = amount of type 1 pipe produced and sold next week, 100-foot increments
x2 = amount of type 2 pipe produced and sold next week, 100-foot increments
Linear Programming
Step 2—Define the objective function
Max Z = $34 x1 + $40 x2
Example F.1
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Sixth Edition © 2002 Prentice Hall, Inc. All rights reserved.
Example F.1
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Sixth Edition © 2002 Prentice Hall, Inc. All rights reserved.
How much of each type do I make?
Fra Baidu bibliotek
Type 1
Type 2
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Sixth Edition © 2002 Prentice Hall, Inc. All rights reserved.
Linear Programming
Step 2—Define the objective function
Example F.1
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Sixth Edition © 2002 Prentice Hall, Inc. All rights reserved.
Linear Programming
Step 2—Define the objective function
Max Z =
Example F.1
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Sixth Edition © 2002 Prentice Hall, Inc. All rights reserved.
附件1：精确解技术
Linear Programming
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Sixth Edition © 2002 Prentice Hall, Inc. All rights reserved.
Stratton Company
Pipes ‘R Us
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Sixth Edition © 2002 Prentice Hall, Inc. All rights reserved.
Linear Programming
Step 2—Define the objective function
Max Z = x1 + x2
Example F.1
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Sixth Edition © 2002 Prentice Hall, Inc. All rights reserved.
Linear Programming
Step 2—Define the objective function
Max Z =
Example F.1
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Sixth Edition © 2002 Prentice Hall, Inc. All rights reserved.
Linear Programming
Step 2—Define the objective function
Max Z = x1 + x2
Example F.1
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Sixth Edition © 2002 Prentice Hall, Inc. All rights reserved.
Linear Programming
Step 2—Define the objective function
Basic Concepts
• Objective function • Decision variables • Constraints • Feasible region • Parameters • Linearity • Nonnegativity
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Sixth Edition © 2002 Prentice Hall, Inc. All rights reserved.
Linear Programming
Step 1–Define the decision variables
x1 = amount of type 1 pipe produced and sold next week, 100-foot increments
x2 = amount of type 2 pipe produced and sold next week, 100-foot increments
Linear Programming
Step 2—Define the objective function
Max Z = $34 x1 + $40 x2
Example F.1
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Sixth Edition © 2002 Prentice Hall, Inc. All rights reserved.
Example F.1
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Sixth Edition © 2002 Prentice Hall, Inc. All rights reserved.
How much of each type do I make?
Fra Baidu bibliotek
Type 1
Type 2
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Sixth Edition © 2002 Prentice Hall, Inc. All rights reserved.
Linear Programming
Step 2—Define the objective function
Example F.1
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Sixth Edition © 2002 Prentice Hall, Inc. All rights reserved.
Linear Programming
Step 2—Define the objective function
Max Z =
Example F.1
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Sixth Edition © 2002 Prentice Hall, Inc. All rights reserved.