On the asymptotic average number of efficient vertices in multiple objective linear programming
From MaRDI portal
Publication:1273733
DOI10.1006/jcom.1998.0480zbMath0914.90231OpenAlexW2093894930MaRDI QIDQ1273733
Publication date: 23 June 1999
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.1998.0480
Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic analysis of optimization algorithms - some aspects from a practical point of view
- Linear multiobjective programming
- A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
- The Average number of pivot steps required by the Simplex-Method is polynomial
- Random polytopes: Their definition, generation and aggregate properties
- Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method
- On the variance of the number of pivot steps required by the simplex algorithm
- [https://portal.mardi4nfdi.de/wiki/Publication:5588965 Die konvexe H�lle von n rotationssymmetrisch verteilten Punkten]
- [https://portal.mardi4nfdi.de/wiki/Publication:5728818 �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten]