An existence theorem for a nonlinear nondifferentiable programming problem

MaRDI QIDQ1090619zbMATH OpenFDO

Authors J. Parida, K. L. Roy

Publication date 1987

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

existence of an optimal solutionnon-differentiable programmingpolyhedral cone domainstationary point problem

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Nonlinear programming (90C30)

Review text

Considered is the existence of an optimal solution to a non- differentiable programming problem over a polyhedral cone domain via the corresponding stationary point problem. The authors present a condition which implies the existence of an optimal solution to the given problem.

Recommendations

• Duality and existence theory for nondifferentiable programming
• An optimality condition for a nondifferentiable convex program
• On a complementarity problem associated with nondifferentiable programming
• A note on a paper of Parida and Roy on existence of optimal solutions
• Nondifferentiable minimax programming problems with applications

Cited in

(8)

• Duality and existence theory for nondifferentiable programming
• On the minimum of a class of nondifferentiable functions
• A note on a paper of Parida and Roy on existence of optimal solutions
• On existence of optimal solution for sublinear programs
• On a complementarity problem associated with nondifferentiable programming
• scientific article; zbMATH DE number 4160490 (Why is no real title available?)
• scientific article; zbMATH DE number 1261905 (Why is no real title available?)
• Noncoercive Optimization Problems

This page was built for publication: An existence theorem for a nonlinear nondifferentiable programming problem

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