Least Possible Time to Reach Targeted Profit Function under Unitary Transformation
Partha Pratim Dube ()
Additional contact information
Partha Pratim Dube: Garalgacha Surabala Vidyamandir, West Bengal, India
Romanian Journal of Economics, 2020, vol. 50, issue 1(59), 05-15
The problem of quickest descent is solved by the calculus of variations. The calculus of variations is a branch of mathematics dealing with the optimization problem of physical quantities. Here profit maximization problems are judged by using this idea. As it is known that profit velocity and the time are the key factors to optimize the policy so, we have investigated the path of profit function and the minimum time to reach the final destination of profit function by utilizing unitary operator 1. Given two states that is the starting profit function and the targeted profit function there exist different paths belonging to the set. This investigation uses the unitary transformation which transforms the starting profit function to the targeted profit function in the least possible time.
Keywords: Targeted Profit Function; Unitary Operator (search for similar items in EconPapers)
JEL-codes: C61 D21 (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:ine:journl:v:50:y:2020:i:59:p:05-15
Access Statistics for this article
Romanian Journal of Economics is currently edited by Institute of National Economy
More articles in Romanian Journal of Economics from Institute of National Economy Contact information at EDIRC.
Bibliographic data for series maintained by Valentina Vasile ().