A note on probability assignments in estimating the time to solve linear programs

DOI10.1016/0893-9659(91)90171-QzbMath0721.60076OpenAlexW1964217514MaRDI QIDQ2641009

Bruce R. Feiring, C. R. Bector, Cheng, T. C. Edwin

Publication date: 1991

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(91)90171-q

zbMATH Keywords

linear programming algorithmstransitions between extreme points

Mathematics Subject Classification ID

Linear programming (90C05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Cites Work

• Unnamed Item
• A simple heuristic approach to simplex efficiency
• An approach to nonlinear programming

This page was built for publication: A note on probability assignments in estimating the time to solve linear programs