pith. sign in

arxiv: 1002.4002 · v1 · pith:JHMCOIJZnew · submitted 2010-02-21 · 💻 cs.DS · cs.NA· math.NA

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

classification 💻 cs.DS cs.NAmath.NA
keywords optimizationsolutioncoefficientscostfunctionsgeometricinformationmethod
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.