Optimization approaches to possibilistic linear programming problems

被引：0
|
作者：
Inuiguchi, M [1 ]
Tanino, T [1 ]
Tanaka, H [1 ]
机构：
[1] Osaka Univ, Dept Elect & Informat Sci, Grad Sch Engn, Suita, Osaka, Japan
来源：
JOINT 9TH IFSA WORLD CONGRESS AND 20TH NAFIPS INTERNATIONAL CONFERENCE, PROCEEDINGS, VOLS. 1-5 | 2001年
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper, we describe optimization approaches to possibilistic linear programming problems. Especially, achievement rate approaches are developed. Solution algorithms under a given fuzzy goal and under unknown goal are designed based on the relaxation procedure.
引用
收藏
页码：2724 / 2729
页数：6
相关论文
共 50 条
12345