The simplex method in coordinate-free formulation

DOI10.1007/BF01072027MaRDI QIDQ3042872zbMATH OpenFDO

Authors L. E. Fajbusovich

Publication date 1983

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01072027

zbMATH Keywords

abstract vector spacescoordinate-free presentationE-pointsinfinite linear programminglinear formslinear operatorssimplex method

Mathematics Subject Classification ID

Linear programming (90C05) Programming in abstract spaces (90C48)

Cites work

• Some remarks on the infinite-dimensional problems of linear programming

Cited in

(2)

• Hamiltonian structure of dynamical systems which solve linear programming problems
• Simplex method and groups generated by reflections

This page was built for publication: The simplex method in coordinate-free formulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3042872)