scientific article; zbMATH DE number 4156195

MaRDI QIDQ3484622zbMATHFDO

Authors A. O. Alekseev, O. G. Alekseev, V. G. Anisimov, E. G. Anisimov, N. I. Yachkula

Publication date 1988

zbMATH Keywords

probabilistic approachsimplex methodfinite Markov chain

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Computational complexity of Markov chain Monte Carlo methods for finite Markov random fields
• scientific article; zbMATH DE number 1908189
• Computational Performance Bounds for Markov Chains With Applications
• scientific article; zbMATH DE number 653033
• Revised simplex algorithm for finite Markov decision processes
• The Complexity of Markov Decision Processes
• Complexity and approximability of the marking problem
• The complexity of the simplex method
• The simplex method is strongly polynomial for deterministic Markov decision processes

Cited in

(2)

• A note on probability assignments in estimating the time to solve linear programs
• A note on the distribution of the number of simplex iterations to optimality

This page was built for publication:

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