Another Efficient Method of Solving Weighted Goal Programming Problem
Literature recorded that articles that used weighted goal programming in pre-1990 application papers is 25% whereas its use in the period 1990–2000 is 41%. The reasons for this increment are due to the greater flexibility by the weighted goal programming, and the aim of the decision makers to do more ‘trade-off’ analysis and direct comparison between goals. An efficient solution algorithm for solving weighted goal programming problems is presented. The algorithm incorporates rigid constraints in the model and utilized variant of simplex method. A step by step illustration of the procedure is provided. The computational method is efficient.
- There are currently no refbacks.
©2019 Science Asia