《现代优化技术-靳志宏》附件1：传统优化技术.PPTVIP

21 The decision variables are added at this point. Because both variables participate in all three constraint equations in this example, beginning students have been known to think this is always the case. By making the decision variables a step of their own and not ‘automatic’, the student should consider each variable for each constraint. Again the arrow will disappear automatically. 22 23 Finally the coefficients are added to the equation. Again the arrow will disappear automatically. 24 25 The remaining two constraint equations are added to the slide. While the authors correctly stress the nonnegativity equations, these have been left off the slide for design and legibility reasons. The equations are replaced with the coordinate system for the graphical solution to the problem. The first constrain to be graphed is the extrusion limit. Drawing on the example, the two axis intercepts are plotted. The line representing the equation is added to the graph. The remaining two equations are plotted in exactly the same fashion, and this series of slides runs automatically. 35 The authors discuss the rules for identifying the feasible space and provide this example of the application of the rules. This sequence of slides runs automatically until the graph is complete. 36 37 38 39 40 41 42 The first plot of the objective function (iso-profit line) is added to the graph. The next three slides complete the process of finding the optimal solution. Though not shown in the text, this slide shows a second attempt at the iso-profit line passing through point B and moving closer to the optimal point but not yet there. I have found this is helpful for students because it more accurately mimics the actual solution process of evaluating a series of corner points (in this case B) until no improvement is possible. This slide advances automatically. Linear Programming Sensitivity analysis 18 — 16 — 14 — 12 — 10 — 8 — 6 — 4 — 2 — 0 | | | | | | | | | 2 4 6 8 10 12 14 16 18 x1 4