# Lexicographic Multi-objective Geometric Programming Problems

Source: [Lexicographic Multi-objective Geometric Programming Problems](<https://www.sota2.com/research/paper/68fa600c1e209131ce9ed79a>)

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

Data updated: 2025-10-28T13:56:26.275Z

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

Published: 2009-12-09T18:46:01.000Z

## Abstract

A Geometric programming (GP) is a type of mathematical problem characterized by objective and constraint functions that have a special form. Many methods have been developed to solve large scale engineering design GP problems. In this paper GP technique has been used to solve multi-objective GP problem as a vector optimization problem. The duality theory for lexicographic geometric programming has been developed to solve the problems with posynomial in objectives and constraints.

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

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