Research Article Open Access

An Original Geometric Programming Problem Algorithm to Solve Two Coefficients Sensitivity Analysis

Abbas Y. Al-Bayati1 and Huda E. Khalid1
  • 1 ,
American Journal of Engineering and Applied Sciences
Volume 2 No. 2, 2009, 481-487

DOI: https://doi.org/10.3844/ajeassp.2009.481.487

Submitted On: 25 May 2009 Published On: 30 June 2009

How to Cite: Al-Bayati, A. Y. & Khalid, H. E. (2009). An Original Geometric Programming Problem Algorithm to Solve Two Coefficients Sensitivity Analysis . American Journal of Engineering and Applied Sciences, 2(2), 481-487. https://doi.org/10.3844/ajeassp.2009.481.487

Abstract

Problem statement: It has been noticed by Dinkel and Kochenberger that they developed sensitivity procedure for Posynomial Geometric Programming Problems based on making a small changes in one coefficient. Approach: This study presented an original algorithm for finding the ranging analysis while studying the effect of perturbations in the original coefficients without resolving the problem, this proposed procedure had been trapped on two coefficients simultaneously. We also had developed one of the incremental strategies to make suitable comparisons. Results: Comparison results had been done between the gained result from the sensitivity analysis approach and the incremental analysis approach. Conclusion: In the standard Geometric Programming Problem, we obtained an original algorithm, for the first time, by changing two coefficients simultaneously in the objective function.

  • 1,258 Views
  • 1,617 Downloads
  • 0 Citations

Download

Keywords

  • Geometric programming
  • sensitivity analysis
  • ranging analysis
  • incremental analysis