scispace - formally typeset
Search or ask a question

Showing papers on "Goal programming published in 1972"


Book
01 Jan 1972

933 citations


Journal ArticleDOI
TL;DR: An algorithm which requires interaction with the relevant decision-maker in order to obtain certain information regarding his utility function defined over the permissible values of the criteria is presented.
Abstract: The use of goal programming for the solution of the multiple criteria problem is discussed. An extension of this use is presented in the form of an algorithm which requires interaction with the relevant decision-maker in order to obtain certain information regarding his utility function defined over the permissible values of the criteria. This algorithm provides a bridge between goal programming and recently suggested interactive strategies for the optimization of the multiple criteria problem.

223 citations



Journal ArticleDOI
TL;DR: In this paper, it is argued that costbenefit analysis essentially belongs to the first group and that the differences between the industrial and public sectors (as far as O.R. is concerned) are not related to differences between optimizing and satisficing philosophies.
Abstract: Most problems in management involve multiple goals and two approaches to solving managerial problems have been suggested: optimizing and satisficing. The first covers methods of trade-offs, optimizing in tandem, conversion of goals into constraints and goal programming. The second mainly centres on norm setting and on interval programming. It is argued that cost-benefit analysis essentially belongs to the first group and that, contrary to some suggestions, the differences between the industrial and public sectors (as far as O.R. is concerned) are not related to differences between the optimizing and satisficing philosophies.

59 citations


Journal ArticleDOI
01 Oct 1972-Infor
TL;DR: The authors conclude that goal-programming is a most useful tool for manpower planning.
Abstract: The authors have constructed a goal programming model of the manpower system for officers within the Canadian Forces The model forms part of a control system for fixing promotion quotas and strengths for the various rank levels in many occupational classifications over a planning horizon of three years The form of the constraints is set out, and the method used by the authors to determine the objective function weights is outlined The control system provides a fast response time and measurements indicate that it is successful in attaining the aims of the planners An example of the use of the system to evaluate proposed manning policies is given The authors conclude that goal-programming is a most useful tool for manpower planning

47 citations


Journal ArticleDOI
TL;DR: The problem of population location in a metropolitan area is treated in an analytic model employing a goal programming formulation and a target population is broken into groups which then compete for a share of limited capacity in a number of urban sectors.
Abstract: Recent efforts in the area of modelling activities in the urban environment have been concentrated on the use of simulation techniques. In this paper the problem of population location in a metropolitan area is treated in an analytic model employing a goal programming formulation. A target population is broken into groups which then compete for a share of limited capacity in a number of urban sectors. The possible usefulness of this approach to urban planning, real estate development, and transportation systems design is illustrated through the theoretical development and the presentation of a numerical model.

30 citations


Journal ArticleDOI
TL;DR: In this article, a class of probabilistic constrained programming problems with concave functions is considered, and it is shown that the function of the left function is the same as that of the right function.
Abstract: A class of probabilistic constrained programming problems are considered where the probabilistic constraint is of the form and the functions are concave. I t is shown that the function of the left ...

20 citations


Journal ArticleDOI
TL;DR: An algorithm for obtaining the growth path of a logistics system modelled as a transportation problem with a linear cost structure and lower bounds on supply from each origin and to each destination is provided.
Abstract: This paper considers a logistics system modelled as a transportation problem with a linear cost structure and lower bounds on supply from each origin and to each destination. We provide an algorithm for obtaining the growth path of such a system, i. e., determining the optimum shipment patterns and supply levels from origins and to destinations, when the total volume handled in the system is increased. Extensions of the procedure for the case when the costs of supplying are convex and piecewise linear and for solving transportation problems that are not in “standard form” are discussed. A procedure is provided for determining optimal plant capacities when the market requirements have prespecified growth rates. A goal programming growth model where the minimum requirements are treated as goals rather than as absolute requirements is also formulated.

13 citations


01 Feb 1972
TL;DR: A new algorithm for multi-attribute assignment models is presented, built around the concept of a biased quadratic objective, which proceeds via a sequence of related assignments.
Abstract: : A new algorithm for multi-attribute assignment models is presented. Built around the concept of a biased quadratic objective, it proceeds via a sequence of related assignments. Optional stopping is applied when an approximation to the optimum assignment is identified. A second part of the paper deals with manpower planning and organization designs which interact dynamically. A spectral analysis approach is utilized to obtain estimates of career patterns and aspirations in terms of observed and potential transition problems. Goal programming approaches are utilized in both parts of this paper. This is done not only to relate them to each other but also to relate these developments to prior modeling efforts which the authors have undertaken in related areas of manpower planning. (Author)

6 citations


Book
01 Jan 1972
TL;DR: It is demonstrated that multiobjective programming in a combinatoric medium is feasible both methodologically and computationally.
Abstract: Assignment of personnel is a task involving a multiplicity of simultaneous goals. It is demonstrated that multiobjective programming in a combinatoric medium is feasible both methodologically and computationally. FollowingGeoffrion, it is assumed that the decision-maker has in mind an implicit function mapping the numerical values of the objectives to the real line. The proposed strategy consists in the decision-maker choosing first- and second-best assignments from a given set, in each stage of a decision-tree-like-procedure. The computation is reducible to well-known problems of assignment and shortest routes, for which efficient solution techniques exist.

3 citations


01 Apr 1972
TL;DR: Recent developments in chance-constrained programming both published, unpublished and new are presented in a framework which unifies the many variants of probabilistic programming under the rubric of chance- constrained programming.
Abstract: : Selected recent developments in chance-constrained programming both published, unpublished and new, are presented in a framework which unifies the many variants of probabilistic programming under the rubric of chance- constrained programming. Developments presented range from two stage linear programming under uncertainty, through acceptance region theory, and cross chance-constrained games.