Showing papers on "Goal programming published in 1974"

A Goal Programming Approach to Aggregate Planning of Production and Work Force

Abstract: This paper presents a goal programming approach to the problem of scheduling aggregate production and work force. The approach is illustrated via two case applications. Numeric results are derived and compared to those of two other approaches. The results suggest that goal programming may be an effective approach for solving certain types of planning models.

Resource Planning in University Management by Goal Programming

Abstract: Resource-planning methods for university and college management have received increasing attention by management scientists in recent years. One widely known approach yields cost-simulation models such as RRPM and CAMPUS. However, these models have two serious limitations in representing resource-management problems: (1) budget levels are outputs of the models, not inputs, and (2) faculty levels are a fixed function of enrollment. This paper proposes a goal-programming model that relieves these limitations and offers other features as well; in it the goals are faculty instruction loads, staff-to-faculty ratios, faculty distribution by rank, and teaching-assistant-to-faculty ratios. These specified goals are achieved as closely as possible, subject to constraints on the projected budget available in each year of the planning horizon and to faculty-flow constraints. The decision variables are the faculty, staff, and teaching-assistant levels in each of several academic units over the planning horizon. The m...

Stochastic Programming and Decision Analysis: An Apparent Dilemma

Abstract: An example is given which demonstrates that using a decision theory analysis for the basic chance-constrained model of stochastic linear programming may lead to an apparent dilemma, namely, 0 > EVSI > EVPI. The problem is discussed and a resolution suggested.

On integer fractional programming

Abstract: Abstra.ct An algorithm to solve integer linear fractional programming problems is proposed. The procedure is reduced to the solution of a sequence of integer linear subproblems. The number of subproblems necessary to be solved is expected to be fairly smaIl, and the finite convergence to the global optimum is guaranteed. Some properties of the algorithm including the relations to the generalized Lagrangian method and to continuous fractional programming are discussed. Besides, the application to some goal programming problems is de­ scribed by an example.

Goal Programming for Marketing Decisions: A Case Study

Abstract: T HE reality of business management requires that individual actions taken with respect to particular business functions be evaluated for their probable overall impact. Marketing actions are no exception. Before resources are committed to a marketing proposal, management needs to determine as efficiently as possible the probable results for each of the identified, admissible alternative courses of action. Contemplated marketing actions must be pretempered by careful analysis as to their likely effects on other functional activities and their potential contributions at every level in the organization's hierarchy of goals. Fortunately, the decision sciences have evolved to a point where such careful, efficient analysis is now practicable through the application of mathematical and, specifically, goal programming. Of course, such techniques do not obviate the need for a decision. The contribution of goal programming derives from its structure, which permits logical, sequential progression through analyses that heretofore were largely dependent on intuitive appeals and experience-based judgments. Unlike other quantitative techniques such as linear programming, goal programming provides a way for managers to determine the extent to which several conflicting goals may be realized simultaneously. The following problem and its solution via a goal programming model demonstrate one way that analyses of multifaceted problems or opportunities can be improved with reasonable investments of time and effort.

A Goal-Programming Approach to Planning for Population Balance in a Multiregional System:

Abstract: This paper is concerned with the problem of settlement or resettlement of a remote region through the development of a collection of interacting human settlements. It is assumed that the government specifies a fixed development budget for housing and economic programs, as well as desired population growth profiles in time and space for the planning horizon. Goal programming is used to find the spatial–temporal scheduling of new housing construction, and development of job opportunities, that minimizes the sum of the weighted deviations between predicted and desired population trajectories over all regions. Benefits and limitations of the proposed model are proffered, as well as an exposition of related work in the literature.

Goal Programming for Marketing Decisions: A Case Study: A New Tool is Provided for the Simultaneous Solution of Conflicting Marketing Goals

Abstract: T HE reality of business management requires that individual actions taken with respect to particular business functions be evaluated for their probable overall impact. Marketing actions are no exception. Before resources are committed to a marketing proposal, management needs to determine as efficiently as possible the probable results for each of the identified, admissible alternative courses of action. Contemplated marketing actions must be pretempered by careful analysis as to their likely effects on other functional activities and their potential contributions at every level in the organization's hierarchy of goals.