Constrained derivatives and equilibrium conditions in generalized geometric programming
This paper demonstrates that the “equilibrium conditions” of generalized geometric programming can be interpreted as constrained derivatives of a transform of the dual program to the generalized geometric programming primal. Thus, iterative procedures employing these conditions amount to direct solution of the necessary conditions for a local minimum of the transformed dual expressed in constrained derivative form under the constraint qualification of nonsingularity and nondegeneracy.
KeywordsMathematical Modeling Equilibrium Condition Local Minimum Industrial Mathematic Iterative Procedure
Unable to display preview. Download preview PDF.
- D. T. Phillips, Geometric Programming with Slack Constraints and Degrees of Difficulty,AIIE Transactions, (1973) 7–13.Google Scholar
- G. V. Reklaitis and D. J. Wilde, Necessary Conditions for a Local Optimum without Prior Constraint Qualifications, inOptimizing Methods in Statistics, J. S. Rustagi (ed.), Academic Press, New York (1971).Google Scholar
- M. Avriel, M. J. Rijckaert and D. J. Wilde,Optimization and Design, Prentice-Hall, Inc. (1973).Google Scholar
- D. J. Wilde and C. S. Beightler,Foundations of Optimization, Prentice-Hall, Englewood Cliffs, New Jersey (1967), Chapter 3.Google Scholar