A posynomial geometric programming problem formulated so that the number of objective function terms is equal to the number of primal variables will have a zero degree of difficulty when augmented by multiplying each constraint term by a slack variable and including a surrogate constraint composed o
On geometric programming and complementary slackness
โ Scribed by J. R. McNamara
- Publisher
- Springer
- Year
- 1992
- Tongue
- English
- Weight
- 606 KB
- Volume
- 74
- Category
- Article
- ISSN
- 0022-3239
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The aim of this paper is to develop a duality theory for linear multiobjective programming verifying similar properties as in the scalar case. We use the so-called "strongly proper optima" and we characterize such optima and its associated dual solutions by means of some complementary slackness cond
In this note we consider the problem of feedback control of n-dof (degree-of-freedom) rigid manipulators subject to a scalar frictionless unilateral constraint f(X )ยฟ0 (X โ R n is the vector of generalized coordinates). The stability analysis relies on a stability concept that incorporates the hybri