Skip to main content
SpringerLink
Log in

Ranking of vertices in the linear fractional programming problem

  • Scientific Notes
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

In this paper the problem of ranking vertices in the linear fractional programming problem is considered. It is shown that a class of vertex ranking algorithms for the linear programming problem can be used with only minor modifications.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. M. Abadie and A. C. Williams,Dual and Parametric Methods in Decomposition, inRecent Advances in Mathematical Programming, editors R. L. Graves and P. Wolfe, McGraw-Hill, (1963).

  2. M. S. Bazaraa and C. M. Shetty,Nonlinear Programming, John Wiley & Sons (1979).

  3. E. U. Choo and D. R. Atkins,Bicriteria linear fractional programming, Journal of Optimization Theory and Applications, Vol. 36, no. 2 (1982), 203–220.

    Article  Google Scholar 

  4. G. Dahl and S. Storøy,Enumeration of vertices in the linear programming problem, Report no. 45, Dept. of Applied Mathematics, University of Bergen, Norway, (1973).

    Google Scholar 

  5. G. Dahl and S. Storøy,Decomposed enumeration of extreme points in the linear programming problem, BIT 15 (1975), 151–157.

    Google Scholar 

  6. P. C. Gilmore and R. E. Gomory,A linear programming approach to the cutting stock problem — Part II, Operations Research, 11 (1963) 863–888.

    Google Scholar 

  7. L. S. Lasdon,Optimization Theory for Large Systems, The Macmillan Company, (1970).

  8. T. H. Matheiss and D. S. Rubin,A survey and comparison of methods for finding all vertices of convex polyhedral sets, Mathematics of Operations Research, Vol. 5, no. 2 (1980), 167–185.

    Google Scholar 

  9. K. G. Murty,Solving the fixed charge problem by ranking the extreme points, Operations Research XVI (1968), 268–279.

    Google Scholar 

  10. J. Ponstein,Seven kinds of convexity, SIAM Review, 9, no. 1 (1967), 115–119.

    Article  Google Scholar 

  11. S. W. Wallace,Enumeration algorithm in linear programming, Report in Informatics, no. 3, Dept. of Mathematics, University of Bergen, Norway, (1982).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Matematisk Institutt, Universitetet i Bergen, Allégate 53–55, N-5014, Bergen, Norway

    Sverre Storøy

Authors
  1. Sverre Storøy
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Storøy, S. Ranking of vertices in the linear fractional programming problem. BIT 23, 403–405 (1983). https://doi.org/10.1007/BF01934470

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01934470

Keywords

Search

Navigation