Showing papers on "Goal programming published in 1973"
TL;DR: In this paper the applications of goal programming to industrial and economic planning are reviewed, and it is shown how the linear programming framework can be extended to include a series of goals (or objectives).
Abstract: In this paper the applications of goal programming to industrial and economic planning are reviewed, and it is shown how the linear programming framework can be extended to include a series of goals (or objectives). A planning method is suggested in which the decision maker is presented with a list of all the possible attainable goals from which he picks the most appropriate set.
176 citations
TL;DR: In this article, the goal programming approach is utilized in order to allow for the optimization of multiple conflicting goals while permitting an explicit consideration of the existing decision environment, the priority structure of these objectives, various environmental constraints, unique organizational values of the firm, and bureaucratic decision structures.
Abstract: Virtually all models developed for transportation problems have focused upon the optimization of a single objective criterion, namely the minimization of total transportation costs. They have generally neglected or often ignored the multiple conflicting objectives involved in the problem, the priority structure of these objectives, various environmental constraints, unique organizational values of the firm, and bureaucratic decision structures. However, in reality these are important factors which greatly influence the decision process of transportation problems. In this study the goal programming approach is utilized in order to allow for the optimization of multiple conflicting goals while permitting an explicit consideration of the existing decision environment.
114 citations
TL;DR: In this article, the equivalences between convex goal programming models and full row rank-interval programming problems are established, which are useful in their own right and for other classes of problems such as interval programming, as well as advanced start procedures and other such computational matters.
Abstract: Goal programming has now become an important tool in areas such as public management science. There is therefore a need for examining ways of securing improved computational efficiency, as is done in this paper, instead of resting only on the linear programming equivalences that were set forth when the original goal programming article was published in Vol. 1, No. 2 of Management Science. Based on lemmata which permit reduction of various important classes of convex goal programming models to problems of full row rank-interval programming type, explicit solutions to convex goal programming problems are exhibited. Some of the equivalences herein established are also useful in their own right and for other classes of problems—e.g., interval programming—as well as advanced start procedures and other such computational matters.
24 citations
TL;DR: This paper focuses on the development of a method for evaluating the accuracy of least-Squares Regression computer programs using a computer program called a Monte Carlo simulation.
Abstract: of the User,\" Journal of the American Statistical Association, 62 (September 1967), 819-41. 2. Mullet, Gary M. and Tracy W. Murray. \"A New Method for Examining Rounding Error in Least-Squares Regression Computer Programs,\" Journal of the American Statistical Association, 66 (September 1971), 496-8. 3. Wampler, Roy H. \"A Report on the Accuracy of Some Widely Used Least Squares Computer Programs,\" Journal of the American Statistical Association, 65 (June 1970), 549-65.
3 citations