Continuous programming. I: Linear objectives
From MaRDI portal
Cites work
- A class of continuous convex programming problems
- A class of continuous linear programming problems
- A Continuous Leontief Production Model with Quadratic Objective Function
- A Duality Theorem for a Class of Continuous Linear Programming Problems
- A duality theory for abstract mathematical programs with applications to optimal control theory
- An Extended Duality Theorem for Continuous Linear Programming Problems
- Continuous programming. I: Linear objectives
- Duality for a Class of Infinite Programming Problems
- scientific article; zbMATH DE number 3121911 (Why is no real title available?)
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3174053 (Why is no real title available?)
- scientific article; zbMATH DE number 3185418 (Why is no real title available?)
- Symmetric Duality for Continuous Linear Programs
Cited in
(35)- 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
- Some remarks concerning duality for continuous-time programming problems
- Sufficient optimality criteria in continuous time programming
- Optimality conditions and strong duality in abstract and continuous-time linear programming
- Continuous time programming with nonlinear constraints
- Duality theorem in Markovian decision problems
- Saddle-point optimality criteria of continuous time programming without differentiability
- Continuous time programming with nonlinear time-delayed constraints
- Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions
- Continuous-time multiobjective optimization problems via invexity
- Continuous programming. I: Linear objectives
- Continuous programming. II: Nonlinear objectives
- Duality in continuous linear programming
- Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems
- Approximate solutions and error bounds for a class of continuous-time linear programming problems
- Continuous-time Programming
- Lagrangian duality for a class of infinite programming problems
- Solving stochastic dynamic programming problems by linear programming — An annotated bibliography
- Optimal control of linear bottleneck problems
- Some variations, extensions, and generalizations of Tucker’s theorems
- Using the parametric approach to solve the continuous-time linear fractional Max-min problems
- Continuous-time linear programming problems revisited: a perturbation approach
- Time-Varying Semidefinite Programs
- Linear programming problems on time scales
- Separated and state-constrained separated linear programming problems on time scales
- Nonsmooth continuous-time optimization problems: Necessary conditions
- Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
- The difference between finite dimensional linear programming problems and infinite dimensional linear programming problems
- A review of duality theory for linear programming over topological vector spaces
- A corrected proof of a result of Grinold
- Sparse optimal control for the heat equation with mixed control-state constraints
- Continuous-time optimization problems involving invex functions
- A recurrence method for a special class of continuous time linear programming problems
This page was built for publication: Continuous programming. I: Linear objectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2546837)
