Skip to main content
Log in

Explicit Solvability of Dual Pairs of Infinite Linear Programs

  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

In this paper, we obtain explicit solutions of a pair of infinite linear programs in terms of generalized inverses. This is done by reducing one of the problems to an interval linear program. The main result is posed in the setting of a class of dual pairs of real Banach spaces and is illustrated with an example.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Anderson, E. J. and Nash, P., Linear Programming in Infinite Dimensional Spaces, John Wiley and sons, 1987.

  2. Ben-Israel, A. and Charnes, A., An explicit solution of a special class of linear programming problems, Operations Research, 16, 1166–1175, 1968.

    Article  Google Scholar 

  3. Charnes, A., Granot, D. and Granot, P., A primal algorithm for interval linear programming problems, Linear Alg. & Appl., 17, 65–78, 1977.

    Article  Google Scholar 

  4. Groetsch, C. W., Generalized Inverses of Operators: Representation and Approximation, Marcel Dekkar, 1977.

  5. Kulkarni, S. H. and Sivakumar, K. C., Explicit solutions of a special class of linear economic models, Ind. J. Pure & Appl Math., 26 (3), 217–223, 1995.

    Google Scholar 

  6. Kulkarni, S. H. and Sivakumar, K. C., Explicit solutions of a special class of linear programming problems in Banach spaces, Acta. Sci. Math. (Szeged), 62, 457–465, 1996.

    Google Scholar 

  7. Kulkarni, S. H. and Sivakumar, K. C., Applications of generalized inverses to interval linear programs in Hilbert spaces, Numer. Funct. Anal & Optimiz., 16 (7&8), 965–973, 1995.

    Article  Google Scholar 

  8. Robers, P. D. and Ben-Israel, A., A suboptimization method for interval linear programming, new method for linear programming, Linear Alg. & Appl., 3, 383–405, 1970.

    Article  Google Scholar 

  9. Robers, P. D. and Ben-Israel, A., A decomposition method for interval linear programming, Manag. Sci. 16 (5), 1970.

  10. Robers, P. D. and Ben-Israel, A., An interval programming algorithm for discrete linear L1approximation problems, J. Approx. Theory, 2, 323–336, 1969.

    Article  Google Scholar 

  11. Robertson, A. P. and Robertson, W. J., Topological Vector Spaces, Cambridge University Press, Cambridge, 1973.

    Google Scholar 

  12. Sivakumar, K. C., Interval linear programs in infinite dimensional spaces, Ph.D. Dissertation, Indian Institute of Technology, Madras, 1994.

    Google Scholar 

  13. Sposito, V. A., Solutions of a special class of linear programming problems, Operations Research, 386–388, 1970.

  14. Zlobec, S. and Ben-Israel, A., On explicit solutions of interval linear programs, Israel J. Math., 8, 12–22, 1970.

    Article  Google Scholar 

  15. Zlobec, S. and Ben-Israel, A., Explicit solutions of interval linear programs, Operations Research, 21, 390–393, 1973.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sivakumar, K.C., Swarna, J.M. Explicit Solvability of Dual Pairs of Infinite Linear Programs. OPSEARCH 42, 288–296 (2005). https://doi.org/10.1007/BF03398737

Download citation

  • Published:

  • Issue Date:

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

AMS Mathematics Subject Classification

Keywords

Navigation