(A) heuristic for the multiple choice programming with multiple objectives

Abstract

This thesis presents a heuristic for the multiple choice programming problem that has multiple objectives. It performs a sequence of pivots and tests aiming at only one basic variable in each choice set and then improve the integer feasible solution by exchange operations. The computational experiments provide an evidence of how efficiently our procedure handles the multiple objectives and the computational efficiency and accuracy are examined as compared with single objective multiple choice programming [9]. In addition, the relations to goal programming are also provided.