Interactive Methods for Multi-Objective Integer Linear Programming
For the last 15 years, many Multi-Objective Linear Programming (MOLP) methods with continuous solutions have been developed. In many real world applications, however, discrete variables must be introduced representing, for instance, an investment choice, a production level, etc. The linear mathematical structure is then Integer Linear Programming (ILP), associated with MOLP giving a MOILP problem. Unfortunately, this type of problems has its own difficulties, as it cannot be solved by simply combining ILP and MOLP methods.
Unable to display preview. Download preview PDF.
- K. Huckert, R. Rhode, O. Roglin, R. Weber, “On the Interactive Solution to a Multi-Criteria Scheduling Problem”, in : Z.Oper.Res., Vol 24 (1980), pp. 47–60.Google Scholar
- R. Jaikumar, B. Fisheries, “A Heuristic 0–1 Algorithm with Multiple Objectives and Constraints”, in : J.L. Cochrane, M. Zeleny, Eds., Multiple Criteria Decision Making (University of South Carolina Press, 1973), pp. 745–748.Google Scholar
- R. Slowinski, J. Weglarz, “An Interactive Algorithm for Multi-Objective Precedence and Resource Constrained Scheduling Problems”, in : W. Urietholl, J. Visser, H.H. Boerma, Eds., Proceedings 8th International Congress (North Holland, 1985), pp. 866–873.Google Scholar
- J. Teghem Jr., P.L. Kunsch, “Characterization of Efficient Solutions for Multi-Objective Integer Linear Programming”, in : Technical Report (Faculté Polytechnique de Mons, Belgium, 1985), submitted for publication.Google Scholar