İki amaçlı karma doğrusal programlama problemleri için tam sonuç veren algoritmalar

In this thesis, objective space based exact solution algorithms for biobjective mixed integer programming problems are proposed. The algorithms solve scalarization models in order to explore predetermined regions of the objective space called boxes, de ned by two nondominated points. The initial box is de ned by the two extreme nondominated points of the Pareto frontier, which includes all nondominated points. At each iteration of the algorithms, a box is explored either by a weighted sum or a Pascoletti-Serafi ni scalarization to determine nondominated line segments and points. The rst algorithm creates new boxes immediately when it nds a nondominated point by solving Pascoletti-Serafi ni scalarization, whereas the second algorithm conducts additional operations after obtaining a nondominated point by this scalarization. Our computational experiments demonstrate the computational feasibility of the algorithms.