Hostname: page-component-78c5997874-4rdpn Total loading time: 0 Render date: 2024-11-05T12:21:54.945Z Has data issue: false hasContentIssue false
  • English
  • Français

A multiplier rule in set-valued optimisation

Published online by Cambridge University Press:  17 April 2009

Akhtar A. Khan  and
Fabio Raciti
Akhtar A. Khan
Affiliation:
Institute of Applied Mathematics, University of Erlangen-Nürnberg, Martensstr. 3, 91058 Erlangen, Germany e-mail: [email protected]
Fabio Raciti
Affiliation:
Department Mathematics and Computer Science of University of Catania and Consorzio Ennese Universitario, V. le A. Doria, 6-95125 Catania, Italy e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A multiplier rule is given as a necessary optimality condition for proper minimality in set-valued optimisation. We use derivatives in the sense of the lower Dini derivative for the objective set-valued map and the set-valued maps defining the constraints.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 68 , Issue 1 , August 2003 , pp. 93 - 100
Copyright
Copyright © Australian Mathematical Society 2003

References

[1]Aubin, J.P. and Frankowska, H., Set valued analysis (Birkhäuser, Boston, 1990).Google Scholar
[2]Bigi, G. and Castellani, M., ‘K-epiderivatives for set-valued functions and optimization’, Math. Methods Oper. Res. 55 (2002), 401–412.CrossRefGoogle Scholar
[3]Chen, G.Y. and Jahn, J., ‘Optimality conditions for set-valued optimization problems’, Math. Methods Oper. Res. 48 (1998), 187–200.CrossRefGoogle Scholar
[4]Corley, H.W., ‘Optimality conditions for maximization of set-valued functions’, J. Optim. Theory Appl. 58 (1988), 1–10.CrossRefGoogle Scholar
[5]Craven, B.D., ‘Nonlinear programming in locally convex spaces’, J. Optim. Theory Appl. 10 (1972), 197–210.CrossRefGoogle Scholar
[6]Dubovitskii, A.Y. and Milyutin, A.A., ‘Extremal problems in presence of constraints’, Comp. Math. Math. Phys. 5 (1965), 395–453.Google Scholar
[7]Flores-Bazàn, F. Fabin, ‘Optimality conditions in non-convex set-valued optimization’, Math. Methods Oper. Res. 53 (2001), 403–417.CrossRefGoogle Scholar
[8]Götz, A. and Jahn, J., ‘The Lagrange multiplier rule in set-valued optimization’, SIAM J. Optim. 10 (1999), 331–344.CrossRefGoogle Scholar
[9]Halkin, H., ‘A satisfactory treatment of equality and operator constraints in the Dubovitskii-Milutin optimization formalism’, J. Optim. Theory Appl. 6 (1970), 138–149.CrossRefGoogle Scholar
[10]Jahn, J., Mathematical vector optimization in partially ordered linear spaces (Peter Lang, Frankfurt, 1986).Google Scholar
[11]Jahn, J. and Khan, A.A., ‘Generalized contingent epiderivatives in set-valued optimization’, Numer. Func. Anal. Optim. 27 (2002), 807–831.CrossRefGoogle Scholar
[12]Jahn, J. and Rauh, R., ‘Contingent epiderivatives and set-valued optimization’, Math. Methods Oper. Res. 46 (1997), 193–211.CrossRefGoogle Scholar
[13]Luc, D.T., Theory of vector optimization, Lecture Notes Econ. Math. Science 319 (Springer-Verlag, Berlin, Heidelberg, New York, 1988).Google Scholar
[14]Nagahisa, Y. and Sakawa, Y., ‘Nonlinear programming in normed spaces’, J. Optim. Theory Appl. 4 (1969), 182–190.CrossRefGoogle Scholar
[15]Penot, J.P., ‘Differentiability of relations and differential of perturbed optimization problems’, SIAM J. Control Optim. 22 (1984), 529–551.CrossRefGoogle Scholar
[16]Penot, J.P., ‘Variations on the theme of nonsmooth analysis: Another subdifferential’, in Nondifferentiable optimization, Lecture Notes Econom. Math. Systems 255, 1985, pp. 41–54.CrossRefGoogle Scholar
[17]Rigby, L., ‘Contribution to Dubovitskiy and Milyutin's optimization formalism’, in Optimization Techniques, Lecture Notes Computer Science 41, 1976, pp. 438–453.Google Scholar