A sufficient optimality criterion in continuous time programming for generalized convex functions

DOI10.1016/0022-247X(78)90143-9zbMath0383.90084MaRDI QIDQ1248463

Chanchal Singh

Publication date: 1978

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

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

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 ⋮ Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities ⋮ 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 ⋮ Sufficient optimality conditions in continuous-time nonlinear programming ⋮ Optimality conditions and Lagrangian duality in continuous-time nonlinear programming

Cites Work

• Continuous time programming with nonlinear constraints
• Saddle-point optimality criteria of continuous time programming without differentiability
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item