Understanding and using linear programming

DOI10.1007/978-3-540-30717-4zbMath1133.90001OpenAlexW287611495MaRDI QIDQ852298

Ji{ří} Matoušek, Bernd Gärtner

Publication date: 28 November 2006

Published in: Universitext (Search for Journal in Brave)

Full work available at URL: http://cds.cern.ch/record/1639324

zbMATH Keywords

linear programmingdualityapplicationssimplex algorithminterior point method

Mathematics Subject Classification ID

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

Related Items (39)

Discrete and metric divisorial gonality can be different ⋮ Equilibria for games with combined qualitative and quantitative objectives ⋮ Matrix sparsification and the sparse null space problem ⋮ Possibilities determine the combinatorial structure of probability polytopes ⋮ Absolute Lipschitz extendability and linear projection constants ⋮ On the realisability of double-cross matrices by polylines in the plane ⋮ Classes of linear programs solvable by coordinate-wise minimization ⋮ Sparse minimax portfolio and Sharpe ratio models ⋮ Inconsistency-tolerant reasoning over linear probabilistic knowledge bases ⋮ Combinatorial micro-macro dynamical systems ⋮ Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs ⋮ A branch and bound method solving the max–min linear discriminant analysis problem ⋮ Hitting a path: a generalization of weighted connectivity via game theory ⋮ Granular approximations: a novel statistical learning approach for handling data inconsistency with respect to a fuzzy relation ⋮ Fast and succinct population protocols for Presburger arithmetic ⋮ A Short Simple Proof of Closedness of Convex Cones and Farkas’ Lemma ⋮ An Epigraphical Approach to the Representer Theorem ⋮ Separators in Continuous Petri Nets ⋮ A characterization of the existence of succinct linear representation of subset-valuations ⋮ Formation of a nontrivial finite-time stable attractor in a class of polyhedral sweeping processes with periodic input ⋮ Positive Plücker tree certificates for non-realizability ⋮ Covering grids with multiplicity ⋮ Unnamed Item ⋮ Obtaining splits from cut sets of tight spans ⋮ Two-dimensional translation-invariant probability distributions: approximations, characterizations and no-go theorems ⋮ Security games on matroids ⋮ Nested convex bodies are chaseable ⋮ Intersecting families of permutations ⋮ Near-perfect clique-factors in sparse pseudorandom graphs ⋮ Subspace Acceleration for Large-Scale Parameter-Dependent Hermitian Eigenproblems ⋮ A variant of the Hadwiger-Debrunner \((p,q)\)-problem in the plane ⋮ A polynomial-time fragment of epistemic probabilistic argumentation ⋮ Random Projections for Linear Programming ⋮ Approximating high-dimensional dynamics by barycentric coordinates with linear programming ⋮ On Representer Theorems and Convex Regularization ⋮ Polynomial convolutions in max-plus algebra ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods ⋮ Homological filling functions with coefficients

This page was built for publication: Understanding and using linear programming