| Article ID: | iaor19911359 |
| Country: | Japan |
| Volume: | 3 |
| Issue: | 2 |
| Start Page Number: | 1320 |
| End Page Number: | 1329 |
| Publication Date: | Feb 1990 |
| Journal: | Transactions of the Institute of Systems, Control and Information Engineers |
| Authors: | Inuiguchi Masahiro, Ichihashi Hidetomo, Kume Yasufumi. |
The modality constrained programming (MCP) problems were previously proposed by the authors. MCP problems are a sort of fuzzy mathematical programming (FMP) problems and have some analogy with the chance constrained programming (CCP) problems. In MCP problems, the probability in CCP problems is replaced by the possibility or the necessity. In this paper, the authors focus on the relationships between MCP problems and the other various FMP problems, i.e., flexible programming problem, fuzzy goal programming problem, FMP problem of Orlovsky, that of Tanaka et al., that of Inuiguchi et al. and that of Dubois. FMP problems discussed in this paper can be interpreted in the framework of MCP problems. MCP problems are the basic models for unifying FMP problems. [In Japanese.]