scientific article; zbMATH DE number 3976806
From MaRDI portal
Publication:3743152
The Martos algorithm for linear fractional programming is applied to a problem with regular feasible set, i.e. non-empty bounded closed and convex. If the feasible set is not bounded the problem has to be regularized, usually by adding a bounding inequality. Combining Martos algorithm and a parametric method due to the authors a new algorithm that solves the linear fractional programming problem even if the feasible region is not bounded is presented. Comparative computational results are given.
Recommendations
- An algorithm for solving linear fractional programming problems
- A linear fractional program and algorithm
- scientific article; zbMATH DE number 409486
- A complete algorithm for linear fractional programs
- scientific article; zbMATH DE number 857647
- Approximation of linear fractional-multiplicative problems
- An Algorithm for solving the Integer Linear Fractional Programs
- A new procedure for solving linear fractional programming problems
- scientific article; zbMATH DE number 1450272
Cited in
(11)- Monotone variable-metric algorithm for linearly constrained nonlinear programming
- On generalized linearity of quadratic fractional functions
- Parametric linear fractional programming for an unbounded feasible region
- Global optimization of a rank-two nonconvex program
- A modified fractional simplex method.
- A parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs
- Equivalence in linear fractional programming
- Simplex-like sequential methods for a class of generalized fractional programs
- A linear fractional optimization over an integer efficient set
- A computational comparison between algorithms for linear fractional programming
- An exact method for solving the integer sum of linear ratios problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3743152)