Affiliation:
1. Federal University of Technology Owerri
Abstract
Abstract
In this paper, we have developed a geometric programming approximation to dynamic programming. The method has additional advantages of providing the cost involved in decision making and also eliminates the course of dimensionality which restricted the application of dynamic programming to small problems. We also obtained the optimal dual decision variables. We stated two lemmas, and through them, we proved that the optimal allocation policy is the same as the optimal primal decision variables and that the sum of cost matrix in Dynamic programming is the same as the cost coefficient in Geometric programming. We applied the method on a problem and obtained the optimal cost for decision making to be ₦97.30 and optimal decision policy to be (0.1, 0.2, 1, 3). This policy means that lecturers should combine to teach courses in year two and year three but each lecturer handles one course in year four and three courses in year five.
Publisher
Research Square Platform LLC
Reference16 articles.
1. The Usefulness of Dynamic Programming in Course Allocation in the Nigerian Universities;Amuji HO;Open J. Optim.,2017
2. A solution to geometric programming problems with negative degrees of difficulty;Amuji HO;Adv. Appl. Discrete Math.,2021
3. A Modified Generalized Inverse Method for Solving Geometric Programming Problems with Extended Degrees of Difficulties;Amuji HO;Int. J. Oper. Res.,2020
4. Complimentary Geometric Programming;Avriel M;SIAM J. Appl. Math.,1970
5. Geometric Programming - Theory and Application;Ben-Israel A;Soc. Industrial Appl. Math.,1968