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

A smooth penalty function algorithm for network-structured problems

Author

Listed:
  • Zenios, Stavros A.
  • Pinar, Mustafa C.
  • Dembo, Ron S.

Abstract

No abstract is available for this item.

Suggested Citation

  • Zenios, Stavros A. & Pinar, Mustafa C. & Dembo, Ron S., 1995. "A smooth penalty function algorithm for network-structured problems," European Journal of Operational Research, Elsevier, vol. 83(1), pages 220-236, May.
    • Handle: RePEc:eee:ejores:v:83:y:1995:i:1:p:220-236
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(95)90601-A
    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. Robert E. Bixby & Robert Fourer, 1988. "Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics," Management Science, INFORMS, vol. 34(3), pages 342-376, March.
    2. Mustafa C. Pinar & Stavros A. Zenios, 1992. "Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm," INFORMS Journal on Computing, INFORMS, vol. 4(3), pages 235-249, August.
    3. Soren S. Nielsen & Stavros A. Zenios, 1993. "A Massively Parallel Algorithm for Nonlinear Stochastic Network Problems," Operations Research, INFORMS, vol. 41(2), pages 319-337, April.
    4. Israel Zang, 1981. "Discontinuous Optimization by Smoothing," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 140-152, 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. Mijangos, E., 2005. "An efficient method for nonlinearly constrained networks," European Journal of Operational Research, Elsevier, vol. 161(3), pages 618-635, March.
    2. Richard D. McBride & John W. Mamer, 2004. "Implementing an LU Factorization for the Embedded Network Simplex Algorithm," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 109-119, 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. Dan Trietsch, 1985. "Optimal Motion Towards a Stochastic Destination," Discussion Papers 654, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    2. Paola Cappanera & Antonio Frangioni, 2003. "Symmetric and Asymmetric Parallelization of a Cost-Decomposition Algorithm for Multicommodity Flow Problems," INFORMS Journal on Computing, INFORMS, vol. 15(4), pages 369-384, November.
    3. Achim Wechsung & Paul Barton, 2014. "Global optimization of bounded factorable functions with discontinuities," Journal of Global Optimization, Springer, vol. 58(1), pages 1-30, January.
    4. J. Gondzio, 1994. "Preconditioned Conjugate Gradients in an Interior Point Method for Two-stage Stochastic Programming," Working Papers wp94130, International Institute for Applied Systems Analysis.
    5. Og[caron]uzsoy, Cemal Berk & Güven, Sibel, 2007. "Robust portfolio planning in the presence of market anomalies," Omega, Elsevier, vol. 35(1), pages 1-6, February.
    6. Taesung Hwang & Yanfeng Ouyang, 2015. "Urban Freight Truck Routing under Stochastic Congestion and Emission Considerations," Sustainability, MDPI, vol. 7(6), pages 1-16, May.
    7. Sodhi, ManMohan S. & Tang, Christopher S., 2009. "Modeling supply-chain planning under demand uncertainty using stochastic programming: A survey motivated by asset-liability management," International Journal of Production Economics, Elsevier, vol. 121(2), pages 728-738, October.
    8. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
    9. De Waegenaere, A.M.B. & Wielhouwer, J.L., 2001. "A Partial Ranking Algorithm for Resource Allocation Problems," Other publications TiSEM 8b2e0185-36f9-43df-8a3d-d, Tilburg University, School of Economics and Management.
    10. Diana Barro & Elio Canestrelli, 2005. "Time and nodal decomposition with implicit non-anticipativity constraints in dynamic portfolio optimization," GE, Growth, Math methods 0510011, University Library of Munich, Germany.
    11. Wielhouwer, J.L., 2002. "Optimal tax depreciation and its effects on optimal firm investments," Other publications TiSEM 822d5150-6b3a-463a-8001-4, Tilburg University, School of Economics and Management.
    12. Bjarne Grimstad & Brage R. Knudsen, 2020. "Mathematical programming formulations for piecewise polynomial functions," Journal of Global Optimization, Springer, vol. 77(3), pages 455-486, July.
    13. Siva Sankaran & Tung Bui, 2008. "An organizational model for transitional negotiations: concepts, design and applications," Group Decision and Negotiation, Springer, vol. 17(2), pages 157-173, March.
    14. Bretthauer, Kurt M. & Shetty, Bala, 2002. "The nonlinear knapsack problem - algorithms and applications," European Journal of Operational Research, Elsevier, vol. 138(3), pages 459-472, May.
    15. De Waegenaere, A.M.B. & Wielhouwer, J.L., 2001. "A Partial Ranking Algorithm for Resource Allocation Problems," Discussion Paper 2001-40, Tilburg University, Center for Economic Research.
    16. Claude Lemaréchal & Adam Ouorou & Georgios Petrou, 2009. "A bundle-type algorithm for routing in telecommunication data networks," Computational Optimization and Applications, Springer, vol. 44(3), pages 385-409, December.
    17. Ali, Agha Iqbal & Han, Hyun-Soo, 1998. "Computational implementation of Fujishige's graph realizability algorithm," European Journal of Operational Research, Elsevier, vol. 108(2), pages 452-463, July.
    18. A. Ouorou & P. Mahey & J.-Ph. Vial, 2000. "A Survey of Algorithms for Convex Multicommodity Flow Problems," Management Science, INFORMS, vol. 46(1), pages 126-147, January.
    19. J. H. Wu, 1997. "Modified Primal Path-Following Scheme for the Monotone Variational Inequality Problem," Journal of Optimization Theory and Applications, Springer, vol. 95(1), pages 189-208, October.
    20. Richard D. McBride & John W. Mamer, 2004. "Implementing an LU Factorization for the Embedded Network Simplex Algorithm," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 109-119, May.

    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:83:y:1995:i:1:p:220-236. 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.