Method of Finding Initial Solution for the Geometric Programming Problem

A. Yatsko

Koszalin University of Technology, Poland.

W. Susłow *

Koszalin University of Technology, Poland.

*Author to whom correspondence should be addressed.


Abstract

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).

Keywords: Geometric programming, posynomial, objective function, dual problem, matrix, positive solution, orthogonality, normalization.


How to Cite

Yatsko, A., and W. Susłow. 2015. “Method of Finding Initial Solution for the Geometric Programming Problem”. Journal of Advances in Mathematics and Computer Science 12 (5):1-10. https://doi.org/10.9734/BJMCS/2016/21873.

Downloads

Download data is not yet available.