geometric programming


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.