Positivity

, Volume 10, Issue 4, pp 761–777 | Cite as

Farkas-type Results for Max-functions and Applications

Article
First Online:
Received:
Revised:
Accepted:

Abstract

We present some Farkas-type results for inequality systems involving finitely many convex constraints as well as convex max-functions. Therefore we use the dual of a minmax optimization problem. The main theorem and its consequences allows us to establish, as particular instances, some set containment characterizations and to rediscover two famous theorems of the alternative.

Mathematics Subject Classification (2000)

49N15 90C25 90C46 

Keywords

Duality Farkas-type results minmax programming set containment theorems of the alternative 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R.I. Boţ, S.M. Grad, G. Wanka, Fenchel-Lagrange versus geometric duality in convex optimization, J. Optimization Theory Appl., 129(1) (2006) (to appear).Google Scholar
  2. 2.
    R.I. Boţ, G. Kassay, G. Wanka, Strong duality for generalized convex optimization problems, J. Optimization Theory Appl., 127(1) (2005), 45–70.Google Scholar
  3. 3.
    R.I. Boţ, G. Wanka, Farkas type results with conjugate functions, SIAM J. Optim., 15(2) (2005), 540–554.Google Scholar
  4. 4.
    K.H. Elster, R. Reinhardt, M. Schäuble, G. Donath, Einführung in die Nichtlineare Optimierung, B. G. Teubner Verlag, Leipzig (1977).Google Scholar
  5. 5.
    J.B. Hiriart-Urruty, C. Lemaréchal, Convex analysis and minimization algorithms I, Springer Verlag, Berlin (1993).Google Scholar
  6. 6.
    J.B. Hiriart-Urruty, C. Lemaréchal, Convex analysis and minimization algorithms II, Springer Verlag, Berlin (1993).Google Scholar
  7. 7.
    V. Jeyakumar, Characterizing set containments involving infinite convex constraints and reverse-convex constraints, SIAM J. Optim., 13 (2003), 947–959.Google Scholar
  8. 8.
    O.L. Mangasarian, Nonlinear programming, McGraw-Hill Book Company, New York (1969).Google Scholar
  9. 9.
    O.L. Mangasarian, Set containment characterization, J. Glob. Optim., 24 (2002), 473–480.Google Scholar
  10. 10.
    R.T. Rockafellar, Convex analysis, Princeton University Press, Princeton (1970).Google Scholar
  11. 11.
    C.H. Scott, T.R. Jefferson, Duality for Minmax Programs, J. Math. Anal. Appl., 100 (1984), 385–393.Google Scholar
  12. 12.
    G. Wanka, R.I. Boţ, On the relations between different dual problems in convex mathematical programming, in: P. Chamoni, R. Leisten, A. Martin, J. Minnemann and H. Stadtler (eds), Operations Research Proceedings 2001, Springer Verlag, Berlin, 2002, pp. 255–262.Google Scholar

Copyright information

© Birkhäuser Verlag, Basel 2006

Authors and Affiliations

  1. 1.Faculty of MathematicsChemnitz University of TechnologyChemnitzGermany

Personalised recommendations