Fourier's Method of Linear Programming and Its Dual

DOI10.2307/2322281zbMath0618.90065OpenAlexW4244671708WikidataQ29393284 ScholiaQ29393284MaRDI QIDQ3755233

H. Paul Williams

Publication date: 1986

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: http://www.maa.org/pubs/monthly.html

zbMATH Keywords

Fourier's elimination

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (29)

Formulae for theL₀,L₁andL_∞Norms ⋮ Evolution, games theory and polyhedra ⋮ An algorithm to compute the minimal siphons in \(S^4 PR\) nets ⋮ Solution of parametrized linear inequalities by Fourier elimination and its applications ⋮ A linear programming primer: from Fourier to Karmarkar ⋮ Logic applied to integer programming and integer programming applied to logic ⋮ A bi-directional extensible interface between Lean and Mathematica ⋮ An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem ⋮ Symbolic analysis of linear hybrid automata -- 25 years later ⋮ Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications ⋮ Polynomial Bell Inequalities ⋮ The entropic approach to causal correlations ⋮ A utility-valued logic for decision making ⋮ Consistency conditions for the influence graphs generalized finite difference method ⋮ Two-dimensional translation-invariant probability distributions: approximations, characterizations and no-go theorems ⋮ Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling ⋮ Unnamed Item ⋮ Causal structures from entropic information: geometry and novel scenarios ⋮ Modified Fourier's method of solving linear programming problems. ⋮ Analysing causal structures with entropy ⋮ Integer programming as projection ⋮ On Fourier's algorithm for linear arithmetic constraints ⋮ Classical numerical methods in engineering: a note on existential quantifier elimination under parametric inequality constraints ⋮ Extendability and von neuman-morgenstern stability of the core ⋮ Calculation of bounds on variables satisfying nonlinear inequality constraints ⋮ A new framework for the solution of DEA models ⋮ Extending the mixed algebraic-analysis Fourier–Motzkin elimination method for classifying linear semi-infinite programmes ⋮ The splitting of variables and constraints in the formulation of integer programming models ⋮ Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming

This page was built for publication: Fourier's Method of Linear Programming and Its Dual