scientific article; zbMATH DE number 3920182
In the words of the authors ...(the) presentation is new in that it is based on a direct generalization of this geometric notion. The geometric notion is: if an extreme point of the feasible region is not optimal, then we can move along an edge of the feasible region to an adjacent extreme point with a better value of the objective function. The presentation of the authors is refreshing from several points of view. The orientation of the material is toward a realistic implementation of the algorithms. It does not rely on the usual hand manipulation of simplex tableaus. In fact, the simplex method is not discussed in detail until Chapter 4 and then it is introduced in the revised simplex form. The text provides FORTRAN codes for all of the algorithms. During the period of the review, I did not have time to test the codes. The book is suitable as an introduction to linear programming at either the undergraduate or graduate level. It requires knowledge of linear and matrix algebra, and relies almost exclusively on matrix algebra notation for the presentation of results. On the negative side, the chapter on Applications could have been done in a more complete fashion. While it presents some interesting applications, it does not give an idea of the wide range of problems or the size of problems that can be handled. The codes are given in FORTRAN 77; particularly in the microcomputing area, PASCAL may have been more appropriate. The more sophisticated the student, the more useful the presentation. Each chapter concludes with plenty of exercises, ranging from computational to theoretical. The book focuses on LP and does not include closely related topics such as networks and decomposition. The text is certainly recommended for anyone wanting to study linear programming from a realistic implementation point of view. The contents of the book are: Ch. 1: Geometric Examples - An introduction to the geometric interpretation of extreme points, cones, edges, and how these come together in solving linear programs. Ch. 2: Basic LP Solution Algorithms - The basic algorithm is defined. It is based on the result that a point \(x^*\) is optimal if -c lies in a certain cone. Ch. 3: Theory - Formulates this condition for a general problem and proves that it is necessary and sufficient for optimality. This chapter also introduces duality, alternate optimal solutions, and sensitivity analysis. Ch. 4: The Simplex Method - Introduces the simplex method of linear programming using the revised simplex form. This introduction incorporates Bland's anti-cycling rules. Also the authors show the equivalence of the algorithms of Ch. 2 and 3 with the revised simplex algorithm. The chapter concludes with a section which compares the computational aspects of these approaches. Ch. 5: Parametric Linear Programming - This chapter presents the parametric program minimize \(\{(c+tq)^ Tx:\) \(Ax\leq (b+tp)\}\) from the point of view of the approach of Ch. 2. Ch. 6: Dual Methods - Presents the dual approach, including dual simplex. Ch. 7: Upper Bounding Techniques - Presents a modified revised simplex method for problems with bounded variables and with generalized upper bounds. Ch. 8: Applications - Presents five applications of linear programming: the diet problem, engineering design, pattern recognition, graduation of actuarial data, and input-output models. Appendices: The text concludes with FORTRAN 77 listings of all of the algorithms presented in the text.
- Lagrangian dual ascent by generalized linear programming
- A scheduling model for the daily operation of an electric power system
- LP relaxation of the two dimensional knapsack problem with box and GUB constraints
- Reducing the number of linear programs needed for solving the nucleolus problem of n-person game theory
- New descent rules for solving the linear semi-infinite programming problem
- Comments on An efficient search direction for linear programming problems by H. Luh and R. Tsaih.
- An \(L_{1}\) estimation algorithm with degeneracy and linear constraints.
- Linear programming, complexity. Separation and optimization.
- Lower bound shakedown analysis of layered pavements using discontinuous stress fields
- Recovering an optimal LP basis from an optimal dual solution
- An algorithm for portfolio optimization with variable transaction costs. II: Computational analysis
- Reliable computation of minimum-time motions for manipulators moving in obstacle fields using a successive search for minimum-overload trajectories
- A quadratic programming algorithm
- A finite cutting plane method for facial disjunctive programs
- New purification algorithms for linear programming
- scientific article; zbMATH DE number 4126605 (Why is no real title available?)
- scientific article; zbMATH DE number 757651 (Why is no real title available?)
- The steepest descent gravitational method for linear programming
- Numerical algorithms for estimation and calculation of parameters in modeling pest population dynamics and evolution of resistance
- Degeneracy resolution for bilinear utility functions
- A priori stability conditions for an arbitrary number of unstable poles
- Active set algorithms for isotonic regression; a unifying framework
- Bounded isotonic median regression
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3694971)