Skip to main content
SpringerLink
Log in

A note to the paper “An efficient algorithm for linear programming” of V Ch Venkaiah

  • Published:
Proceedings Mathematical Sciences Aims and scope Submit manuscript

Abstract

In Venkaiah [1] an algorithm for solving linear optimization problems based on the idea of the projective algorithm of Karmarkar, is proposed. The essential simplification in the new algorithm is the use of a fixed projection operator. In this way the algorithm requires onlyO(n 2) operations to obtain a sufficient exact solution. In this note it is shown that in some special cases the algorithm of Venkaiah yields a feasible solution that is far from the optimal one.

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

Reference

  1. Venkaiah V Ch, An efficient algorithm for linear programmingProc. Indian Acad. Sci.-Math. Sci. 100 (1990) 295–301

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Wirtschafts- und Rechtswissenschaften, Technische Universität Chemnitz, Reichenhainer Str. 39, D O-9022, Chemnitz, Germany

    Joachim Käschel

Authors
  1. Joachim Käschel
    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

Käschel, J. A note to the paper “An efficient algorithm for linear programming” of V Ch Venkaiah. Proc Math Sci 102, 155–158 (1992). https://doi.org/10.1007/BF02836787

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation