On Optimization Policy for Verma Entropy by Dynamic Programming

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.