Asymptotic Lagrange Regularity for Pseudoconcave Programming with Weak Constraint Qualification
From MaRDI portal
Publication:5548708
DOI10.1287/opre.16.4.849zbMath0164.19801OpenAlexW2123235957MaRDI QIDQ5548708
No author found.
Publication date: 1968
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.16.4.849
Related Items
Algorithm model for penalty functions-type iterative pcedures ⋮ Characterization of optimality in convex programming without a constraint qualification ⋮ Approximate Karush-Kuhn-Tucker condition in multiobjective optimization
