Abstract:
The paper discusses the determination of the size of a step in directional minimization, a problem arising in mathematical programming by the method of penalty functions. For combined penalty functions an equation is given whereby to find the optimal step. The equation is simple to solve approximately. The lower and higher estimates of the optimal step are also found.