×

zbMATH — the first resource for mathematics

Optimality conditions for convex semi-infinite programming problems. (English) Zbl 0448.90045

MSC:
90C25 Convex programming
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Ben-Tal, Journal of Optimization Theory and Applications 20 pp 417– (1976)
[2] Charnes, Proceedings of the National Academy of Science 48 pp 783– (1962)
[3] Charnes, Naval Research Logistics Quarterly 16 pp 41– (1969) · Zbl 0169.22201
[4] Gehner, SIAM Journal on Control 12 pp 140– (1974)
[5] Gehner, Journal of Approximation Theory 14 pp 51– (1975) · Zbl 0297.41016
[6] and , ”Numerical Aspects of Pollution Abatement Problems: Constrained Generalized Moment Techniques,” Carnegie-Mellon University, School of Urban and Public Affairs, Institute of Physical Planning Research Report No. 12 (1970).
[7] Gustafson, Environment and Planning 4 pp 31– (1972)
[8] Gustafson, Naval Research Logistics Quarterly 20 pp 477– (1973)
[9] Gustafson, Geologiska Foreningens Forhandlingar 84 pp 372– (1962)
[10] Kantorovich, Dokl. Akad. Nauk. SSSR 115 pp 1058– (1957)
[11] Lehmann, Mathematical Programming 8 pp 332– (1975)
[12] Nonlinear Programming, McGraw Hill, New York (1969).
[13] ”Mathematical Programming and Approximation,” Approximation Theory, (editor), Academic Press (1970).
[14] Convex Analysis, Princeton University Press, Princeton, N.J. (1970). · Zbl 0932.90001
[15] Taylor, Journal on Numerical Analysis 5 pp 258– (1968)
[16] Zlobec, SIAM Journal on Applied Mathematics 21 pp 448– (1971)
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.