Mathematical programming

The methods of linear programming (graphic and symptoms), duality theory, the transport task (methods of the “northwestern angle” and “potentials”) and its modification, the necessary and sufficient conditions of the unconditional extremum, the method of indefinite lagrange multipliers, the conditions of Kun-Takker are considered , the geometric method of solving the problem of non -linear programming, convex programming, a dynamic programming method for a discrete and continuous case. Examples from the economic field are successfully selected, which are easily paraphrased to the technical area.
At the end of each chapter, tasks for independent solution are given. This allows you to consolidate the studied material and acquire the skills of practical application and generalization of the considered methods and models.
It is recommended for enlarged groups of specialties of secondary vocational education Economics and Management, Computer science and computer technology