Development of discrete optimization methods based on duality theory
The monograph presents a systematic description of discrete optimization problems and the application of duality theory to reduce the computational complexity of the method of branches and boundaries and the method of counter-solving functional equations of dynamic programming when solving problems of integer linear and quadratic programming when calculating the boundaries of the solution, determining the order of branching variables, ordering constraints on rigidity and linearization of the quadratic function. A comparative evaluation of the effectiveness of the developed and existing optimization methods and algorithms is given. Mathematical models of optimization of the information and computing process and information protection in computer networks are described. For researchers in the field of applied mathematics, cybernetics, for engineers and university students.
No reviews found
