# Posynomial Geometric Programming Problems with Multiple Parameters

Source: [Posynomial Geometric Programming Problems with Multiple Parameters](<https://www.sota2.com/research/paper/68fa60211e209131ce9edcaa>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T19:33:47.863Z

Authors: A. K.Ojha, K.K.Biswal

Published: 2010-01-20T08:00:12.000Z

## Abstract

Geometric programming problem is a powerful tool for solving some special type non-linear programming problems. It has a wide range of applications in optimization and engineering for solving some complex optimization problems. Many applications of geometric programming are on engineering design problems where parameters are estimated using geometric programming. When the parameters in the problems are imprecise, the calculated objective value should be imprecise as well. In this paper we have developed a method to solve geometric programming problems where the exponent of the variables in the objective function, cost coefficients and right hand side are multiple parameters. The equivalent mathematical programming problems are formulated to find their corresponding value of the objective function based on the duality theorem. By applying a variable separable technique the multi-choice mathematical programming problem is transformed into multiple one level geometric programming problem which produces multiple objective values that helps engineers to handle more realistic engineering design problems.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1001.3493>)

[PDF](<https://arxiv.org/pdf/1001.3493.pdf>)