Abstract
This paper addresses a geometric programming problem, where the objective function and constraints are interval-valued functions. The concept of acceptable feasible region is introduced, and a methodology is developed to transform this model to a general optimization problem, which is free from interval uncertainty. Relationship between the solution of the original problem and the transformed problem is established. The methodology is illustrated through numerical examples. Solutions by the proposed method and previous methods are analyzed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bhurjee, A., Panda, G.: Efficient solution of interval optimization problem. Math. Methods Oper. Res. 76, 273–288 (2012)
Chanas, S., Kuchta, D.: Multiobjective programming in optimization of interval objective functions a generalized approach. Eur. J. Oper. Res. 94(3), 594–598 (1996)
Hladík, M.: Optimal value range in interval linear programming. Fuzzy Optim. Decis. Mak. 8(3), 283–294 (2009)
Jiang, C., Han, X., Liu, G., Liu, G.: A nonlinear interval number programming method for uncertain optimization problems. Eur. J. Oper. Res. 188(1), 1–13 (2008)
Chakraborty, A., Tiwari, S., Chattopadhyay, A., Chatterjee, K.: Multi-objective linear programming problem with interval-coefficients based on preference relations. J. Adv. Res. Appl. Math. 4, 1–11 (2012)
Han, Y., Huang, Y.F., Wang, G.Q., Maqsood, I.: A multi-objective linear programming model with interval parameters for water resources allocation in Dalian city. Water Resour. Manag. 25, 449–463 (2011)
Hladík, M.: Complexity of necessary efficiency in interval linear programming and multiobjective linear programming. Optim. Lett. 6(5), 893–899 (2012)
Oliveira, C., Antunes, C.: An interactive method of tackling uncertainty in interval multiple objective linear programming. J. Math. Sci. 161(6), 854–866 (2009)
Oliveira, C., Antunes, C.H.: Multiple objective linear programming models with interval coefficients-an illustrated overview. Eur. J. Oper. Res. 181(3), 1434–1463 (2007)
Rivaz, S., Yaghoobi, M.A.: Minimax regret solution to multiobjective linear programming problems with interval objective functions coefficients. Cent. Eur. J. Oper. Res. 21(3), 625–649 (2012)
Urli, B., Nadeau, R.: An interactive method to multiobjective linear programming problems with interval coefficients. Inf. Syst. Oper. Res. 30(2), 127–137 (1992)
Dinkel, J.J., Tretter, M.J.: An interval arithmetic approach to sensitivity analysis in geometric programming. Oper. Res. 35(6), 859–866 (1987)
Hladík, M.: Optimal value bounds in nonlinear programming with interval data. Top 19(1), 93–106 (2011)
Liu, S.: Posynomial geometric programming with parametric uncertainty. Eur. J. Oper. Res. 168(2), 345–353 (2006)
Liu, S.: Posynomial geometric programming with interval exponents and coefficients. Eur. J. Oper. Res. 186(1), 17–27 (2008)
Mahapatra, G., Mandal, T.: Posynomial parametric geometric programming with interval valued coefficient. J. Optim. Theor. Appl. 154, 120–132 (2012)
Hansen, E., Walster, G.W.: Global optimization using interval analysis. Marcel Dekker, New York (2004)
Moore, R.E., Kearfott, R.B., Cloud, M.J.: Introduction to interval analysis. Society for Industrial Mathematics, Philadelphia (2009)
Markov, S.: Calculus for interval functions of a real variable. Computing 22, 325–337 (1979)
Wu, H.C.: On interval-valued nonlinear programming problems. J. Math. Anal. Appl. 338(1), 299–316 (2008)
Acknowledgements
The authors are greatly indebted to the anonymous referees for their valuable comments and remarks.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Jana, M., Panda, G. Compromising Solution of Geometric Programming Problem with Bounded Parameters. J. Oper. Res. Soc. China 5, 377–390 (2017). https://doi.org/10.1007/s40305-016-0145-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40305-016-0145-z