Continuous-time generalized fractional programming problems. II: an interval-type computational procedure
From MaRDI portal
Publication:1949580
DOI10.1007/s10957-012-0131-5zbMath1282.90189MaRDI QIDQ1949580
Publication date: 8 May 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0131-5
strong duality; infinite-dimensional nonlinear programming; continuous-time linear programming problems; interval-type algorithm; continuous-time generalized fractional programming problems
90C32: Fractional programming
Related Items
Continuous-time generalized fractional programming problems. Part I: Basic theory, Interval linear fractional programming: optimal value range of the objective function, A simplex-type algorithm for continuous linear programs with constant coefficients, A new linearization technique for minimax linear fractional programming
Cites Work
- Using the parametric approach to solve the continuous-time linear fractional Max-min problems
- Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
- A simplex based algorithm to solve separated continuous linear programs
- A recurrence method for a special class of continuous time linear programming problems
- On a recurrence algorithm for continuous-time linear fractional programming problems
- An interval-type algorithm for continuous-time linear fractional programming problems
- Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems
- Approximate solutions and error bounds for a class of continuous-time linear programming problems
- Numerical solutions to continuous linear programming problems
