English  |  正體中文  |  简体中文  |  Items with full text/Total items : 70585/70585 (100%)
Visitors : 23038280      Online Users : 312
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/26325


    Title: Approximating reduced costs under degeneracy in a network flow problem with side constraints
    Authors: Yan,SY
    Contributors: 土木工程研究所
    Keywords: SENSITIVITY ANALYSIS;TOLERANCE APPROACH
    Date: 1996
    Issue Date: 2010-06-29 17:10:50 (UTC+8)
    Publisher: 中央大學
    Abstract: Reduced costs obtained from the optimal simplex tableau are not necessarily correct under degeneracy in network flow problems with side constraints. In one application, simplex reduced costs were shown not to be good when applied to actual operations, while reoptimization to find all true reduced costs was too time-consuming. An efficient algorithm to obtain approximate reduced costs was developed in the research to offset these disadvantages. The algorithm combines the uses of Lagrangian relaxation, a minimum-cost network flow algorithm, and a shortest path algorithm. In theory, the approximate reduced costs prove to be a better lower bound than are simplex reduced costs. Numerical experiments have been performed to show its potential usefulness in practice. (C) 1996 John Wiley & Sons, Inc.
    Relation: NETWORKS
    Appears in Collections:[土木工程研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML368View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明