In this paper we are considering an Organization with a central unit and several subunits. The central unit has to solve a coordination problem for the whole Organization, which can be stated as: How can the decisions concerning future acts needing scarce resources being at the central unit's...

In this paper we are considering an Organization with a central unit and several subunits. The central unit has to solve a coordination problem for the whole Organization, which can be stated as: How can the decisions concerning future acts needing scarce resources being at the central unit's...

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...

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...

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...

A computer program has been designed for specifying the number of police patrol cars that should be on duty in each geographical command of a city at various times of day on each day of the week. It incorporates, by user option, nearly all the desirable features of earlier allocation programs,...

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 considers a bicriterion scheduling problem where a linear combination of two objective functions is considered, with weighting factors used to represent relative importance of the two criteria, i.e., total flowtime and range of lateness. A branch-and-bound solution procedure is...

In this note we consider the validity of substituting a linear goal for a fractional goal in a mathematical program and provide a simple geometric interpretation that contrasts the essential differences between the two programs.