Skip to main content
SpringerLink
Log in

Decomposition principle for indefinite quadratic programe

  • Published:
Trabajos de estadistica y de investigacion operativa

Abstract

This paper presents a decomposition principle for optimizing a large scale indefinite quadratic programme. The procedure is a combination of the decomposition method and the parametric programing technique. To illustrate the application of the procedure developed in this paper, a numerical example has been solved.

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.B. ROSEN: “Convex Partition Programming” Recent Advancen in Mathematical Programming, (R. Graves and P. Wolfe, eds), pp. 159–176, McGraw Hill, New York, 1963.

    Google Scholar 

  2. -A.M. GEOFFRION: “Solving Bicriterion Mathematical Programs,” Op. Res., 15, pp. 39–54, 1967.

    Article  MATH  MathSciNet  Google Scholar 

  3. -KANTI SWARUP: “Programming with indefinite quadratic function with linear constraints,” Cahiers Centre d’Etudes de Rech. Op. 8, pp. 132–136, 1966.

    MATH  Google Scholar 

  4. KANTI SWARUP. “Indefinite Quadratic Programming,” Cahiers Centre d’Etudes de Rech, Op. 8, pp. 223–234, 1966.

    MATH  MathSciNet  Google Scholar 

  5. -G.B. DANTZING and P. WOLFE: “Decomposition Principle for Linear Programs, Op. Res., 8, pp. 101–111, 1960.

    Article  Google Scholar 

  6. -J.M. ABADIE and A.C. WILLIAMS: “Dual and Parametric methods in decomposition,” Recent Advances in mathematical programming (R. Graves and P. Wolfe, ed,) pp. 149–158. McGraw Hill, New York, 1963.

    Google Scholar 

  7. -BELA MARTOS: “Hyperbolic Programmings,” Nav. Res. Log. Quart. 11, pp. 383–406, 1964.

    Article  MathSciNet  Google Scholar 

  8. -KANTI SWAROP: “Some aspects of linear Fractional Functionals,” Australian Jour. Stat. 7, pp. 90–104, 1965.

    Article  Google Scholar 

  9. -C.E. LEMKE: “The dual method of solving the linear programming problems,” Nav. Res. Log. Quart. 1, pp, 36–47, 1954.

    Article  MathSciNet  Google Scholar 

  10. -G. HADLEY: “Linear Programming,” Addison Weslly, Reading Mass, 1962.

    MATH  Google Scholar 

  11. -S.I. GASS: “Linear Programming,” McGraw Hill, New York, 70

  12. -PROMILA ANAND: “Upper Bounds in Indefinite Quadratic Programming,” Opsearch, 6, pp. 99–108, 1969.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics, University of Delhi, India

    Promila Anand

Authors
  1. Promila Anand
    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

Anand, P. Decomposition principle for indefinite quadratic programe. Trab. Estad. Invest. Oper. 23, 61–71 (1972). https://doi.org/10.1007/BF03004948

Download citation

  • Issue Date:

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

Keywords

Search

Navigation