An interval-type algorithm for continuous-time linear fractional programming problems
From MaRDI portal
Publication:1936071
Recommendations
- Continuous-time generalized fractional programming problems. II: an interval-type computational procedure
- Continuous-time generalized fractional programming problems. Part I: Basic theory
- On a recurrence algorithm for continuous-time linear fractional programming problems
- Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems
- Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
Cited in
(9)- Continuous-time generalized fractional programming problems. II: an interval-type computational procedure
- Interval linear fractional programming: optimal value range of the objective function
- Convergence of interval-type algorithms for generalized fractional programming
- Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
- Continuous-time generalized fractional programming problems. Part I: Basic theory
- scientific article; zbMATH DE number 4167871 (Why is no real title available?)
- Approximate solutions for continuous-time quadratic fractional programming problems
- Solving continuous-time linear programming problems based on the piecewise continuous functions
- On a recurrence algorithm for continuous-time linear fractional programming problems
This page was built for publication: An interval-type algorithm for continuous-time linear fractional programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1936071)