ON THE URBAN PLANNING OPTIMIZATION PROBLEMS via -INVERSE GP METHOD

In this paper, we develop a g-inverse geometric programming model for urban planning optimization problems. The nature of this problem is complex because of the resulting rectangular exponent matrix with so many positive degrees of difficulty. This method has helped to solve such a complex problem and eliminate the use of condensation, which would require higher-order mathematics. From the solution to the modelled urban planning optimization problem, we were able to determine the optimal cost for urban planning for the five selected districts in Owerri to be . We also estimated the lower and upper bound populations of the districts in the next two years. Our model is robust and has demonstrated its capacity to handle such tasks of cost estimation and population estimation with less difficulty.