MINIMIZING A LINEAR FRACTIONAL FUNCTION SUBJECT TO A SYSTEM OF SUP-T EQUATIONS WITH A CONTINUOUS ARCHIMEDEAN TRIANGULAR NORM

查看全文 作　　者：Pingke LI Edward P.Fitts Department of Industrial and Systems Engineering,North Carolina State University,Raleigh,NC 27695-7906,US Shu-Cherng FANG Edward P.Fitts Department of Industrial and Systems Engineering,North Carolina State University,Raleigh,NC 27695-7906,USA;Department of Mathematical Sciences,Tsinghua University,Beijing 100084,China;College of Management,Dalian University of Technology,Dalian 116024,China.

出　　处：《Journal of Systems Science & Complexity》索引2009年第22卷第1期,共14页

基　　金：supported by the National Science Foundation of the United States under Grant No. #DMI- 0553310 摘　　要：This paper shows that the problem of minimizing a linear fractional function subject to asystem of sup-T equations with a continuous Archimedean triangular norm T can be reduced to a 0-1linear fractional optimization problem in polynomial time.Consequently,parametrization techniques,e.g.,Dinkelbach's algorithm,can be applied by solving a classical set covering problem in each iteration.Similar reduction can also be performed on the sup-T equation constrained optimization problems withan objective function being monotone in each variable separately.This method could be extended aswell to the case in which the triangular norm is non-Archimedean. 关键词：阿基米德三角形线性分式函数方程系统三角模连续性约束优化问题多项式时间

相关文献

参考文献（46）
引证文献（1）
耦合文献（0）

参考文献(46)

引证文献(1)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

MINIMIZING A LINEAR FRACTIONAL FUNCTION SUBJECT TO A SYSTEM OF SUP-T EQUATIONS WITH A CONTINUOUS ARCHIMEDEAN TRIANGULAR NORM

参考文献(46)

引证文献(1)

用户提示