## Multiple objective programming with piecewise linear functions

• An approach to generating all efficient solutions of multiple objective programs with piecewise linear objective functions and linear constraints is presented. The approach is based on the decomposition of the feasible set into subsets, referred to as cells, so that the original problem reduces to a series of lenear multiple objective programs over the cells. The concepts of cell-efficiency and complex-efficiency are introduced and their relationship with efficiency is examined. A generic algorithm for finding efficent solutions is proposed. Applications in location theory as well as in worst case analysis are highlighted.

### Additional Services

Author: Stefan Nickel, M. Wiecek urn:nbn:de:hbz:386-kluedo-4571 Report in Wirtschaftsmathematik (WIMA Report) (16) Preprint English 1999 1999 Technische Universität Kaiserslautern 2000/04/03 Fachbereich Mathematik 5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011

$Rev: 13581$