Sufficient optimality criteria in continuous time programming

DOI10.1016/0022-247X(82)90174-3MaRDI QIDQ1163476zbMATH OpenFDO

Authors R. N. Kaul, Surjeet Kaur

Publication date 1982

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-247X(82)90174-3

zbMATH Keywords

almost everywhere pseudo-concave objective functioncontinuous time programmingsufficient optimality conditions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Model systems in control theory (93C99)

Cites work

• A class of continuous convex programming problems
• A class of continuous linear programming problems
• A Duality Theorem for a Class of Continuous Linear Programming Problems
• A sufficient optimality criterion in continuous time programming for generalized convex functions
• Continuous programming. I: Linear objectives
• Continuous time programming with nonlinear constraints
• Generalization of some duality theorems in nonlinear programming
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 3308846 (Why is no real title available?)
• Saddle-point optimality criteria of continuous time programming without differentiability

Cited in

(1)

• Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities

This page was built for publication: Sufficient optimality criteria in continuous time programming

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