| Article ID: | iaor19952283 |
| Country: | Germany |
| Volume: | 16 |
| Issue: | 4 |
| Start Page Number: | 267 |
| End Page Number: | 276 |
| Publication Date: | Dec 1994 |
| Journal: | OR Spektrum |
| Authors: | Neumayer P., Schweigert D. |
| Keywords: | programming: integer |
A problem in multiobjective programming is to determine all efficient solutions. As a first approach the authors present a basic algorithm where only one of the objective functions is minimized and the second objective function is taken as a restriction. In the next algorithm the maximum of both objective functions is minimized. In the third algorithm this minimax function is replaced by a continuous quadratic objective function.