Mathematical Programming

, Volume 12, Issue 1, pp 136–138 | Cite as

A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming

  • Jacques Gauvin
Short Communication


Mathematical Method Regularity Condition Nonconvex Programming Sufficient Regularity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    M.S. Bazaraa, J.J. Goode and C.M. Shetty, “Constraint qualifications revisited”,Management Science 18 (1972) 567–573.Google Scholar
  2. [2]
    J. Gauvin and J.W. Tolle, “Differential stability in nonlinear programming”,SIAM Journal on Control and Optimization 15 (2) (1977).Google Scholar
  3. [3]
    D.W. Peterson, “A review of constraint qualifications in finite-dimensional spaces”,SIAM Review 15 (1973) 639–654.Google Scholar
  4. [4]
    E.L. Peterson, “Fenchel's hypothesis and the existence of recession directions in convex programming”, Discussion Paper No. 152, Department of Industrial Engineering, Northwestern University, Evanston, IL (June 1975).Google Scholar

Copyright information

© The Mathematical Programming Society 1977

Authors and Affiliations

  • Jacques Gauvin
    • 1
  1. 1.École PolytechniqueUniversité de MontréalMontréalCanada

Personalised recommendations