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

DOI10.1016/0893-9659(91)90171-QMaRDI QIDQ2641009zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming
• scientific article; zbMATH DE number 4156195
• An exterior point simplex algorithm for (general) linear programming problems
• scientific article; zbMATH DE number 4197740
• Probabilistic analysis of an infeasible-interior-point algorithm for linear programming

Cites work

• A simple heuristic approach to simplex efficiency
• An approach to nonlinear programming
• scientific article; zbMATH DE number 4056645 (Why is no real title available?)

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

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