Continuous time linear-fractional programming. The minimum-risk approach
The authors apply the minimum-risk approach to the stochastic continuous time linear-fractional problem. They assume that the coefficients of the objective functions are simply randomized, and show, under some positivity conditions, that the stochastic continuous time linear-fractional problem is equivalent to certain deterministic continuous time linear-fractional problem, while the stochastic continuous time linear-fractional problem with an objective function having a linear-fractional kernel is equivalent to a deterministic continuous time nonlinear-fractional problem. Some parametric procedures are proposed for solving these deterministic equivalent problems. These procedures involve approximations by discrete optimization problems.
- Optimality conditions and duality for continuous-time programming with multiple interval-valued objective functions
- Saddle-point type optimality criteria, duality and a new approach for solving nonsmooth fractional continuous-time programming problems
- Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems
- A sixth bibliography of fractional programming
- scientific article; zbMATH DE number 4160474 (Why is no real title available?)
- Continuous-time generalized fractional programming problems. Part I: Basic theory
- scientific article; zbMATH DE number 4104886 (Why is no real title available?)
- Using the parametric approach to solve the continuous-time linear fractional Max-min problems
- Optimality criteria and duality for nonlinear fractional continuous-time programming
- Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
- Componentwise Dinkelbach algorithm for nonlinear fractional optimization problems
- Continuous-time fractional minmax programming
- On a recurrence algorithm for continuous-time linear fractional programming problems
This page was built for publication: Continuous time linear-fractional programming. The minimum-risk approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2713142)