DSNANAFeb 21, 2010

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

arXiv:1002.40021.217 citationsh-index: 19
Originality Synthesis-oriented
AI Analysis

It addresses a niche problem in multi-objective optimization for engineering design, but the contribution appears incremental.

The paper develops a solution procedure for multi-objective geometric programming problems where cost coefficients are continuous functions, using the weighted sum method to obtain non-inferior solutions.

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes