SOME SPECIAL PROBLEMS OF MATHEMATICAL PROGRAMMING AND THEIR REDUCTION TO CONVEX-CONCAVE AND PARTIAL INTEGER PROBLEMS

Abstract

A class of problems of mathematical programming with limits in the form of inequalities, having unique solutions, has been investigated in the paper as well a class of problems of complete quadratic programming. Calculation schemes for the search of global and local solutions and a one modification of the cut-off method have been developed. The paper results may find their field of application in the solution of problems of convex, discrete and global programming. The results obtained make it possible to solve a wide class of practical problemsAvailable from VNTIC / VNTIC - Scientific & Technical Information Centre of RussiaSIGLERURussian Federatio