The book also addresses linear programming duality theory and its use in algorithm design as well as the Dual Simplex Method, Dantzig-Wolfe decomposition, and a primal-dual interior point algorithm.

Studies linear and nonlinear programming, the simplex method, duality, sensitivity, transportation and network flow problems, some constrained and unconstrained optimization theory, and the ...

The branch-and-bound method with the revised dual simplex for bounded variables is very effective in solving relatively large-size integer linear programming problems. This paper, based on the general ...

Introduction to mathematical optimization and its applications, linear optimization models, Simplex Algorithm, sensitivity analysis, mixed-integer optimization models, branch-and-bound algorithm, ...

Ilbin Lee, Marina A. Epelman, H. Edwin Romeijn, Robert L. Smith, Simplex Algorithm for Countable-State Discounted Markov Decision Processes, Operations Research, Vol ...