A GP SOLUTION TO COOPERATIVE GAME-DYNAMIC PROGRAMMING OPTIMIZATION.

Saved in:

Bibliographic Details
Title:	A GP SOLUTION TO COOPERATIVE GAME-DYNAMIC PROGRAMMING OPTIMIZATION.
Authors:	Amuji, Harrison O.¹, Iwu, Hycinth C.¹ iwuchuk@yahoo.com, Igboanusi, Chinemerem C.², Osuji, Williams I.³, Chukwuchekwa, Joy U.³, Nwachi, Christy C.⁴, Amaechi, Louisa N.⁵, Akujor, Jane C.⁶, Duru, Erasmus E.⁶, Ejem, Ejem A.⁷, Okeoma, Immaculata O.⁴ ogechi.okeoma@futo.edu.ng
Source:	Advances & Applications in Discrete Mathematics. Apr2026, Vol. 43 Issue 3, p285-298. 14p.
Subjects:	Cooperative game theory, Geometric programming, Dynamic programming, Mathematical optimization, Coalitions
Abstract:	In this paper, we developed a robust method for optimizing a Cooperative Game-Dynamic Programming (CG-DP) problem. The method first establishes a relationship between cooperative games and dynamic programming, and optimizes the cooperative game solution via dynamic programming. We established a relationship between dynamic programming and geometric programming. By extension, cooperative game solutions can be optimized via Geometric Programming (GP), which is what we did, and we found that GP produced a better result. Optimization via DP to the CG solution yields an additional 7.20 million naira by allocating the coalitions in the order (3, 1, 1). In contrast, optimization via GP to the CG solution yields an additional 17.12 million naira by allocating the coalitions in the order (1.2, 1, 1). We compared the two methods and found that the GP method of solution to the CG problem is better because it produced an optimal gain of 50.6 million naira against the 40.68 million-naira gain from the DP method to the CG solution. [ABSTRACT FROM AUTHOR]
	Copyright of Advances & Applications in Discrete Mathematics is the property of Pushpa Publishing House and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	In this paper, we developed a robust method for optimizing a Cooperative Game-Dynamic Programming (CG-DP) problem. The method first establishes a relationship between cooperative games and dynamic programming, and optimizes the cooperative game solution via dynamic programming. We established a relationship between dynamic programming and geometric programming. By extension, cooperative game solutions can be optimized via Geometric Programming (GP), which is what we did, and we found that GP produced a better result. Optimization via DP to the CG solution yields an additional 7.20 million naira by allocating the coalitions in the order (3, 1, 1). In contrast, optimization via GP to the CG solution yields an additional 17.12 million naira by allocating the coalitions in the order (1.2, 1, 1). We compared the two methods and found that the GP method of solution to the CG problem is better because it produced an optimal gain of 50.6 million naira against the 40.68 million-naira gain from the DP method to the CG solution. [ABSTRACT FROM AUTHOR]
ISSN:	09741658
DOI:	10.17654/0974165826019