Skip to main content
Log in

Generalized Farkas' theorem and optimization of infinitely constrained problems

  • Technical Note
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

This note is concerned with the generalization of Farkas' theorem of the alternative and its application to derive the necessary optimality conditions for min-max problems with satisfaction conditions. Farkas' theorem is generalized to a system of linear inequalities with max operations. The problems studied require a solution at which the worst objective value attains its minimum over a set of solutions fulfilling satisfaction conditions. The satisfaction conditions claim that plural performance criteria should be kept below the permissible level, whatever disturbances may happen or whatever opponents' decisions may be taken. We present a generalized Farkas' theorem in order to derive the necessary optimality conditions for the problems of this class.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Mangasarian, O. L.,Nonlinear Programming, McGraw-Hill Book Company, New York, New York, 1969.

    Google Scholar 

  2. Shimizu, K.,Systems Optimization Theory, Corona Publishing, Tokyo, Japan, 1976.

    Google Scholar 

  3. Gehner, K. R.,Necessary and Sufficient Optimality Conditions for the Fritz John Problem with Linear Equality Constraints, SIAM Journal on Control, Vol. 12, No. 1, 1974.

  4. Schmitendorf, W. E.,Necessary Conditions and Sufficient Conditions for Static Min-Max Problems, Journal of Mathematical Analysis and Applications, Vol. 57, No. 3, 1977.

  5. Shimizu, K., andAiyoshi, E.,A Theory and Algorithms for an Optimization Satisfaction Problem under Uncertainty, Institute of Electronics and Communication Engineers of Japan, Transactions, Vol. 62-A, No. 5, 1979.

  6. Shimizu, K., andAiyoshi, E.,Necessary Conditions for Min-Max Problems and Algorithms by a Relaxation Procedure, IEEE Transactions on Automatic Control, Vol. AC-25, No. 1, 1980.

  7. Danskin, J. M.,The Theory of Min-Max, with Applications, SIAM Journal on Applied Mathematics, Vol. 14, No. 4, 1966.

  8. Blankenship, J. W., andFalk, J. E.,Infinitely Constrained Optimization Problems, Journal of Optimization Theory and Applications, Vol. 19, No. 2, 1976.

  9. Bracken, J., andMcGill, J. T.,Defense Applications of Mathematical Programs with Optimization Problems in the Constraints, Operations Research, Vol. 22, No. 5, 1974.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by G. Leitmann

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shimizu, K., Aiyoshi, E. & Katayama, R. Generalized Farkas' theorem and optimization of infinitely constrained problems. J Optim Theory Appl 40, 451–462 (1983). https://doi.org/10.1007/BF00933510

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00933510

Key Words

Navigation