Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems

DOI10.1080/02331930600662849zbMath1124.90022OpenAlexW2066013343MaRDI QIDQ3446578

No author found.

Publication date: 19 June 2007

Published in: Optimization (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)

Related Items (11)

Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities ⋮ Optimality conditions in optimization problems with convex feasible set using convexificators ⋮ 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 the solution set for tangentially convex optimization problems ⋮ 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 ⋮ Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems ⋮ Characterizations of optimal solution sets of convex infinite programs ⋮ Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers

Cites Work

• Convex composite multi-objective nonsmooth programming
• A simple characterization of solutions sets of convex programs
• On pseudolinear functions
• Generalizations of Slater's constraint qualification for infinite convex programs
• Characterization of solution sets of quasiconvex programs
• Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
• On characterizing the solution sets of pseudolinear programs
• An extension of pseudolinear functions and variational inequality problems
• First and second order characterizations of pseudolinear functions
• Proper efficiency and the theory of vector maximization
• Characterization of solution sets of convex programs
• Pseudolinearity and efficiency
• Pseudo-Concave Programming and Lagrange Regularity

This page was built for publication: Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems