A BELIEF DEGREE CONSTRAINED PROGRAMMING MODEL FOR MAXIMUM CUT PROBLEM WITH UNCERTAIN EDGE WEIGHTS
Isnaini, Rosyida (2021) A BELIEF DEGREE CONSTRAINED PROGRAMMING MODEL FOR MAXIMUM CUT PROBLEM WITH UNCERTAIN EDGE WEIGHTS. Proceedings of the 11th Annual International Conference on Industrial Engineering and Operations Management Singapore, 11. ISSN 2169-8767
PDF
Download (869kB) |
Abstract
The traditional maximum cut problem assumes that the edge weights are crisp values or random variables. However, the edge weight in maximum cut problem has real and concrete implications in real life application, so it is more suitable to char- acterize the edge weights as uncertain variables. In this paper, the maximum cut problem in uncertain environment is considered. We originally propose a belief degree constrained programming model for uncertain maximum cut problem. Furthermore, we convert the model into its equivalent deterministic form which can be solved by classic programming methods. Finally, a numerical example is presented to show the application of the model.
Item Type: | Article |
---|---|
Subjects: | B Philosophy. Psychology. Religion > BF Psychology > Counseling B Philosophy. Psychology. Religion > BF Psychology > Attitude |
Fakultas: | Fakultas Matematika dan Ilmu Pengetahuan Alam > Matematika, S1 |
Depositing User: | setyarini unnes |
Date Deposited: | 04 Aug 2021 03:01 |
Last Modified: | 04 Aug 2021 03:01 |
URI: | http://lib.unnes.ac.id/id/eprint/44417 |
Actions (login required)
View Item |