Please use this identifier to cite or link to this item:
http://hdl.handle.net/10603/462881
Title: | Study of Optimum Solution of Goal Programming Problem |
Researcher: | Dhote, Monali Girish |
Guide(s): | Singh, Manoj and Ban, C.P. |
Keywords: | Physical Sciences Mathematics Optimum Solution of Goal Programming Problem |
University: | Himalayan Garhwal University |
Completed Date: | 2022 |
Abstract: | An attempt has been done in this thesis, to explain GP problem by applying some newlinealternative new methods. The mentioned methods are going to an innovative approach newlinewhich is simply easy to solve goal programming problem and get improved solution. newlineIn most of the cases, these methods reduce quantity of iterations as well improve the newlineoptimum solution. Again, within these methods, calculation of net evaluation j j C Z and#61485; newlinecan be skipped, so one can save valuable time. newlineThis thesis tends to recommend techniques to solve Goal programming problem newlinebased on maximizing the profit and minimizing the cost by applying alternative new newlinemethods to make the algorithm more efficient and then analysis will be done. newlineTo find out an accurate goal for every objective, the process is like to first formulate the newlineobjective function for every objective, afterward as per the basic approach of Goal newlineprogramming, find a solution that minimizes the summation of deviations from their newlinecorresponding targets whatever set by the authority. newlineTotal nine chapters have been included in this thesis. In chapter 1, introductionof the newlinetopic and itsproblem statement are included.Objectives and Organization of present newlinethesis have beenas well quoted. newlineIn the Second chapter, introductory remarks and historical survey of the connected newlineliterature is included and Future scope of research work is also added. The third newlinechapter is devoted to the new Alternative Simplex Approach which provides best newlinepossible solution of the Goal Programming Problem in less otherwise at the most equal newlineiterations. In the fourth chapter, the development of the alternative approach to Goal newlineProgramming is suggested giving rise to fever iterations than the existing one. Modified newlinetechnique to discover the Optimum solution of GP Problem is suggested in fifth chapter newlinefor providing better solution. newline |
Pagination: | 165 |
URI: | http://hdl.handle.net/10603/462881 |
Appears in Departments: | Department of Mathematics |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
80_recommendation.pdf | Attached File | 311.79 kB | Adobe PDF | View/Open |
abstract.pdf | 32.34 kB | Adobe PDF | View/Open | |
certificate, acknowledgement, lst of tables.pdf | 1.61 MB | Adobe PDF | View/Open | |
chapter 1.pdf | 360.92 kB | Adobe PDF | View/Open | |
chapter 2.pdf | 236.16 kB | Adobe PDF | View/Open | |
chapter 3.pdf | 423.38 kB | Adobe PDF | View/Open | |
chapter 4.pdf | 321.84 kB | Adobe PDF | View/Open | |
chapter 5.pdf | 652.18 kB | Adobe PDF | View/Open | |
chapter 6.pdf | 803.76 kB | Adobe PDF | View/Open | |
chapter 7.pdf | 884.28 kB | Adobe PDF | View/Open | |
chapter 8.pdf | 484.06 kB | Adobe PDF | View/Open | |
chapter 9.pdf | 139.25 kB | Adobe PDF | View/Open | |
content.pdf | 183.55 kB | Adobe PDF | View/Open | |
reference, publication.pdf | 1.77 MB | Adobe PDF | View/Open | |
title.pdf | 173.09 kB | Adobe PDF | View/Open |
Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).
Altmetric Badge: