No label defined (Q3743152)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3976806
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3976806

      Statements

      0 references
      0 references
      1986
      0 references
      unbounded feasible set
      0 references
      solution algorithm
      0 references
      Martos algorithm
      0 references
      linear fractional programming
      0 references
      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.
      0 references

      Identifiers