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

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

2010-02-21

arxiv.org/abs/1002.4002v1

Journal of Computing, Volume 2, Issue 2, February 2010, https://sites.google.com/site/journalofcomputing/

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Multi-Objective Geometric Programming Problem Being Cost Coefficients as Continous Function with Weighted Mean Method 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 Multi-Objective Geometric Programming Problem Being Cost Coefficients as Continous Function with Weighted Mean Method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multi-Objective Geometric Programming Problem Being Cost Coefficients as Continous Function with Weighted Mean Method will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-608672