๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Multiple objective programming with piecewise linear functions

โœ Scribed by Stefan Nickel; Margaret M. Wiecek


Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
135 KB
Volume
8
Category
Article
ISSN
1057-9214

No coin nor oath required. For personal study only.

โœฆ Synopsis


An approach to generating all efficient solutions for 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 single objective linear programs and feasibility tests 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 efficient solutions for bi-objective piecewise linear programs is proposed. Applications in location theory as well as in worst case analysis are highlighted.


๐Ÿ“œ SIMILAR VOLUMES


Using Lexicographic Parametric Programmi
โœ Pekka Korhonen; Merja Halme ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 650 KB

In this paper we propose an approach which makes it possible to search non-dominated and only non-dominated solutions in multiple-objective linear programming. The approach is based on the use of a reference direction and lexicographic parametric programming. The requisite theory is developed in the

A non-linear utility theory with multipl
โœ W.K. Brauers ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 125 KB

The aim of this paper is to make optimum several objectives at the same time which would enable a measurement of utility for several possible alternatives. The problem is solved if a strong or weak dominance exists between the alternatives, otherwise a set of incomparable alternatives would be prese