Solving Investment Problem with Inexact Rough Interval Data through Dynamic Programming Approach
Journal of Advances in Mathematics and Computer Science · pp. 238–245 · Published 6 Jul 2015
10.9734/BJMCS/2015/15849Abstract
Finding the best investment is an interesting optimization problem. When we deal with such a problem in an uncertain and vague environment, the optimization problem becomes more difficult. In this paper, we deal with rough data expressed in the form of an inexact rough interval fuzzy numbers, and then solve the optimization problem for atypical investment problem to obtain a rough interval solution. The process of optimization is illustrated by a numerical example.
Cited by 3
Tarek H. M. Abou-El-Enien, Y. Abo-Elnaga, Ashraf Almahalawy · Ingénierie des Systèmes d'Information · 2026
H. Khalifa · 2019
H. Mohammad · International Journal of Computer Applications · 2018
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
3
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.