Optimality conditions and strong duality in abstract and continuous-time linear programming
From MaRDI portal
Publication:1166103
DOI10.1007/BF00934631zbMath0488.49020OpenAlexW2026789159MaRDI QIDQ1166103
Publication date: 1983
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00934631
generalized dualitycontinuous- time linear programsinfinite-dimensional linear programspositive extendability
Related Items (7)
Parametric continuous-time linear fractional programming problems ⋮ Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems ⋮ Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions ⋮ Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems ⋮ Using the parametric approach to solve the continuous-time linear fractional Max-min problems ⋮ Continuous-time linear programming problems revisited: A perturbation approach ⋮ Solving Continuous-Time Linear Programming Problems Based on the Piecewise Continuous Functions
Cites Work
- Unnamed Item
- Unnamed Item
- Dynamic programming and partial differential equations
- Duality and stability in extremum problems involving convex functions
- Continuous programming. I: Linear objectives
- Partially ordered linear topological spaces
- Extreme Points and Basic Feasible Solutions in Continuous Time Linear Programming
- An alternative method for a global analysis of quadratic programs in a finite number of steps
- An Infinite Linear Program with a Duality Gap
- A Duality Theorem for a Class of Continuous Linear Programming Problems
- The spaces 𝐿^{𝑝} with 0<𝑃<1
This page was built for publication: Optimality conditions and strong duality in abstract and continuous-time linear programming
