Basishäufigkeit bei linearen bestriktionen

DOI10.1080/02331937908842541zbMATH Open0403.90090OpenAlexW2060738446MaRDI QIDQ4189082FDOQ4189082

Authors:

Publication date: 1979

Published in: Mathematische Operationsforschung und Statistik. Series Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331937908842541

zbMATH Keywords

RedundancyProgramming in Conditions of UncertaintyQuadratic Submatrix

Mathematics Subject Classification ID

Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Markov and semi-Markov decision processes (90C40)

Cited In (1)

• The Average number of pivot steps required by the Simplex-Method is polynomial

This page was built for publication: Basishäufigkeit bei linearen bestriktionen

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