Description
This book makes an effort to explain the GP problem using some novel, alternative approaches. The aforementioned techniques provide a novel strategy that makes it simple to address goal programming issues and obtain better solutions. Most of the time, these techniques lessen the number of iterations while also enhancing the best outcome. Again within these methods, calculation of net evaluation can be skipped, so one can save valuable time. This book tends to suggest solutions for solving goal programming problems based on maximising profit and minimising cost by implementing new, innovative approaches to increase the algorithm’s efficiency, followed by analysis. The procedure for determining an accurate goal for each objective is to first formulate the objective function for each objective, and then, in accordance with the fundamentals of goal programming, find a solution that minimises the sum of deviations from their corresponding targets, regardless of the standards established by the authority. This book contains a total of nine chapters. Introduction to the subject and a summary of the problem are both given in chapter 1. Additionally quoted are the book’ objectives and structure. Introductional observations, a historical analysis of the relevant literature, and the future focus of the research are all included in the second chapter. The novel Alternative Simplex Approach, which offers the optimal solution to the Goal Programming Problem in fewer but more equal iterations, is the focus of the third chapter. The development of an alternate method for Goal Programming that would result in more rapid iterations than the current one is recommended in the fourth chapter. In order to provide a better solution, a modified method of locating the ideal solution to the GP Problem is given in the fifth chapter. We created an approximation algorithm to solve the goal programming problem in chapter 6, which allows for optimisation with less work. Conclusion and Future Scope are discussed in chapter 7.