Continuous-time linear programming problems revisited: a perturbation approach
From MaRDI portal
Publication:4916307
Recommendations
- scientific article; zbMATH DE number 3845359
- Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems
- Some Properties of a Class of Continuous Linear Programs
- Parametric continuous-time linear fractional programming problems
- Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
Cites work
- A class of continuous convex programming problems
- A class of continuous linear programming problems
- A class of infinite dimensional linear programming problems
- A Duality Theorem for a Class of Continuous Linear Programming Problems
- A Duality Theory for Separated Continuous Linear Programs
- A simplex based algorithm to solve separated continuous linear programs
- A sufficient optimality criterion in continuous time programming for generalized convex functions
- An Algorithm for a Class of Continuous Linear Programs
- An extended algorithm for separated continuous linear programs
- An Extended Duality Theorem for Continuous Linear Programming Problems
- Continuous programming. I: Linear objectives
- Continuous programming. II: Nonlinear objectives
- Continuous time programming with nonlinear constraints
- Continuous time programming with nonlinear time-delayed constraints
- Convergence of a General Class of Algorithms for Separated Continuous Linear Programs
- Duality for nonsmooth continuous-time problems of vector optimization
- Duality in continuous linear programming
- Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions
- Forms of Optimal Solutions for Separated Continuous Linear Programs
- Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
- Nonsmooth continuous-time optimization problems: Sufficient conditions
- On the Solutions of a Class of Continuous Linear Programs
- 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
- Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
- Optimality conditions and strong duality in abstract and continuous-time linear programming
- Optimality criteria for nonsmooth continuous-time problems of multiobjective optimization
- Saddle-point optimality criteria of continuous time programming without differentiability
- Some Properties of a Class of Continuous Linear Programs
- Sufficient optimality conditions in continuous-time nonlinear programming
- The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming
Cited in
(10)- On the form of solutions to the linear continuous time programming problem and a conjecture by Tyndall
- Some perturbation theory for linear programming
- Note: continuous-time linear programming problems revisited
- Symmetric strong duality for a class of continuous linear programs with constant coefficients
- scientific article; zbMATH DE number 3845359 (Why is no real title available?)
- Review on the research for separated continuous linear programming: with applications on service operations
- Linear programming problems on time scales
- Duality gap function in infinite dimensional linear programming
- Optimality conditions and duality for a class of continuous-time linear optimization problems
- Determining the viability of an unbounded polyhedron for a switched system
This page was built for publication: Continuous-time linear programming problems revisited: a perturbation approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4916307)
