A Variable-Complexity Norm Maximization Problem
- 1 July 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 7 (3) , 455-461
- https://doi.org/10.1137/0607052
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Simple computable bounds for solutions of linear complementarity problems and linear programsPublished by Springer Nature ,1985
- Characterizations of bounded solutions of linear complementarity problemsPublished by Springer Nature ,1982
- Khachiyan’s algorithm for linear programmingPublished by Springer Nature ,1981
- A Characterization of Stability in Linear ProgrammingOperations Research, 1977
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970
- Boundedness relations for linear constraint setsLinear Algebra and its Applications, 1970
- Complementarity Theorems for Linear ProgrammingSIAM Review, 1970
- Complementary pivot theory of mathematical programmingLinear Algebra and its Applications, 1968
- Linear Programming and ExtensionsPublished by Walter de Gruyter GmbH ,1963
- Marginal Values in Linear ProgrammingJournal of the Society for Industrial and Applied Mathematics, 1963