A class of continuous convex programming problems

From MaRDI portal
Publication:2535945

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




Related Items

Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming ProblemsThe Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programmingSome remarks concerning duality for continuous-time programming problemsA constant rank constraint qualification in continuous-time nonlinear programmingNumerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functionsNew optimality criteria for convex continuous-time problems of vector optimizationGeneralized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalitiesOptimality conditions and duality for a class of continuous-time generalized fractional programming problemsContinuous-time optimization problems involving invex functionsApproximate solutions and error bounds for a class of continuous-time linear programming problemsContinuous time programming with nonlinear time-delayed constraintsGeneralized Kuhn-Tucker conditions and duality for continuous nonlinear programming problemsUsing the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problemsOptimality conditions and duality in continuous programming. I: Convex programs and a theorem of the alternativeOptimality conditions in a vector continuous-time optimization problemUsing the parametric approach to solve the continuous-time linear fractional Max-min problemsSufficient optimality criteria in continuous time programmingUnnamed ItemUnnamed ItemContinuous-time ProgrammingContinuous-time linear programming problems revisited: A perturbation approachVector continuous-time programming without differentiabilityContinuous time programming with nonlinear constraintsNonsmooth continuous-time optimization problems: Necessary conditionsSaddle-point optimality criteria of continuous time programming without differentiabilitySaddlepoint of continuous time programming having inequality and equality constraintsOn two duality theorems for continuous programming problemsOptimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraintsContinuous programming. I: Linear objectivesContinuous programming. II: Nonlinear objectivesDuality in continuous linear programmingKKT Optimality Conditions and Nonsmooth Continuous Time Optimization ProblemsContinuous time programming with set-inclusive constraints and objective setSome existence and regularity results for dual linear control problemsSufficient optimality conditions in continuous-time nonlinear programmingOptimality conditions and Lagrangian duality in continuous-time nonlinear programming



Cites Work