An Original Geometric Programming Problem Algorithm to Solve Two Coefficients Sensitivity Analysis
- 1 ,
Copyright: © 2020 Abbas Y. Al-Bayati and Huda E. Khalid. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
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.
- Geometric programming
- sensitivity analysis
- ranging analysis
- incremental analysis