Saddle-point optimality criteria of continuous time programming without differentiability

DOI10.1016/0022-247X(77)90072-5zbMath0363.90104MaRDI QIDQ1240663

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)

Related Items (11)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Continuous time programming with nonlinear constraints
• Continuous time programming with nonlinear time-delayed constraints
• A class of continuous linear programming problems
• Some sufficient conditions for continuous-linear-programming problems
• A class of continuous convex programming problems
• Continuous programming. I: Linear objectives
• A Duality Theorem for a Class of Continuous Linear Programming Problems
• Symmetric Duality for Continuous Linear Programs

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