This is an automatically translated description

The first part of the textbook describes the formulation of linear programming problems, the simplex method for solving linear programming problems, the closed transport problem of integer and discrete linear programming problems, and binary problems.
The second part of the textbook deals with the search for an extremum of nonlinear functions under constraints. The first section of this part describes methods of finding the unconditional extremum of functions of several variables, the second section describes methods of finding the extremum in the presence of constraints (methods of Lagrange multipliers, possible directions, penalty functions, MPBM, etc.) Next, we describe the dynamic programming method used to solve economic problems. All methods are accompanied by implementation algorithms and examples of solving economic problems.

The appendix contains programmes for implementing the methods in the algorithmic language C. For students of higher education institutions, as well as engineering and technical specialists.