数学建模优化模型OptimizationModelling12.pdfVIP

12 Basic Optimization Techniques 12.1 Introduction The purpose of this book is to cover the basic modelling techniques of optimization problem solving, discuss the widely used theoretical optimiza- tion models and some practical optimization problems, and demonstrate the use of available software packages for optimization problem solving. Although the interpretation of solutions and sensitivity analysis are also provided with sufficient detail, an understanding of the basic optimization techniques would help to gain more insight about the problem solution space and the decision to be made. In addition, it will provide greater confidence of the quality of solutions to be obtained and decision to be made. With these views in mind, we present a few basic techniques briefly in this chapter as follows: . Graphical solution method for linear programming (LP) . Simplex method for LP . Branch-and-bound technique for integer programming 12.2 Graphical Method The graphical method is used to solve optimization models involving two variables and a few constraints, and the method helps to gain insights about the feasible solution space, optimality, and the interaction between different model parameters. The educational software Win QSB, discussed in Chapter 9, is capable of producing graphical solutions. In this section, we solve a small LP problem using Win QSB and then discuss how the method works. To demonstrate the method, let us consider an example. 2007 by Taylor Francis Group, LLC. Example 12.1: A simple example Consider Example 3.1 with different right-hand sides (RHSs) for the first two constraints (RHS1 ¼ 190 and RHS2 ¼ 180). Let us here define the deci- sion variables as follows: X1 ¼ the number of tables to be produced X2 ¼ the number of chairs to be produced The corresponding LP mo