Abstract
<jats:p>The monograph is devoted to methods, models and algorithms of mathematical programming. All the main directions of this section of applied mathematics are considered, except for stochastic, dynamic and convex programming. The chapter on linear programming describes the main varieties of the simplex method and the theory of duality. The chapter on discrete programming discusses exact and approximate methods for solving discrete and combinatorial optimization problems. A classic intractable discrete problem, the problem of packing a backpack, is considered in detail. In modern computational practice, many NP-complex discrete optimization problems and poorly conditioned multimodal nonlinear problems are solved using metaheuristics. The book includes a chapter on heuristic programming, which describes powerful and versatile metaheuristic algorithms. The last chapter is devoted to nonlinear programming. It outlines the basic principles and provides an overview of nonlinear optimization methods. It is intended for undergraduates and postgraduates of technical and economic specialties studying mathematical programming, applied mathematics and operations research. It will be useful for engineers, analysts, developers, and programmers who face optimization challenges in their line of work.</jats:p>