Zobrazeno 1 - 2
of 2
pro vyhledávání: '"J. L. Alejandre"'
Publikováno v:
Computational Optimization and Applications. 27:83-93
The degree of difficulty is an important concept in classical geometric programming theory. The dual problem is often infeasible when the degree of difficulty is negative and little has been published on this topic. In this paper, an alternative proc
Publikováno v:
Mathematical and Computer Modelling. 31:61-78
In this article, we present an algorithm for the resolution of a nonlinear optimization problem, concretely the posynomial geometric programming model. The solution procedure that we develop extends the condensation techniques for geometric programmi