scispace - formally typeset
Search or ask a question

Showing papers on "Goal programming published in 1968"


Journal ArticleDOI
TL;DR: Under suitable normality assumptions this problem is amenable to a quadratic programming formulation and the objective function consists of the maximization of the probability that a realization (in terms of target variables) will lie in a confidence region of predetermined size.
Abstract: This paper deals with the problem of attaining a set of targets (goals) by means of a set of instruments (subgoals) when the relation between the two groups of variables can be expressed with a linear system of stochastic equations. The objective function consists of the maximization of the probability that a realization (in terms of target variables) will lie in a confidence region of predetermined size. Under suitable normality assumptions this problem is amenable to a quadratic programming formulation.

120 citations


Journal ArticleDOI
TL;DR: A goal programming model for selecting media is presented which alters the objective and extends previous media models by accounting for cumulative duplicating audiences over a variety of time periods.
Abstract: A goal programming model for selecting media is presented which alters the objective and extends previous media models by accounting for cumulative duplicating audiences over a variety of time periods. This permits detailed control of the distribution of message frequencies directed at each of numerous marketing targets over a sequence of interrelated periods. This is accomplished via a new logarithmic non-reach device and a continuous lognormal generation of the discrete message frequencies.

101 citations


Journal ArticleDOI
TL;DR: In this paper, a semi-Markovian decision process is defined and the concept of returns associated with this process is introduced, and the average return per unit time that the system will get in the steady state is obtained.

38 citations


Journal ArticleDOI
TL;DR: An illustrative example is developed from an actual application of goal programming to media planning over a period of time, which involves distributions of frequencies by demographic and other characteristics as well as budget and other constraining limitations.
Abstract: An illustrative example is developed from an actual application of goal programming to media planning over a period of time. These goals involve distributions of frequencies by demographic and other characteristics as well as budget and other constraining limitations.

29 citations


Journal ArticleDOI
TL;DR: The purpose of this paper is to develop a way of looking at stochastic programming problems which is natural in statistical decision theory, to relate this approach to the previous research on linear programming under risk (in which it is implicit), and to make a detailed investigation of one type of stochastically linear programming problem within this framework.

20 citations


23 Dec 1968
TL;DR: This report uses the Personnel Automated Data Systems as a data base to develop a prototype example of its use in a goal programming model to develop net manpower requirements which take into account salary and budget data as well as stipulated manpower floors and ceilings in each relevant period.
Abstract: : Previous developments of manpower planning models involving uses of goal programming with embedded Markoff processes are extended in order to explicitly comprehend truncational effects e.g., those due to retirement, and allow for interperiod Markoff transition matrices which change over time.

7 citations


Journal ArticleDOI

5 citations


Journal ArticleDOI
D. Detchmendy1, R. Kalaba
TL;DR: A procedure for reducing the decision dimensionality in a dynamic programming calculation is presented for multi-stage decision processes for which the dimension of the decision vector is greater than thedimension of the state vector.
Abstract: A procedure for reducing the decision dimensionality in a dynamic programming calculation is presented for multi-stage decision processes for which the dimension of the decision vector is greater than the dimension of the state vector. This procedure facilitates the numerical and analytical investigations of this class of optimization problems.

1 citations