Understanding and using linear programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 195106
- scientific article; zbMATH DE number 1823659
- scientific article; zbMATH DE number 757651
- scientific article; zbMATH DE number 1168999
- scientific article; zbMATH DE number 3854804
- scientific article; zbMATH DE number 50649
- scientific article; zbMATH DE number 1260455
- scientific article; zbMATH DE number 5809298
- Linear programming
- scientific article; zbMATH DE number 1786124
Cited in
(59)- Nested convex bodies are chaseable
- An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods
- Homological filling functions with coefficients
- Discrete and metric divisorial gonality can be different
- Classes of linear programs solvable by coordinate-wise minimization
- Sparse minimax portfolio and Sharpe ratio models
- Combinatorial micro-macro dynamical systems
- A polynomial-time fragment of epistemic probabilistic argumentation
- Polynomial convolutions in max-plus algebra
- On the realisability of double-cross matrices by polylines in the plane
- Inconsistency-tolerant reasoning over linear probabilistic knowledge bases
- Hitting a path: a generalization of weighted connectivity via game theory
- Obtaining splits from cut sets of tight spans
- Subspace acceleration for large-scale parameter-dependent Hermitian eigenproblems
- Approximating high-dimensional dynamics by barycentric coordinates with linear programming
- Possibilities determine the combinatorial structure of probability polytopes
- Two-dimensional translation-invariant probability distributions: approximations, characterizations and no-go theorems
- An Epigraphical Approach to the Representer Theorem
- Security games on matroids
- Absolute Lipschitz extendability and linear projection constants
- Random projections for linear programming
- On representer theorems and convex regularization
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Near-perfect clique-factors in sparse pseudorandom graphs
- Intersecting families of permutations
- 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
- Granular approximations: a novel statistical learning approach for handling data inconsistency with respect to a fuzzy relation
- scientific article; zbMATH DE number 7733446 (Why is no real title available?)
- Fast and succinct population protocols for Presburger arithmetic
- A Short Simple Proof of Closedness of Convex Cones and Farkas’ Lemma
- 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
- MDPs as distribution transformers: affine invariant synthesis for safety objectives
- Drawing from an urn is isometric
- Numerical conformal bootstrap with analytic functionals and outer approximation
- The \textsc{Exact Subset MultiCover} problem
- Propositional logics for the Lawvere quantale
- On the integration of Dantzig-Wolfe and Fenchel decompositions via directional normalizations
- Online bipartite matching in the probe-commit model
- Efficient certifying algorithms for linear classification
- Join and subgraph sampling under degree constraints
- On a solution of the multidimensional truncated moment problem on vertices of the hypercube based on Bell inequalities
- Genetic column generation for computing lower bounds for adversarial classification
- Binary stretch embedding of weighted graphs
- Robust two-stage optimization consensus models with uncertain costs
- Drawing with distance
- Linear programming with infinite, finite, and infinitesimal values in the right-hand side
- Optimal linear sofic approximations of countable groups
- Extending choice assessments to choice functions: an algorithm for computing the natural extension
- Lockean beliefs, Dutch books, and scoring systems
- Optimizing alphabet reduction pairs of arrays
- Verified Linear Programming through Tolerance-Aware Precision Boosting
- Fair and efficient allocation of indivisible items under category constraints
- A variant of the Hadwiger-Debrunner (p,q)-problem in the plane
- Equilibria for games with combined qualitative and quantitative objectives
This page was built for publication: Understanding and using linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q852298)
