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.











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)