IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v80y1995i2p431-438.html
   My bibliography  Save this article

An algorithm to determine boundedness of quadratically constrained convex quadratic programmes

Author

Listed:
  • Caron, Richard J.
  • Obuchowska, Wieslawa T.

Abstract

No abstract is available for this item.

Suggested Citation

  • Caron, Richard J. & Obuchowska, Wieslawa T., 1995. "An algorithm to determine boundedness of quadratically constrained convex quadratic programmes," European Journal of Operational Research, Elsevier, vol. 80(2), pages 431-438, January.
  • Handle: RePEc:eee:ejores:v:80:y:1995:i:2:p:431-438
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(93)E0244-R
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Caron, R. J. & Obuchowska, W., 1992. "Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints," European Journal of Operational Research, Elsevier, vol. 63(1), pages 114-123, November.
    2. Cole, F. & Ecker, J. G. & Gochet, W., 1982. "A reduced gradient method for quadratic programs with quadratic constraints and lp-constrained lp-approximation problems," European Journal of Operational Research, Elsevier, vol. 9(2), pages 194-203, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Caron, Richard J. & Obuchowska, Wieslawa T., 1996. "Quadratically constrained convex quadratic programmes: faulty feasible regions," European Journal of Operational Research, Elsevier, vol. 94(1), pages 134-142, October.
    2. Obuchowska, Wieslawa T., 1998. "Infeasibility analysis for systems of quadratic convex inequalities," European Journal of Operational Research, Elsevier, vol. 107(3), pages 633-643, June.
    3. Obuchowska, W. T. & Murty, K. G., 2001. "Cone of recession and unboundedness of convex functions," European Journal of Operational Research, Elsevier, vol. 133(2), pages 409-415, January.
    4. Wiesława Obuchowska, 2007. "Conditions for boundedness in concave programming under reverse convex and convex constraints," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 65(2), pages 261-279, April.
    5. Wiesława Obuchowska, 2010. "Unboundedness in reverse convex and concave integer programming," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 72(2), pages 187-204, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Obuchowska, Wiesława T., 2014. "Feasible partition problem in reverse convex and convex mixed-integer programming," European Journal of Operational Research, Elsevier, vol. 235(1), pages 129-137.
    2. Wiesława Obuchowska, 2007. "Conditions for boundedness in concave programming under reverse convex and convex constraints," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 65(2), pages 261-279, April.
    3. Obuchowska, Wiesława T., 2012. "Feasibility in reverse convex mixed-integer programming," European Journal of Operational Research, Elsevier, vol. 218(1), pages 58-67.
    4. Wiesława Obuchowska, 2010. "Unboundedness in reverse convex and concave integer programming," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 72(2), pages 187-204, October.
    5. Caron, Richard J. & Obuchowska, Wieslawa T., 1996. "Quadratically constrained convex quadratic programmes: faulty feasible regions," European Journal of Operational Research, Elsevier, vol. 94(1), pages 134-142, October.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:80:y:1995:i:2:p:431-438. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.