Least distance methods for the scheme of polytopes
- 1 December 1978
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 15 (1), 1-11
- https://doi.org/10.1007/bf01608995
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Stability of the bromate–cerium–malonic acid network. I. Theoretical formulationThe Journal of Chemical Physics, 1976
- A finite algorithm to maximize certain pseudoconcave functions on polytopesMathematical Programming, 1975
- Generating All the Faces of a PolyhedronSIAM Journal on Applied Mathematics, 1974
- An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear InequalitiesOperations Research, 1973
- An Algorithm for Convex PolytopesJournal of the ACM, 1970
- Finding all vertices of a convex polyhedronNumerische Mathematik, 1968
- Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming ProblemsManagement Science, 1966
- Estimating Efficient Production Functions under Increasing Returns to ScaleJournal of the Royal Statistical Society. Series A (General), 1962
- An Algorithm for Finding All Vertices of Convex Polyhedral SetsJournal of the Society for Industrial and Applied Mathematics, 1961
- Optimality and Degeneracy in Linear ProgrammingEconometrica, 1952