Publication:3323698

zbMath0537.90067MaRDI QIDQ3323698

Vašek Chvátal

Publication date: 1983

zbMATH Keywords

perturbation techniques; sensitivity analysis; inventory; duality; Dantzig-Wolfe decomposition; systems of linear equations; cutting stock; triangular factorization; parametric linear programming; best approximate solution; speeds of convergence; Simplex Method; transshipment problems; convex polyhedral set of feasible points; cycling avoidance; ellipsoidal method; Generalized upper bounding; Khachiyan algorithm; maximum flow programs; primal- dual method; theorem on doubly stochastic matrices; Upper bound problems

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

65K05: Numerical mathematical programming methods

90C90: Applications of mathematical programming

90C05: Linear programming

91A05: 2-person games

90B35: Deterministic scheduling theory in operations research

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

90B10: Deterministic network models in operations research

90B05: Inventory, storage, reservoirs

65F10: Iterative numerical methods for linear systems

90-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming

15B51: Stochastic matrices

49-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control

Related Items

Column-Generation in Integer Linear Programming, Unnamed Item, Rigorous solution of linear programming problems with uncertain data, The interior-point revolution in optimization: History, recent developments, and lasting consequences, \(\ell^ 1\)-optimal control of multivariable systems with output norm constraints, The translation square map and approximate congruence, Quantitative Steinitz's theorems with applications to multifingered grasping, The maximum number of second smallest distances in finite planar sets, Maximum concurrent flows and minimum cuts, A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, A parametric successive underestimation method for convex multiplicative programming problems, Reasoning about qualitative temporal information, Discrete convex analysis, Degeneracy graphs: Theory and applications. An updated survey, Objects that cannot be taken apart with two hands, Simplices by point-sliding and the Yamnitsky-Levin algorithm, Heuristic and exact algorithms for the simultaneous assignment problem, An \(L_{1}\) estimation algorithm with degeneracy and linear constraints., On point-duration networks for temporal reasoning, Solving interval linear systems with linear programming techniques, Bounds for probabilistic integer programming problems, Non-linear evolution using optimal fourth-order strong-stability-preserving Runge-Kutta methods, Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations, The design of optimum component test plans in the demonstration of a series system reliability, Optimization of a long-short portfolio under nonconvex transaction cost, Unnamed Item