IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v109y2001i3d10.1023_a1017507519943.html
   My bibliography  Save this article

New Algorithm for the Conical Combination Representation Problem of a Vector

Author

Listed:
  • H. X. Huang

    (Tsinghua University)

  • P. M. Pardalos

    (University of Florida)

Abstract

An important problem in constrained optimization is to determine whether or not a vector can be represented as the conical combination (i.e., linear nonnegative combination) of some given vectors. This problem can be transformed into a special linear programming problem (SLP). A new approach, the variable-dimension boundary-point algorithm (VDBPA), based on the projection of a vector into a variable-dimension subspace, is proposed to solve this problem. When a conical combination representation (CCR) of a vector exists, the VDBPA can compute its CCR coefficients; otherwise, the algorithm certificates the nonexistence of such representation. In order to assure convergence, the VDBPA may call the lexicographically ordered method (LOM) for linear programming at the final stage. In fact, the VDBPA terminates often by solving SLP for most instances before calling the LOM. Numerical results indicate that the VDBPA works more efficiently than the LOM for problems that have more variables or inequality constraints. Also, we have found instances of the SLP, when the number of inequality constraints is about twice the number of variables, which are much more difficult to solve than other instances. In addition, the convergence of the VDBPA without calling the LOM is established under certain conditions.

Suggested Citation

  • H. X. Huang & P. M. Pardalos, 2001. "New Algorithm for the Conical Combination Representation Problem of a Vector," Journal of Optimization Theory and Applications, Springer, vol. 109(3), pages 495-519, June.
    • Handle: RePEc:spr:joptap:v:109:y:2001:i:3:d:10.1023_a:1017507519943
    DOI: 10.1023/A:1017507519943
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1017507519943
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1017507519943?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    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:spr:joptap:v:109:y:2001:i:3:d:10.1023_a:1017507519943. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.