On Optimization Policy for Verma Entropy by Dynamic Programming
Asian Journal of Probability and Statistics · pp. 14–21 · Published 17 Mar 2023
10.9734/ajpas/2023/v21i4469Abstract
Varma [1,2] entropy has attracted attention for a new class of non-linear integer programming problems that arise during the course of discussion. Our focus in this communication is to explore the techniques of dynamic programming. This process requires splitting any optimization event into a finite number of subcomponents for any occurrence of a finite generalized problem. The capacity plan should be partitioned in such a way that the expression can be optimized.
Cited by 2
Rohit Kumar Verma, Som Kumari · Journal of Research in Applied Mathematics · 2025
Rohit Kumar Verma, Babita Verma · Advanced Technologies and Societal Change · 2024
Related research
- Dynamic Programming Method for Optimizing Stock Allocation Using Chebyshev Polynomial Approximation — shares topic coverage
- Modeling an N – warehouse Stock Allocation via Dynamic Programming Technique — shares topic coverage
- Statistical Arbitrage Opportunities Using Bellman Equation — shares topic coverage
- Development of Ant Colony Optimization Software as a Solid Waste Management System — shares topic coverage
- A Note on Edgeworth Expansion — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
2
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.