Multiobjective mathematical programming has been one of the fastest growing areas of OR/MS during the last 15 years. This paper presents: (1) some reasons for the rapidly growing increase in interest in multiobjective mathematical programming, (2) a discussion of the advantages and disadvantages...

A branch and bound algorithm is presented which is based on the extension of implicit enumeration techniques to multiobjective zero-one linear programming and which appears to be computationally quite efficient. Domination tests, aiming at identifying paths of the enumeration tree that lead to...

This paper develops a method for interactive multiple objective linear programming assuming an unknown pseudo concave utility function satisfying certain general properties. The method is an extension of our earlier method published in this journal (Zionts, S., Wallenius, J. 1976. An interactive...

The geometric properties of the sets of efficient and weakly efficient solutions of multiple linear fractional programming problems are investigated. Weakly efficient solutions are path-connected by finitely many linear line segments when the constrained region is compact.

This paper presents a simplex-based solution procedure for the multiple objective linear fractional programming problem. By (1) departing slightly from the traditional notion of efficiency and (2) augmenting the feasible region as in goal programming, the solution procedure solves for all weakly...

Human blood is perishable. Therefore it must be systematically redistributed to hospital blood banks where it will have a high probability of transfusion. Ideally this redistribution, referred to as blood rotation, should be performed in such a manner as to minimze the outdating and improve the...

Before designing a computer program for allocating police patrol cars by time and geography, a review was undertaken of previously existing programs of this type. Nearly all of the programs calculated queuing statistics for the collection of patrol cars by assuming a steady-state system with...

Allocation of candidates to jobs is required in a situation where each candidate can only be allocated to certain jobs, and every job's "length" decreases as more candidates are allocated to it. The objective is to minimize the "ranked length vector," which is derived by arranging the...

In a transportation problem, generally, a single criterion of minimizing the total cost is considered. But in certain practical situations two or more objectives are relevant. For example, the objectives may be minimizations of total cost, consumption of certain scarce resources such as energy,...

This paper addresses the office layout problem where existing offices vary considerably as to relevant criteria and yet permanent walls make it impractical to remodel existing spaces. The major objective of this study was the equitable reassignment of 144 offices to 289 faculty and staff members...