Topic
Goal programming
About: Goal programming is a research topic. Over the lifetime, 4330 publications have been published within this topic receiving 117758 citations.
Papers published on a yearly basis
Papers
More filters
••
01 Jan 1979TL;DR: In this paper, a general problem involving the single-pass, single-point turning operation is introduced and a multiple criteria machining problem is formulated and solved using goal programming techniques.
Abstract: In this paper, a general problem involving the single-pass, single-point turning operation is introduced. Different mathematical models and solution approaches for solving various single objective problems are described. The mathematical properties of the minimization of cost and maximization of production rate solutions are discussed in detail. The solution approaches used are differential calculus, linear programming, and geometric programming. Finally, a multiple criteria machining problem is formulated and solved using goal programming techniques.
49 citations
••
TL;DR: A fuzzy approach is proposed, which induces some methodologies as special cases, for solving the multiple objective linear programming problem.
49 citations
••
TL;DR: A generalized goal programming model is used to resolve a real-world human resource allocation problem involving allocating teachers to 22 private schools in St. Louis, Missouri and provides a solution that balances cost minimization with preference goals of the teachers, administrators, and schools.
Abstract: A generalized goal programming model is used to resolve a real-world human resource allocation problem involving allocating teachers to 22 private schools in St. Louis, Missouri. The model provides a solution that balances cost minimization with preference goals of the teachers, administrators, and schools.
49 citations
••
TL;DR: The integer goal programming formulation in this paper is combined with a procedure which recognizes both explicit and implicit articulation points within the water distribution network to ensure that such weaknesses are excluded from the final solution.
Abstract: An integer goal programming based approach to maximize reliability in water distribution networks is developed. Previous work has shown that graphs which are inherently the most invulnerable to failure have the same number of links incident at each node, i.e. they are regular in degree. The converse of this statement is not true. Regular graphs can contain weaknesses such as bridges, articulation nodes, and even total disconnections. The integer goal programming formulation in this paper is combined with a procedure which recognizes both explicit and implicit articulation points within the water distribution network to ensure that such weaknesses are excluded from the final solution. The integer program component of the approach attempts to maximize regularity within the network. In the goal programming context this is achieved by minimizing the sum of the deviations, at each node, in terms of the number of links incident upon it, from the average number of links incident on a node over the whole...
49 citations
••
TL;DR: This paper presents a fuzzy goal programming approach to determine an optimal compromise solution for the multiobjective transportation problem and shows that the proposed method and the fuzzy programming method are equivalent.
Abstract: Several fuzzy approaches can be considered for solving multi-objective transportation problem. This paper presents a fuzzy goal programming approach to determine an optimal compromise solution for the multiobjective transportation problem. We assume that each objective function has a fuzzy goal. Also we assign a special type of nonlinear (hyperbolic) membership function to each objective function to describe each fuzzy goal. The approach focuses on minimizing the negative deviation variables from 1 to obtain a compromise solution of the multiobjective transportation problem. We show that the proposed method and the fuzzy programming method are equivalent. In addition, the proposed approach can be applied to solve other multiobjective mathematical programming problems. A numerical example is given to illustrate the efficiency of the proposed approach.
49 citations