On multi-objective geometric programming problems with a negative degree of difficulty

Abstract EN

Degree of difficulty is an important concept in the classical Geometric Programming (GP) theory.

The dual problem is often infeasible when the degree of difficulty is negative and very little subjects have been published on this topic.

This paper presents the basic concepts and principles of multiple-objective geometric programming model, and developed a numerical procedure to solve multi-objective Geometric Programming Problems (GPP) having a negative degree of difficulty using weighted method to obtain the non-inferior solution and using Brickers simple technique to ensure the dual feasibility ; namely the addition of a constant term to the primal objective function.