Saddle-point optimality criteria of continuous time programming without differentiability

DOI10.1016/0022-247X(77)90072-5MaRDI QIDQ1240663zbMATH OpenFDO

Authors Chanchal Singh, William H. Farr

Publication date 1977

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

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions for minimax problems (49K35) Optimality conditions (49K99)

Cites work

• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 3220692 (Why is no real title available?)
• scientific article; zbMATH DE number 3308846 (Why is no real title available?)
• A Duality Theorem for a Class of Continuous Linear Programming Problems
• A class of continuous convex programming problems
• A class of continuous linear programming problems
• Continuous programming. I: Linear objectives
• Continuous time programming with nonlinear constraints
• Continuous time programming with nonlinear time-delayed constraints
• Some sufficient conditions for continuous-linear-programming problems
• Symmetric Duality for Continuous Linear Programs

Cited in

(11)

• Vector continuous-time programming without differentiability
• Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
• Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions
• Sufficient optimality criteria in continuous time programming
• A sufficient optimality criterion in continuous time programming for generalized convex functions
• Some remarks concerning duality for continuous-time programming problems
• Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems
• Using the parametric approach to solve the continuous-time linear fractional Max-min problems
• Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
• Continuous-time linear programming problems revisited: a perturbation approach
• Saddlepoint of continuous time programming having inequality and equality constraints

This page was built for publication: Saddle-point optimality criteria of continuous time programming without differentiability

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