The characterizations of optimal solution set in programming problem under inclusion constrains

DOI10.1016/J.AMC.2007.08.034MaRDI QIDQ2425984zbMATH OpenOpenAlexFDO

Authors Qingzhen Xu, Xianping Wu

Publication date 17 April 2008

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2007.08.034

zbMATH Keywords

convex graphsubgradientsupport function

Mathematics Subject Classification ID

Set-valued and variational analysis (49J53) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Review text

The authors consider the convex mathematical programming problem with inclusion constraints: \(\min\{f(x): x \in C\), \(0 \in F(x)\}\). They show that the Lagrangian of this problem is constant on its solution set. Basing on this they derive various Lagrange-multiplier based characterizations of its solution set.

Recommendations

• Characterizations of optimal solution sets of convex infinite programs
• Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers
• Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
• Characterizations of the solution set for a class of nonsmooth optimization problems
• Characterizations of the solution set for nonconvex semi-infinite programming problems

Cites work

• M^x/G/1 Queue with Multiple Vacations
• Dynamic thermal comfort numerical simulation model on 3D garment CAD
• scientific article; zbMATH DE number 1113627 (Why is no real title available?)
• Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
• On the regularity condition for the extremal problem under locally Lipschitz inclusion constraints
• Second order optimality conditions for the extremal problem under inclusion constraints

Cited in

(6)

• Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
• Characterizations of the solution set for a class of nonsmooth optimization problems
• Characterizations of solution sets of a class of nonconvex semi-infinite programming problems
• The inclusion-constrained programming and the cone-constrained programming
• Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers
• Optimal Inclusion of a Solution Set

This page was built for publication: The characterizations of optimal solution set in programming problem under inclusion constrains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425984)