Method of Finding Initial Solution for the Geometric Programming Problem

The paper proposes a new method for finding an initial solution in the problem of geometric programming. The paper describes the conditions, under which the geometric programming problem of obtaining a positive solution of the matrix equation is solved. This equation describes the orthogonality and normalization conditions. The authors gave an example of application of the method in case of solving the problem of minimizing the risk of the object safety violation for the level crossing (technical object with safety requirements).