Linear programming. II: Theory and extensions
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Stochastic programming (90C15) Optimality conditions and duality in mathematical programming (90C46) Interior-point methods (90C51)
This book is the second volume of ``Linear Programming by \textit{G. B. Dantzig} and \textit{M. N. Thapa} [for a review of Vol. 1 (1997) see Zbl 0883.90090]. As the authors state in the preface, it ``\dots continues where Linear Programming 1 left off \dots we prove all theorems stated and those that were sketched but not proved in Linear Programming 1, and we describe various extensions -- a very true statement. The content of the book is about equally split between Linear Programming theory and extensions. The first six chapters cover essential linear programming material: geometry of the Simplex Method, duality, interior point methods, degeneracy and variants of the simplex algorithm (including dual and primal-dual algorithms as well as parametric linear programming). Chapters 7 to 12 form the ``extensions part of the book and cover special cases of linear programming (the transportation problem and network flow theory), generalized upper bounds, decomposition (Dantzig-Wolfe and Benders) and (two-stage) stochastic programming. An appendix on probability theory is provided as background for Chapter 12. The book is an essential companion to the first volume, especially if used as a textbook in mathematically oriented optimization courses. As a textbook, the numerous examples and illustrations, especially worked examples of the application of algorithms, are very useful to convey the necessary intuition about the mathematical concepts. Most topics are introduced with small examples or easy special cases so that a student reader will hardly be overwhelmed by theoretical subject matter. Each chapter is followed by an extensive list of problems ranging from very basic to rather hard and challenging (some are taken from past PhD exams at Stanford). The book is also a good reference volume on linear programming. In this regard the extensive reference list of 59 pages is very helpful. However, one might find the index a bit disappointing for a reference book -- it is good as author index but somewhat lacking as subject index.
- An overview on the simplex algorithm
- Risk optimization with p-order conic constraints: a linear programming approach
- A chance constrained approach to fractional programming with random numerator
- Linear programming: foundations and extensions
- A strongly polynomial contraction-expansion algorithm for network flow problems
- Convergence conditions for the observed mean method in stochastic programming
- Sliding-MOMP based channel estimation scheme for ISDB-T systems
- Fuel and energy system control at large-scale damages. II: Optimization problems
- A simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumption
- Non-Archimedean zero-sum games
- Relationship of two formulations for shortest bibranchings
- Fuzzy best-worst method based on triangular fuzzy numbers for multi-criteria decision-making
- The algorithmic numbers in non-Archimedean numerical computing environments
- The minimum mean cycle-canceling algorithm for linear programs
- Minimum \(t\)-spanners on subcubic graphs
- Duality of graph invariants
- Modeling tau transport in the axon initial segment
- The big-M method with the numerical infinite M
- A novel approach for solving rough multi-objective transportation problem: development and prospects
- Measurement of returns to scale using non-radial DEA models
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
- A radial boundary intersection aided interior point method for multi-objective optimization
- Polynomial-time computation of exact correlated equilibrium in compact games
- Dispatch planning using newsvendor dual problems and occupation times: application to hydropower
- Measurement of returns to scale in radial DEA models
- Flyspeck II: The basic linear programs
- Evaluating green suppliers: improving supplier performance with DEA in the presence of incomplete data
- A BSSS algorithm for the single facility location problem in two regions with different norms
- George B. Dantzig: a legendary life in mathematical programming
- Concave programming for finding sparse solutions to problems with convex constraints
- scientific article; zbMATH DE number 2132174 (Why is no real title available?)
- Algebraic simplex initialization combined with the nonfeasible basis method
- An embarrassingly parallel method for large-scale stochastic programs
- Production Dependent Agricultural 3D Transportation Problem with Maximization of Annual Net Profit in Generalized Intuitionistic Fuzzy Environment
- New characterizations for largeness of the core
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- Measurement of returns to scale using a non-radial DEA model
- scientific article; zbMATH DE number 1240224 (Why is no real title available?)
- scientific article; zbMATH DE number 2061763 (Why is no real title available?)
- A constructive way to compute the Tarski number of a group
- Using dual presolving reductions to reformulate cumulative constraints
- New computations of the superbridge index
- Vector Space Decomposition for Solving Large-Scale Linear Programs
- New superbridge index calculations from non-minimal realizations
- Network equilibrium of production, transportation and pricing for multi-product multi-market
- Relational linear programming
- Classical logic, classical probability, and quantum mechanics
- Combinatorial optimization: the interplay of graph theory, linear and integer programming illustrated on network flow
- Convergence and Correctness of Max-Product Belief Propagation for Linear Programming
- The support feature machine: classification with the least number of features and application to neuroimaging data
- Letter to the Editor—A Supplementary Bibliography on Linear Programming
- On configuration graph and paradoxical decomposition
- Finding complex balanced and detailed balanced realizations of chemical reaction networks
- Greatest remainder bi-proportional rounding and the Greek parliamentary elections of 2007
- Bayesian quantile regression for longitudinal count data
- scientific article; zbMATH DE number 7677761 (Why is no real title available?)
- Linear programming. Foundations and extensions
- Fuzzy best-worst method based on generalized interval-valued trapezoidal fuzzy numbers for multi-criteria decision-making
- Virtual displacement based discontinuity layout optimization
- On solving fully rough multi-objective fractional transportation problem: development and prospects
- Anisotropic mesh adaptation for high-order finite elements spaces with the log-simplex method. Application to discontinuous Galerkin methods
- Discrete Optimal Transport with Independent Marginals is #P-Hard
- Finite convergence into a convex polytope via facet reflections.
- Quantum-inspired probabilistic database corruption detection
- Scheduling analysis and correction for dependent real-time tasks upon heterogeneous multiprocessor architectures
- Sufficient control of complex networks
- Fuzzy linear programming approach for solving fuzzy transportation problems with transshipment
- Polynomial algorithms for sparse spanners on subcubic graphs
- Characterization of generic parameter families of constraint mappings in optimization
- Enhancing crop strategies with linear programming: leveraging historical constraint for optimal decision-making
- Surface movement method for linear programming
- Linear programming with infinite, finite, and infinitesimal values in the right-hand side
- Nonparametric testing of first-order structure in point processes on linear networks
- On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes
- Artificial intelligence for optimization: unleashing the potential of parameter generation, model formulation, and solution methods
- Polynomial algorithm for the disjoint bilinear programming problem with an acute-angled polytope for a disjoint subset
- Verified Linear Programming through Tolerance-Aware Precision Boosting
- Automated edge grid generation based on arc-length optimization
- Characterizing the universal rigidity of generic frameworks
- On Hoffman's celebrated cycling LP example
This page was built for publication: Linear programming. II: Theory and extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4421881)
