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 ...

Variable interaction is an important aspect of a problem, which reflects its structure, and has implications on the design of efficient optimization algorithms. Although variable interaction has been widely studied in the global optimization community, it has rarely been explored in the multi-objective optimization literature. In this paper, we empirically and analytically study the variable in...

Ant Colony Optimization (ACO) was first proposed to solve the Traveling Salesman Problem, and later applied to solve more problems of a combinatorial nature. Some research based on ACO to tackle continuous problems has been published, but this has not followed the original ACO metaheuristic exactly. Recently, ACOR has been proposed to solve continuous function optimization problems. We have tak...

Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these problems have a Boolean nature, i.e., the variables are restricted to 0 and 1, so called Pseudo-Boolean solvers have been proposed. They are mostly based on SAT solvers which took continuous improvements over the past years...

Recently ACO R has been proposed to solve continuous function optimization problems. We have taken this work and expanded it to solve multi-objective optimization problems. After a brief analysis of the results obtained and have compared them with other two well-know methods, we state that solutions from ACO R are promising.