Continuous programming. II: Nonlinear objectives
From MaRDI portal
Cites work
- A class of continuous convex programming problems
- Continuous programming. I: Linear objectives
- scientific article; zbMATH DE number 3156595 (Why is no real title available?)
- scientific article; zbMATH DE number 3195517 (Why is no real title available?)
- Remarks on Some Recent Extensions of Filippov’s Implicit Functions Lemma
Cited in
(16)- Some existence and regularity results for dual linear control problems
- Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
- Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions
- Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities
- Optimality conditions and duality for a class of continuous-time generalized fractional programming problems
- Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems
- The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization
- Continuous-time Programming
- A note on nonconcave continuous programming
- Using the parametric approach to solve the continuous-time linear fractional Max-min problems
- Continuous-time linear programming problems revisited: a perturbation approach
- Function restoration using linear programming†
- Numerical solutions to continuous linear programming problems
- Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
- Optimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints
- A corrected proof of a result of Grinold
This page was built for publication: Continuous programming. II: Nonlinear objectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2546838)
