Munich Personal RePEc Archive

Linear Programming by Solving Systems of Differential Equations Using Game Theory

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.

[img]
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.

UB_LMU-Logo
MPRA is a RePEc service hosted by
the Munich University Library in Germany.