淡江大學機構典藏:Item 987654321/64904
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 55968/90025 (62%)
Visitors : 11523832      Online Users : 92
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/64904


    Title: Fuzzy approach for multi-level programming problems
    Authors: 時序時;Shih, Hsu-shih;Lai, Y. J.;Lee, E. S.
    Contributors: 淡江大學經營決策學系
    Date: 1996-01
    Issue Date: 2011-10-20 16:09:04 (UTC+8)
    Abstract: Multi-level programming techniques are developed to solve decentralized planning problems with multiple decision makers in a hierarchical organization. These become more important for contemporary decentralized organizations where each unit or department seeks its own interests. Traditional approaches include vertex enumeration and transformation approaches. The former is in search of a compromise vertex based on adjusting the control variable(s) of the higher level and thus is rather inefficient. The latter transfers the lower-level programming problem to be the constraints of the higher level by its Kuhn-Tucker conditions or penalty function; the corresponding auxiliary problem becomes non-linear and the decision information is also implicit. In this study, we use the concepts of tolerance membership functions and multiple objective optimization to develop a fuzzy approach for solving the above problems. The upper-level decision maker defines his or her objective and decisions with possible tolerances which are described by membership functions of fuzzy set theory. This information then constrains the lower-level decision maker's feasible space. A solution search relies on the change of membership functions instead of vertex enumeration and no higher order constraints are generated. Thus, the proposed approach will not increase the complexities of original problems and will usually solve a multilevel programming problem in a single iteration. To demonstrate our concept, we have solved numerical examples and compared their solutions with classical solutions.
    Relation: Computers and operations research 23(1), pp.73-91
    DOI: 10.1016/0305-0548(95)00007-9
    Appears in Collections:[Department of Management Sciences] Journal Article

    Files in This Item:

    File SizeFormat
    index.html0KbHTML40View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback