Article
Full entry |
PDF
(1.4 MB)
Feedback
PDF
(1.4 MB)
Feedback
Summary:
The paper presents a qualitative analysis of basic notions in parametric convex programming for convex programs with parameters in the objective function. These notions are the set of feasible parameters, the solvability set and the stability sets of the first and of the second kind. The functions encountered in the paper are assumed to possess first order partial continuous derivatives on $R^n$, the parameters assume arbitrary nonnegative real values and therefore the results obtained in the paper can be used for a wide class of convex programs.
Related articles:
References:
[1] Abadie J.: On the Kuhn-Tucker Theorem. in J. Abadie (edit) "Nonlinear Programming", pp. 21 - 36, North Holland Publishing Company, Amsterdam, 1967. MR 0218116 | Zbl 0183.22803
[2] Dieudonne J.: Foundations of modern analysis. New York: Academic Press 1960. MR 0120319 | Zbl 0100.04201
[3] Mangasarian O. L.: Nonlinear Programming. McGraw-Hill, Inc., New York, London, 1969. MR 0252038 | Zbl 0194.20201
[4] Osman M. S. A.: Qualitative analysis of basic notions in parametric convex programming I (parameters in the constraints). Apl. mat. (to appear). MR 0449692
[5] Rockafellar R. T.: Convex Analysis. Princeton, Princeton University Press, 1969. MR 1451876
[6] Stoer J., Witzgall Ch.: Convexity and Optimization in finite Dimensions I. Berlin, Heidelberg, New York, 1970. MR 0286498
Search
Partner of
