Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
Chapter 7 "Integer programming", after completing this chapter, you should be able to: Tell how integer programming problems differ from general linear programming problems; explain the difference among pure, mixed, and 0–1 integer programming problems; formulate and use Excel to solve integer programming problems;. | Chapter 7 Integer Programming Part 2 Deterministic Decision Models Learning Objectives Tell how integer programming problems differ from general linear programming problems. Explain the difference among pure, mixed, and 0–1 integer programming problems. Formulate and use Excel to solve integer programming problems. Formulate and use Excel to solve 0–1 integer programming problems. Formulate specialized integer programming problems including knapsack, set covering, fixed charge, and facility location problems. After completing this chapter, you should be able to: McGraw-Hill/Irwin 7– Types of Integer Programming Problems Pure-Integer Problems require that all decision variables have integer solutions. Mixed-Integer Problems Require some, but not all, of the decision variables to have integer values in the final solution, whereas others need not have integer values. 0–1 Integer Problems Require integer variables to have value of 0 or 1, such as situations in which decision variables are of the yes-no type. McGraw-Hill/Irwin 7– Figure 7–1 Graph of an Integer Programming Problem McGraw-Hill/Irwin 7– Example 7-1 McGraw-Hill/Irwin 7– Example 7-1 (cont’d) McGraw-Hill/Irwin 7– Exhibit 7-1 Input and Output Worksheet for the Boat-Manufacturing Example McGraw-Hill/Irwin 7– Exhibit 7-2 Solver Parameters Screen for the Boat-Manufacturing Problem McGraw-Hill/Irwin 7– Exhibit 7–3 Integer Requirement Specification Exhibit 7–4 Solver Results Screen McGraw-Hill/Irwin 7– Exhibit 7–4 Solver Results Screen McGraw-Hill/Irwin 7– Integer Programming Problems and Sensitivity Analysis Integer programming problems do not readily lend themselves to sensitivity analysis as only a relatively few of the infinite solution possibilities in a feasible solution space will meet integer requirements. Trial-and-error examination of a range of reasonable alternatives involving completely solving each revised problem is required. McGraw-Hill/Irwin 7– Formulating . | Chapter 7 Integer Programming Part 2 Deterministic Decision Models Learning Objectives Tell how integer programming problems differ from general linear programming problems. Explain the difference among pure, mixed, and 0–1 integer programming problems. Formulate and use Excel to solve integer programming problems. Formulate and use Excel to solve 0–1 integer programming problems. Formulate specialized integer programming problems including knapsack, set covering, fixed charge, and facility location problems. After completing this chapter, you should be able to: McGraw-Hill/Irwin 7– Types of Integer Programming Problems Pure-Integer Problems require that all decision variables have integer solutions. Mixed-Integer Problems Require some, but not all, of the decision variables to have integer values in the final solution, whereas others need not have integer values. 0–1 Integer Problems Require integer variables to have value of 0 or 1, such as situations in which decision variables
