Simplex Method of Realization of Optimization Problem of Linear Programming

Abstract

In a wide range of optimization tasks, it is necessary to search for an extremum. A feature of the simplex optimization method is the combination of studying the response surface with moving along it to the extremum. This is achieved by the fact that experiments are performed at the points of the factor space corresponding to the vertices of the simplexes. Thus, the simplex method has a number of positive qualities that allow it to be used in production conditions to solve optimization problems. The article presents the results of the implementation in the laboratory practical simplex method for the determination of the response function extremum at finding optimal experimental conditions.