# Geometric Programming Problem with Co-Efficients and Exponents Associated with Binary Numbers

Source: [Geometric Programming Problem with Co-Efficients and Exponents Associated with Binary Numbers](<https://www.sota2.com/research/paper/68fa4e961e209131ce95cca8>)

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

Data updated: 2026-06-04T05:01:41.816Z

Authors: A. K. Ojha, A. K. Das

Published: 2010-02-05T09:29:23.000Z

## Abstract

Geometric programming (GP) provides a power tool for solving a variety of optimization problems. In the real world, many applications of geometric programming (GP) are engineering design problems in which some of the problem parameters are estimating of actual values. This paper develops a solution procedure to solve nonlinear programming problems using GP technique by splitting the cost coefficients, constraint coefficients and exponents with the help of binary numbers. The equivalent mathematical programming problems are formulated to find their corresponding value of the objective function based on the duality theorem. The ability of calculating the cost coefficients, constraint coefficients and exponents developed in this paper might help lead to more realistic modeling efforts in engineering design areas. Standard nonlinear programming software has been used to solve the proposed optimization problem. Two numerical examples are presented to illustrate the method.

## 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/1002.1167>)

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