Mixed discrete optimization of multiple-valued systems

Abstract

In this paper, a cutting-plane method is presented that has been applied to mixed multiple-valued optimization problems. In practice, the approach is faster than transforming mixed multiple-valued programs to mixed integer or zero-one integer programs. The approach can be used for fuzzy sets and industrial applications involving discrete intervals of feasible solutions. It has been applied to industrial power plants and flexible manufacturing systems.