> > Multi-objective Integer Linear Programming: MOILP

This is the free portion of the full article. The full article is available to licensed users only.
How do I get access?

Multi-objective Integer Linear Programming

Article Outline

Keywords

Generation of E(P)
Klein-Hannan Method
Kiziltan-Yucaoglu Method
Interactive Methods
Gonzalez-Reeves-Franz Algorithm
Steuer-Choo Method
The MOMIX Method
See also
References

Keywords Multi-objective programming - Integer - Linear programming

From the 1970s onwards, multi-objective linear programming (MOLP) methods with continuous solutions have been developed [8]. However, it is well known that discrete variables are unavoidable in the linear programming modeling of many applications, for instance, to represent an investment choice, a production level, etc.

The mathematical structure is then integer linear programming (ILP), associated with MOLP giving a MOILP problem. Unfortunately, MOILP cannot be solved by simply combining ILP and MOLP methods, because it has got its own specific difficulties.

The problem (P) considered is defined as
If