# Multi-Objective Geometric Programming Problem Being Cost Coefficients as Continous Function with Weighted Mean Method

Source: [Multi-Objective Geometric Programming Problem Being Cost Coefficients as Continous Function with Weighted Mean Method](<https://www.sota2.com/research/paper/68fa4eaa1e209131ce95d303>)

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-21T19:36:55.000Z

## Abstract

Geometric programming problems occur frequently in engineering design and management. In multiobjective optimization, the trade-off information between different objective functions is probably the most important piece of information in a solution process to reach the most preferred solution. In this paper we have discussed the basic concepts and principles of multiple objective optimization problems and developed a solution procedure to solve this optimization problem where the cost coefficients are continuous functions using weighted method to obtain the non-inferior solutions.

## 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.4002>)

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