运筹学M.docVIP

Case of Revised Simplex Algorithm: The Reddy Mikks model The Reddy Mikks model (Section 2.1) is solved by the revised simplex algorithm. The same model was solved by the tableau method in Section 3.3.2. A comparison between the two methods will show that they are one and the same. The equation form of the Reddy Mikks model can be expressed in matrix form as Maximize subject to We use the notation to represent the objective function coefficients and to represent the column vectors of the constraint equations. The right-hand side of the constraints gives the vector b. In the computations below, we will give the algebraic formula for each step and its final numeric answer without detailing the arithmetic operations. You will find it instructive to fill in the gaps in each step. Iteration 0. , , Thus, , Optimality Computations: Thus, is the entering vector. Feasibility Computations: Hence, and becomes the leaving vector. The results above can be summarized in the familiar simplex tableau format. The presentation should help convince you that the two methods are essentially the same. Basic Solution -5 -4 0 0 0 0 0 6 24 1 6 -1 1 0 2 Iteration 1. , By using an appropriate inversion method (see Section A.2.6, in particular the product form method), the inverse is given as Thus, , Optimality Computations: Thus, is the entering vector. Feasibility Computations: Hence, and become the leaving vector. (You will find it helpful to summarize the results above in the simplex tableau format as we did in iteration 0.) Iteration 2. , Hence, Thus, , Optimality Computations: Thus, is optima