Lexicographic Multi-objective Geometric Programming Problems
Data Structures and Algorithms
2009-12-10 v1 Computational Geometry
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.
Cite
@article{arxiv.0912.1832,
title = {Lexicographic Multi-objective Geometric Programming Problems},
author = {Dr. A. K. Ojha and K. K. Biswal},
journal= {arXiv preprint arXiv:0912.1832},
year = {2009}
}
Comments
International Journal of Computer Science Issues, IJCSI Volume 6, Issue 2, pp20-24, November 2009