Lexicographic Multi-objective Geometric Programming Problems

Details Lexicographic Multi-objective Geometric Programming Problems Lexicographic Multi-objective Geometric Programming Problems

2009-12-09

arxiv.org/abs/0912.1832v1

Dr.A. K. Ojha and K. K. Biswal, "Lexicographic Multi-objective Geometric Programming Problems", International Journal of Compu

Computer Science

Data Structures and Algorithms

International Journal of Computer Science Issues, IJCSI Volume 6, Issue 2, pp20-24, November 2009

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Lexicographic Multi-objective Geometric Programming Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lexicographic Multi-objective Geometric Programming Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lexicographic Multi-objective Geometric Programming Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-276898