<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

學術出版;;Publications

Permanent URI for this communityhdl:11536/1

收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作，涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.

Browse

🏛️國立陽明交通大學機構典藏

Author: search.filters.author.Li, HLSubject: search.filters.subject.goal programming

Search Results

Now showing 1 - 5 of 5
  • Thumbnail Image
    Item type:Item,
    An efficient method for solving linear goal programming problems
    (1996-08-01)
    Li, HL
    ;
    資訊管理與財務金融系 註：原資管所+財金所
    ;
    Department of Information Management and Finance
    This note proposes a solution algorithm for linear goal programming problems. The proposed method simplifies the traditional solution methods. Also, the proposed method is computationally efficient.
  • Thumbnail Image
    Item type:Item,
    Solve least absolute value regression problems using modified goal programming techniques
    (1998-12-01)
    Li, HL
    ;
    資訊管理與財務金融系 註：原資管所+財金所
    ;
    Department of Information Management and Finance
  • Thumbnail Image
    Item type:Item,
    A global optimization method for nonconvex separable programming problems
    (1999-09-01)
    Li, HL
    ;
    Yu, CS
    ;
    資訊管理與財務金融系 註：原資管所+財金所
    ;
    Department of Information Management and Finance
    Conventional methods of solving nonconvex separable programming (NSP) problems by mixed integer programming methods requires adding numerous 0-1 variables. In this work, we present a new method of deriving the global optimum of a NSP program using less number of 0-1 variables. A separable function is initially expressed by a piecewise linear function with summation of absolute terms. Linearizing these absolute terms allows us to convert a NSP problem into a linearly mixed 0-1 program solvable for reaching a solution which is extremely close to the global optimum. (C) 1999 Elsevier Science B.V. All rights reserved.
  • Thumbnail Image
    Item type:Item,
    A fuzzy multiobjective program with quasiconcave membership functions and fuzzy coefficients
    (2000-01-01)
    Li, HL
    ;
    Yu, CS
    ;
    資訊管理與財務金融系 註：原資管所+財金所
    ;
    Department of Information Management and Finance
    A method is proposed for solving a fuzzy multi-objective linear programming problem (FMP) with quasiconcave membership functions and fuzzy coefficients. The proposed method first expresses a piecewise function as the summation of absolute terms. Then we search for the interval where the optimal solution is allocated by finding the corresponding points with same value of membership functions. After that, the problem is solved by goal programming techniques. Comparing with other FMP methods, the proposed method does not need to add extra zero-one variables, to divide the original problem into several sub-problems, or transforming all original quasiconcave functions into concave functions. In addition, the proposed method could solve a FMP problem with fuzzy coefficients;to obtain a solution closing to a global optimum. (C) 2000 Elsevier Science B.V. All rights reserved.
  • Thumbnail Image
    Item type:Item,
    An efficient method for solving linear goal programming problems
    (1996-08-01)
    Li, HL
    ;
    交大名義發表
    ;
    資訊管理與財務金融系 註：原資管所+財金所
    ;
    National Chiao Tung University
    ;
    Department of Information Management and Finance
    This note proposes a solution algorithm for linear goal programming problems. The proposed method simplifies the traditional solution methods. Also, the proposed method is computationally efficient.