IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v30y2004i2p207-233.html
   My bibliography  Save this article

Duality theorems and algorithms for linear programming in measure spaces

Author

Listed:
  • C.F. Wen
  • S.Y. Wu

Abstract

No abstract is available for this item.

Suggested Citation

  • C.F. Wen & S.Y. Wu, 2004. "Duality theorems and algorithms for linear programming in measure spaces," Journal of Global Optimization, Springer, vol. 30(2), pages 207-233, November.
    • Handle: RePEc:spr:jglopt:v:30:y:2004:i:2:p:207-233
    DOI: 10.1007/s10898-004-8274-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-004-8274-z
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-004-8274-z?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.

    References listed on IDEAS

    as
    1. S. Y. Wu & S. C. Fang & C. J. Lin, 1998. "Relaxed Cutting Plane Method for Solving Linear Semi-Infinite Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 99(3), pages 759-779, December.
    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. Shaojian Qu & Mark Goh & Soon-Yi Wu & Robert Souza, 2014. "Multiobjective DC programs with infinite convex constraints," Journal of Global Optimization, Springer, vol. 59(1), pages 41-58, May.

    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. Fang, S-C. & Wu, S. & Birbil, S.I., 2002. "Solving Variational Inequalities Defined on A Domain with Infinitely Many Linear Constraints," ERIM Report Series Research in Management ERS-2002-70-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    2. Mengwei Xu & Soon-Yi Wu & Jane Ye, 2014. "Solving semi-infinite programs by smoothing projected gradient method," Computational Optimization and Applications, Springer, vol. 59(3), pages 591-616, December.
    3. Mohammad R. Oskoorouchi & Hamid R. Ghaffari & Tamás Terlaky & Dionne M. Aleman, 2011. "An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application," Operations Research, INFORMS, vol. 59(5), pages 1184-1197, October.
    4. Li-Ping Pang & Jian Lv & Jin-He Wang, 2016. "Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems," Computational Optimization and Applications, Springer, vol. 64(2), pages 433-465, June.
    5. Ralf Werner, 2008. "Cascading: an adjusted exchange method for robust conic programming," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 16(2), pages 179-189, June.
    6. Soren Christensen, 2011. "A method for pricing American options using semi-infinite linear programming," Papers 1103.4483, arXiv.org, revised Jun 2011.
    7. Fang, S-C. & Wu, S. & Birbil, S.I., 2002. "Solving variational inequalities defined on a domain with infinitely many linear constraints," Econometric Institute Research Papers EI 2002-51, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.

    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:jglopt:v:30:y:2004:i:2:p:207-233. 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: 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.