A class of continuous linear programming problems

From MaRDI portal
Revision as of 05:24, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2522626

DOI10.1016/0022-247X(66)90187-9zbMath0141.35601MaRDI QIDQ2522626

Norman Levinson

Publication date: 1966

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




Related Items

Parametric continuous-time linear fractional programming problems, 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, Unnamed Item, Continuous-time optimization problems involving invex functions, Continuous-time generalized fractional programming problems. Part I: Basic theory, Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming, 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, A class of continuous quadratic programming problems, Optimality conditions and duality in continuous programming. II: The linear problem revisited, Dynamic Matching for Real-Time Ride Sharing, Using the parametric approach to solve the continuous-time linear fractional Max-min problems, Some variations, extensions, and generalizations of Tucker’s theorems, Sufficient optimality criteria in continuous time programming, Numerical solutions to continuous linear programming problems, A class of infinite dimensional linear programming problems, Robust continuous linear programs, Linear programming problems on time scales, Continuous-time multiobjective optimization problems via invexity, Extreme Points for Continuous Network Programs with Arc Delays, Continuous-time Programming, Continuous-time linear programming problems revisited: A perturbation approach, A recurrence method for a special class of continuous time linear programming problems, Continuous time programming with nonlinear constraints, On a recurrence algorithm for continuous-time linear fractional programming problems, Nonsmooth continuous-time optimization problems: Necessary conditions, 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, Time-Varying Semidefinite Programs, A simplex-type algorithm for continuous linear programs with constant coefficients, On two duality theorems for continuous programming problems, A class of continuous convex programming problems, Lagrangian duality for a class of infinite programming problems, Solving Continuous-Time Linear Programming Problems Based on the Piecewise Continuous Functions, Continuous programming. I: Linear objectives, Duality in continuous linear programming, Lineare Optimierung in unendlichdimensionalen Vektorräumen, Structure of Solutions for Continuous Linear Programs with Constant Coefficients, Optimal control of linear bottleneck problems, A corrected proof of a result of Grinold, 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



Cites Work