One class of optimization problems with alternative constraints and its application.

Abstract

We consider a class of disjunctive minimization problems, the objective function of which can be expressed as the maximum of a finite number of continuous functions. The constraints of the problems consist of m disjunctive constraints.

A special structure of the problems makes it possible to find a global minimum after at most mn smaller minimization subproblems had been solved. The results can be applied in location problems or machine time scheduling problems.