Finding nadir points in multi-objective integer programs

Koksalan M., LOKMAN B.

JOURNAL OF GLOBAL OPTIMIZATION, cilt.62, sa.1, ss.55-77, 2015 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 62 Sayı: 1
  • Basım Tarihi: 2015
  • Doi Numarası: 10.1007/s10898-014-0212-0
  • Dergi Adı: JOURNAL OF GLOBAL OPTIMIZATION
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.55-77
  • Anahtar Kelimeler: Multi-objective, Integer programming, Nadir point, VALUES
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

We address the problem of finding the nadir point in a multi-objective integer programming problem. Finding the nadir point is not straightforward, especially when there are more than three objectives. The difficulty further increases for integer programming problems. We develop an exact algorithm to find the nadir point in multi-objective integer programs with integer-valued parameters. We also develop a variation that finds bounds for each component of the nadir point with a desired level of accuracy. We demonstrate on several instances of multi-objective assignment, knapsack, and shortest path problems that the algorithms work well.