Sufficient optimality criteria in continuous time programming

DOI10.1016/0022-247X(82)90174-3zbMath0483.90070MaRDI QIDQ1163476

Surjeet Kaur, R. N. Kaul

Publication date: 1982

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

zbMATH Keywords

sufficient optimality conditionscontinuous time programmingalmost everywhere pseudo-concave objective function

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Continuous time programming with nonlinear constraints
• Saddle-point optimality criteria of continuous time programming without differentiability
• A sufficient optimality criterion in continuous time programming for generalized convex functions
• A class of continuous linear programming problems
• A class of continuous convex programming problems
• Continuous programming. I: Linear objectives
• Generalization of some duality theorems in nonlinear programming
• A Duality Theorem for a Class of Continuous Linear Programming Problems

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