Ciuiu, Daniel
(2009):
*Linear Programming by Solving Systems of Differential Equations Using Game Theory.*
Published in: Proceedings of the 9-th Balkan Conference on Operational Research, September 02-06 2009, Constanta, Romania
(August 2009): pp. 72-78.

Preview |
PDF
MPRA_paper_17191.pdf Download (202kB) | Preview |

## Abstract

In this paper we will solve some linear programming problems by solving systems of differential equations using game theory. The linear programming problem must be a classical constraints problem or a classical menu problem, i.e. a maximization/minimization problem in the canonical form with all the coefficients (from objective function, constraints matrix and right sides) positive. Firstly we will transform the linear programming problem such that the new problem and its dual have to be solved in order to find the Nash equilibrium of a matriceal game. Next we find the Nash equilibrium by solving a system of differential equations as we know from evolutionary game theory, and we express the solution of the obtained linear programming problem (by the above transformation of the initial problem) using the Nash equilibrium and the corresponding mixed optimal strategies. Finally, we transform the solution of the obtained problem to obtain the solution of the initial problem. We make also a program to implement the algorithm presented in the paper.

Item Type: | MPRA Paper |
---|---|

Original Title: | Linear Programming by Solving Systems of Differential Equations Using Game Theory |

Language: | English |

Keywords: | Linear programming, evolutionary game theory, Nash equilibrium. |

Subjects: | C - Mathematical and Quantitative Methods > C6 - Mathematical Methods ; Programming Models ; Mathematical and Simulation Modeling > C61 - Optimization Techniques ; Programming Models ; Dynamic Analysis C - Mathematical and Quantitative Methods > C7 - Game Theory and Bargaining Theory > C73 - Stochastic and Dynamic Games ; Evolutionary Games ; Repeated Games C - Mathematical and Quantitative Methods > C7 - Game Theory and Bargaining Theory > C72 - Noncooperative Games |

Item ID: | 17191 |

Depositing User: | Daniel Ciuiu |

Date Deposited: | 09 Sep 2009 07:25 |

Last Modified: | 27 Sep 2019 12:13 |

References: | [1] N. Andrei, Programare matematică avansată. Teorie şi metode computaţionale. Ed. Tehnică, Bucureşti, 1999. [2] A. Bătătorescu, Metode de optimizare liniară. Ed. Universităţii Bucureşti, 2003. [3] P. Hansen, N. Mladenovic and D. Perez-Brito, "Variable Neighborhood Decomposition Search", Journal of Heuristics, No. 7, pp. 335-350, 2001. [4] P. Hansen and N. Mladenovic, "Variable Neighborhood Search", in Search Methodologies. Introductory tutorials in Optimization and Decision Support Techniques, Editors E.K. Burke and G. Kendall, Springer, 2005, pp. 211-238. [5] G.D. Mateescu, "On the Application of Genetic Algorithms to Differential Equations", Romanian Journal of Economic Forecasting, No. 2, pp. 5-9, 2006. [6] G.D. Mateescu, "Algoritmi genetici de optimizare", Working Papers of Macroeconomic Modeling Seminar, No. 061002, pp. 21-28, 2006. [7] G.D. Mateescu, C. Sâman and M. Buneci, "Algoritmi genetici", Working Papers of Macroeconomic Modeling Seminar, No. 071402, pp. 21-31, 2007. [8] G. Păltineanu, P. Matei and R. Trandafir, Analiză numerică. Ed. Conspress, Bucureşti, 1998. [9] A. Ştefănescu, Competitive Models in Game Theory and Economic Analysis. Ed. Universităţii Bucureşti, 2000. [10] A. Ştefănescu and C. Zidăroiu, Cercetări operaţionale. Ed. Didactică şi Pedagogică, Bucureşti, 1981. [11] J. Weibull, Evolutionary game theory. MIT Press, 1996. |

URI: | https://mpra.ub.uni-muenchen.de/id/eprint/17191 |