Generating representative nondominated point subsets in multi-objective integer programs

---

Tezin Türü: Yüksek Lisans

Tezin Yürütüldüğü Kurum: Orta Doğu Teknik Üniversitesi, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümü, Türkiye

Tezin Onay Tarihi: 2014

Öğrenci: GÖKHAN CEYHAN

Danışman: BANU LOKMAN

Özet:

In this thesis, we study generating a subset of all nondominated points of multi-objective integer programs in order to represent the nondominated frontier. Our motivation is based on the fact that generating all nondominated points of a multi-objective integer program is neither practical nor useful. The computational burden could be prohibitive and the resulting set could be huge. Instead of finding all nondominated points, we develop algorithms to generate a small representative subset of nondominated points. In order to assess the quality of representative subsets, we conduct computational experiments on randomly generated instances of combinatorial optimization problems and show that the algorithms work well.