Abstract
In this paper a new minimal cost graph flow problem is defined. Such kind of problem appears by optimal solving of certain financial tasks connected to the currency exchange at the cash currency markets. The initial problem containing absolute values in the objective function which provides the total costs of the financial transaction is transformed to a linear programming problem in the standard form. An example of the solution of the simple graph annihilation problem is given.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arthanari, T.S., Dodge, Y.: Mathematical Programming in Statistics. Wiley, New York (1981)
Plesník, J., Dupačová, J., Vlach, M.: Linear Programming (Lineárne programovanie, in Czech/Slovak). ALFA, Bratislava, p. 320 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buša, J. (2012). A Graph Annihilation Problem. In: Adam, G., Buša, J., Hnatič, M. (eds) Mathematical Modeling and Computational Science. MMCP 2011. Lecture Notes in Computer Science, vol 7125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28212-6_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-28212-6_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28211-9
Online ISBN: 978-3-642-28212-6
eBook Packages: Computer ScienceComputer Science (R0)