Characterizing an optimal input in perturbed convex programming
- 1 January 1983
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 25 (1) , 109-121
- https://doi.org/10.1007/bf02591721
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Stabilization and determination of the set of minimal binding constraints in convex programming 1Mathematische Operationsforschung und Statistik. Series Optimization, 1981
- Duality in convex programming: a linearization approach 1Mathematische Operationsforschung und Statistik. Series Optimization, 1979
- A simplified test for optimalityJournal of Optimization Theory and Applications, 1978
- On Parametric Linear OptimizationPublished by Springer Nature ,1978
- Convex programming and the lexicographic multicriteria problemMathematische Operationsforschung und Statistik. Series Optimization, 1977
- Stability in convex quadratic parametric programmingMathematische Operationsforschung und Statistik, 1976
- Branching of Solutions of Nonlinear EquationsSIAM Review, 1971
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach SpaceSIAM Journal on Control, 1969
- On the continuity of the minimum set of a continuous functionJournal of Mathematical Analysis and Applications, 1967
- Marginal Values in Linear ProgrammingJournal of the Society for Industrial and Applied Mathematics, 1963