Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers

DOI10.1080/02331930701763272zbMath1175.90373OpenAlexW1965322967MaRDI QIDQ3648624

Monika Mehta, C. S. Lalitha

Publication date: 27 November 2009

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930701763272

zbMATH Keywords

Lagrange multipliersgeneralized derivativesconvex functionsnonlinear programmingpseudolinear functions

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (11)

An approach to characterizing \(\epsilon\)-solution sets of convex programs ⋮ Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities ⋮ Characterizations of robust solution set of convex programs with uncertain data ⋮ Some new properties of the Lagrange function and its applications ⋮ A new approach to characterize the solution set of a pseudoconvex programming problem ⋮ Characterizations of solution sets of differentiable quasiconvex programming problems ⋮ Characterizing the solution set of convex optimization problems without convexity of constraints ⋮ Characterizations of the solution set for a class of nonsmooth optimization problems ⋮ Unnamed Item ⋮ Characterizing robust solution sets of convex programs under data uncertainty ⋮ Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints

Cites Work

• Convex composite multi-objective nonsmooth programming
• A simple characterization of solutions sets of convex programs
• Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
• On characterizing the solution sets of pseudolinear programs
• Characterization of solution sets of convex programs
• Pseudolinearity and efficiency
• A NOTE ON PSEUDOLINEARITY IN TERMS OF BIFUNCTIONS
• Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems
• Characterizations of generalized convexities via generalized directional derivatives

This page was built for publication: Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers