Geometric Programming Problem with Co-Efficients and Exponents Associated with Binary Numbers

Geometric programming (GP) provides a power tool for solving a variety of optimization problems. In the real world, many applications of geometric programming (GP) are engineering design problems in which some of the problem parameters are estimating of actual values. This paper develops a solution procedure to solve nonlinear programming problems using GP technique by splitting the cost coefficients, constraint coefficients and exponents with the help of binary numbers. The equivalent mathematical programming problems are formulated to find their corresponding value of the objective function based on the duality theorem. The ability of calculating the cost coefficients, constraint coefficients and exponents developed in this paper might help lead to more realistic modeling efforts in engineering design areas. Standard nonlinear programming software has been used to solve the proposed optimization problem. Two numerical examples are presented to illustrate the method.

[1]  L. Goddard,et al.  Operations Research (OR) , 2007 .

[2]  Peiping Shen,et al.  Accelerating method of global optimization for signomial geometric programming , 2008 .

[3]  Jayant Rajgopal,et al.  Solving Posynomial Geometric Programming Problems via Generalized Linear Programming , 2002, Comput. Optim. Appl..

[4]  Belaïd Aouni,et al.  Goal programming model: A glorious history and a promising future , 2001, Eur. J. Oper. Res..

[5]  J. C. Choi,et al.  Effectiveness of a geometric programming algorithm for optimization of machining economics models , 1996, Comput. Oper. Res..

[6]  J. Kyparisis.  Sensitivity analysis in geometric programming: Theory and computations , 1991 .

[7]  C. Scott,et al.  Allocation of resources in project management , 1995 .

[8]  Yinyu Ye,et al.  An infeasible interior-point algorithm for solving primal and dual geometric programs , 1997, Math. Program..

[9]  R. S. Dembo.  THE SENSITIVITY OF OPTIMAL ENGINEERING DESIGNS USING GEOMETRIC PROGRAMMING , 1980 .

[10]  M. J. Rijckaert,et al.  A condensation method for generalized geometric programming , 1976, Math. Program..

[11]  P. N. Rao,et al.  Optimal selection of process parameters for turning operations in a CAPP system , 1997 .

[12]  K. O. Kortanek,et al.  Controlled dual perturbations for central path trajectories in geometric programming , 1994 .

[13]  Bablu Samanta,et al.  Entropy based transportation problem use geometric programming method , 2006, Appl. Math. Comput..

[14]  Xinlei Wang,et al.  Maximum likelihood estimation of ordered multinomial probabilities by geometric programming , 2009, Comput. Stat. Data Anal..

[15]  Shaojian Qu,et al.  A global optimization using linear relaxation for generalized geometric programming , 2008, Eur. J. Oper. Res..

[16]  Francoise Pelle.  ISSN , 2002 .

[17]  Shu-Cherng Fang,et al.  Controlled dual perturbations for posynomial programs , 1988 .

[18]  Martin D. F. Wong,et al.  VLSI Circuit Performance Optimization by Geometric Programming , 2001, Ann. Oper. Res..

[19]  Marietta J. Tretter,et al.  An Interval Arithmetic Approach to Sensitivity Analysis in Geometric Programming , 1987, Oper. Res..

[20]  K. Kortanek,et al.  A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier , 1992 .

[21]  R. A. Cuninghame-Green,et al.  Applied geometric programming , 1976 .

[22]  P. Jana,et al.  Geometric programming and dual entropy-optimization problem , 2007, Appl. Math. Comput..

[23]  Peiping Shen,et al.  A new rectangle branch-and-pruning approach for generalized geometric programming , 2006, Appl. Math. Comput..

[24]  Yi-Chung Hu,et al.  On generalized geometric programming problems with non-positive variables , 2007, Eur. J. Oper. Res..

[25]  Shiang-Tai Liu,et al.  Posynomial geometric programming with interval exponents and coefficients , 2008, Eur. J. Oper. Res..

[26]  Peiping Shen,et al.  Linearization method of global optimization for generalized geometric programming , 2005, Appl. Math. Comput..

[27]  Stephen P. Boyd,et al.  Optimal design of a CMOS op-amp via geometric programming , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[28]  Shiang-Tai Liu,et al.  Geometric programming with fuzzy parameters in engineering optimization , 2007, Int. J. Approx. Reason..

[29]  Shiang-Tai Liu,et al.  A computational method for the maximization of long-run and short-run profit , 2007, Appl. Math. Comput..

[30]  Esmaile Khorram,et al.  Monomial geometric programming with fuzzy relation inequality constraints with max-product composition , 2009, Comput. Ind. Eng..

[31]  Elmor L. Peterson,et al.  The Fundamental Relations between Geometric Programming Duality, Parametric Programming Duality, and Ordinary Lagrangian Duality , 2001, Ann. Oper. Res..