A class of continuous linear programming problems
From MaRDI portal
Publication:2522626
DOI10.1016/0022-247X(66)90187-9zbMath0141.35601MaRDI QIDQ2522626
Publication date: 1966
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Related Items
Some variations, extensions, and generalizations of Tucker’s theorems, A class of continuous quadratic programming problems, Numerical solutions to continuous linear programming problems, Nonsmooth continuous-time optimization problems: Necessary conditions, A corrected proof of a result of Grinold, Continuous-time optimization problems involving invex functions, Some existence and regularity results for dual linear control problems, Duality in continuous-time homogeneous programming, Optimality conditions and Lagrangian duality in continuous-time nonlinear programming, The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming, Some remarks concerning duality for continuous-time programming problems, Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems, Optimality conditions and duality in continuous programming. I: Convex programs and a theorem of the alternative, Optimality conditions and duality in continuous programming. II: The linear problem revisited, Sufficient optimality criteria in continuous time programming, A class of infinite dimensional linear programming problems, Continuous time programming with nonlinear constraints, A class of continuous nonlinear complementarity problems, Saddle-point optimality criteria of continuous time programming without differentiability, Saddlepoint of continuous time programming having inequality and equality constraints, Continuous time programming with nonlinear time-delayed constraints, Continuous-time multiobjective optimization problems via invexity, On two duality theorems for continuous programming problems, A class of continuous convex programming problems, Continuous programming. I: Linear objectives, Duality in continuous linear programming, Lineare Optimierung in unendlichdimensionalen Vektorräumen, Extreme Points for Continuous Network Programs with Arc Delays, Continuous-time Programming, Lagrangian duality for a class of infinite programming problems, Optimal control of linear bottleneck problems
Cites Work
