geometric programming


Also found in: Acronyms, Wikipedia.

geometric programming

[¦jē·ə¦me·trik ′prō ‚gram·iŋ]
(systems engineering)
A nonlinear programming technique in which the relative contribution of each of the component costs is first determined; only then are the variables in the component costs determined.
References in periodicals archive ?
Geometric programming is a relative method for solving a class of non-linear programming problems.
Inspired by Zadeh's fuzzy sets theory, fuzzy geometric programming emerged from the combination of fuzzy sets theory with geometric programming.
In this work, the neutrosophic geometric programming (the unconstrained case) was established where the models were built in the form of posynomials.
The neutrosophic unconstrained posynomial geometric programming, where x = [([x.
x) is said to be a neutrosophic geometric programming (the unconstrained case) with respect to [?
is a solution to neutrosophic posynomial geometric programming (6) at [?
Cao, Fuzzy Geometric Programming, Dordrecht: Springer Science Business Media, 2002.
Yang Advances in Fuzzy Geometric Programming, Berlin-Heidelberg: Springer Verlag, 2007.
Al-Bayati, Investigation in the Sensitivity Analysis of Generalized Geometric Programming Problems, PhD Thesis, The Council of the College of Computers Sciences and Mathematics University of Mosul, 2010.
Khalid, An Original Notion to Find Maximal Solution in the Fuzzy Neutrosophic Relation Equations (FNRE) with Geometric Programming (GP), in "Neutrosophic Sets and Systems", vol.