On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs
From MaRDI portal
Publication:6564294
DOI10.1016/J.ORL.2024.107091MaRDI QIDQ6564294
Xinyao Zhang, Jong-Shi Pang, Shaoning Han
Publication date: 1 July 2024
Published in: Operations Research Letters (Search for Journal in Brave)
linear complementarity problemslinear programsiteration complexitysimplex methodsconvex quadratic programsLeontief matrices
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm
- Hidden Z-matrices with positive principal minors
- How to compute least infeasible flows
- A simplex algorithm for a class of Leontief flow problems
- Gainfree Leontief substitution flow problems
- Computational study of a family of mixed-integer quadratic programming problems
- A bound for the number of different basic solutions generated by the simplex method
- Extreme points of Leontief substitution systems
- The simplex and policy-iteration methods are strongly polynomial for the Markov decision problem with a fixed discount rate
- On the simplex algorithm for networks and generalized networks
- A FAST ALGORITHM FOR SOLVING LARGE SCALE MEAN-VARIANCE MODELS BY COMPACT FACTORIZATION OF COVARIANCE MATRICES
- Linear complementarity problems solvable by A single linear program
- On solving linear complementarity problems as linear programs
- Simplicial methods for quadratic programming
- Some Strongly Polynomially Solvable Convex Quadratic Programs with Bounded Variables
This page was built for publication: On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564294)
