Heuristic analysis of a near optimal approximation algorithm for the determination of investment options

When cash becomes available in a company, there are several strategies that allowus to benefit from it. The problem is how much to invest, for how long, and using whichof the investment options in order to get the maximum profit out of it. A commonproblem in business administration is that we do not...

Descripción completa

Autores Principales: Flores, Juan, Ávila, Javier, González, Federico, Flores Romero, Beatriz
Formato: Artículo
Idioma: Español
Publicado: 2015
Acceso en línea: http://revistas.ucr.ac.cr/index.php/matematica/article/view/273
http://hdl.handle.net/10669/12921
id RepoKERWA12921
recordtype dspace
spelling RepoKERWA129212017-08-08T18:50:22Z Heuristic analysis of a near optimal approximation algorithm for the determination of investment options Heuristic analysis of a near optimal approximation algorithm for the determination of investment options Flores, Juan Ávila, Javier González, Federico Flores Romero, Beatriz When cash becomes available in a company, there are several strategies that allowus to benefit from it. The problem is how much to invest, for how long, and using whichof the investment options in order to get the maximum profit out of it. A commonproblem in business administration is that we do not want to keep the money idle inthe checking account, neither to over-invest. When the cash function becomes negativean analogous scheme is used as we want to pay as little interests as possible. In thispaper we are reporting the experiments and implementation of several heuristics thatcan be used with the greedy algorithm and how well they behave. Finally we developa hybrid algorithm that takes the best of the greedy algorithm and performs a verylimited search. We find in this work that with the greedy algorithm we use, in generalis not possible to optimize the profit for a given function; nevertheless the algorithmwe use can find profits that are very close to the optimum and in some cases it getsthe optimum. The proposed algorithm use a heuristic search based on the greedyscheme and greedy selection criteria to find profits close to the optimum. A softwareapplication was developed in order to show that the proposed strategy really works.Although this algorithm is suboptimal, it is very efficient in terms of time.Keywords: Common sense reasoning, knowledge representation,soft decision making,greedy algorithms, financial analysis. Cuando se tiene disponibilidad de dinero en efectivo en una compa˜n´?a, existenvarias estrategias que nos permiten obtener beneficios de ´este. El problema es determinarcuanto invertir, por cuanto tiempo y que opciones de inversi´on usar para obtenerla m´axima utilidad. Un problema com´un en la administraci´on de negocios es que no sequiere mantener el efectivo ocioso en la cuenta de cheques, ni tampoco sobre invertir.Cuando la funci´on de dinero disponible es negativa, se utiliza un esquema an´alogo, eneste caso se busca pagar la menor cantidad de dinero por intereses generados. En esteart´?culo estamos reportando los experimentos e implementaci´on de varias heur´?sticasque pueden ser usadas con el algoritmo voraz, donde analizamos su desempe˜no. Finalmentese desarrolla un algoritmo h´?brido que toma el mejor resultado de variasheur´?sticas utilizando el algoritmo voraz y hace una b´usqueda muy limitada. En estetrabajo encontramos que con el algoritmo voraz utilizado, no es posible optimizar engeneral la utilidad para un problema dado; sin embargo, el procedimiento utilizadopuede encontrar utilidades muy cercanas al ´optimo y en ocasiones conseguir el ´optimo.Se desarroll´o una aplicaci´on computacional para mostrar que la estrategia propuestarealmente funciona. Aunque el algoritmo propuesto es sub´optimo, es muy eficiente entiempo de procesamiento.Palabras clave: Razonamiento de sentido com´un, representaci 2015-05-19T18:46:10Z 2015-05-19T18:46:10Z 2009-02-20 00:00:00 2015-05-19T18:46:10Z info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion http://revistas.ucr.ac.cr/index.php/matematica/article/view/273 http://hdl.handle.net/10669/12921 10.15517/rmta.v13i2.273 es Revista de Matemática: Teoría y Aplicaciones Vol. 13 Núm. 2 2009 125-138 application/pdf
institution Universidad de Costa Rica
collection Repositorio KERWA
language Español
description When cash becomes available in a company, there are several strategies that allowus to benefit from it. The problem is how much to invest, for how long, and using whichof the investment options in order to get the maximum profit out of it. A commonproblem in business administration is that we do not want to keep the money idle inthe checking account, neither to over-invest. When the cash function becomes negativean analogous scheme is used as we want to pay as little interests as possible. In thispaper we are reporting the experiments and implementation of several heuristics thatcan be used with the greedy algorithm and how well they behave. Finally we developa hybrid algorithm that takes the best of the greedy algorithm and performs a verylimited search. We find in this work that with the greedy algorithm we use, in generalis not possible to optimize the profit for a given function; nevertheless the algorithmwe use can find profits that are very close to the optimum and in some cases it getsthe optimum. The proposed algorithm use a heuristic search based on the greedyscheme and greedy selection criteria to find profits close to the optimum. A softwareapplication was developed in order to show that the proposed strategy really works.Although this algorithm is suboptimal, it is very efficient in terms of time.Keywords: Common sense reasoning, knowledge representation,soft decision making,greedy algorithms, financial analysis.
format Artículo
author Flores, Juan
Ávila, Javier
González, Federico
Flores Romero, Beatriz
spellingShingle Flores, Juan
Ávila, Javier
González, Federico
Flores Romero, Beatriz
Heuristic analysis of a near optimal approximation algorithm for the determination of investment options
author_sort Flores, Juan
title Heuristic analysis of a near optimal approximation algorithm for the determination of investment options
title_short Heuristic analysis of a near optimal approximation algorithm for the determination of investment options
title_full Heuristic analysis of a near optimal approximation algorithm for the determination of investment options
title_fullStr Heuristic analysis of a near optimal approximation algorithm for the determination of investment options
title_full_unstemmed Heuristic analysis of a near optimal approximation algorithm for the determination of investment options
title_sort heuristic analysis of a near optimal approximation algorithm for the determination of investment options
publishDate 2015
url http://revistas.ucr.ac.cr/index.php/matematica/article/view/273
http://hdl.handle.net/10669/12921
_version_ 1575730544737517568
score 11.593091