zbMATH — the first resource for mathematics

Characterizing an optimal input in perturbed convex programming: Corrigendum. (English) Zbl 0606.90109
A necessary condition for a locally optimal input of convex mathematical programming models was recently stated in another paper of the author [ibid. 25, 109-121 (1983; Zbl 0505.90077)]. The purpose of this corrigendum is to show that the condition requires an input constraint qualification.

90C25 Convex programming
90C20 Quadratic programming
Full Text: DOI
[1] B. Bank, J. Guddat, D. Klatte, B. Kummer and K. Tammer,Nonlinear parametric optimization (Birkhäuser Verlag, 1983). · Zbl 0502.49002
[2] A. Ben-Israel, A. Ben-Tal and S. Zlobec,Optimality in nonlinear programming: A feasible directions approach (Wiley-Interscience, New York, 1981). · Zbl 0454.90043
[3] J. Semple and S. Zlobec, ”On the continuity of a Lagrangian multiplier function in input optimization”,Mathematical Programming (forthcoming). · Zbl 0599.49021
[4] S. Zlobec, ”Characterizing an optimal input in perturbed convex programming”,Mathematical Programming 25 (1983) 109–121. · Zbl 0505.90077 · doi:10.1007/BF02591721
[5] S. Zlobec, ”Input optimization: I. Optimal realizations of mathematical models”,Mathematical Programming 31 (1985) 245–268. · Zbl 0589.90068 · doi:10.1007/BF02591948
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.