A class of continuous convex programming problems

DOI10.1016/0022-247X(68)90184-4zbMath0184.44503OpenAlexW2085953073MaRDI QIDQ2535945

Morgan A. Hanson, Bertram Mond

Publication date: 1968

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(68)90184-4

zbMATH Keywords

operations research

Related Items

Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems, The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming, Some remarks concerning duality for continuous-time programming problems, A constant rank constraint qualification in continuous-time nonlinear programming, Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions, New optimality criteria for convex continuous-time problems of vector optimization, Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities, Optimality conditions and duality for a class of continuous-time generalized fractional programming problems, Continuous-time optimization problems involving invex functions, Approximate solutions and error bounds for a class of continuous-time linear programming problems, Continuous time programming with nonlinear time-delayed constraints, Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems, Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems, Optimality conditions and duality in continuous programming. I: Convex programs and a theorem of the alternative, Optimality conditions in a vector continuous-time optimization problem, Using the parametric approach to solve the continuous-time linear fractional Max-min problems, Sufficient optimality criteria in continuous time programming, Unnamed Item, Unnamed Item, Continuous-time Programming, Continuous-time linear programming problems revisited: A perturbation approach, Vector continuous-time programming without differentiability, Continuous time programming with nonlinear constraints, Nonsmooth continuous-time optimization problems: Necessary conditions, Saddle-point optimality criteria of continuous time programming without differentiability, Saddlepoint of continuous time programming having inequality and equality constraints, On two duality theorems for continuous programming problems, Optimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints, Continuous programming. I: Linear objectives, Continuous programming. II: Nonlinear objectives, Duality in continuous linear programming, KKT Optimality Conditions and Nonsmooth Continuous Time Optimization Problems, Continuous time programming with set-inclusive constraints and objective set, Some existence and regularity results for dual linear control problems, Sufficient optimality conditions in continuous-time nonlinear programming, Optimality conditions and Lagrangian duality in continuous-time nonlinear programming

Cites Work

• A class of continuous linear programming problems
• A Duality Theorem for Convex Programs
• A Duality Theorem for a Class of Continuous Linear Programming Problems
• Unnamed Item