Disjunctive optimization, max-separable problems and extremal algebras
暂无分享,去创建一个
The paper was motivated by solution methods suggested in the literature for solving linear optimization problems over (max,+)- or (max, min)-algebras and certain class of so called max-separable optimization problems. General features of these optimization problems, which play a crucial role in the optimization methods were used to formulate a general class of optimization problems with disjunctive constraints and a max-separable objective function and suggest a solution procedure for solving such problems. Linear problems over (max, +)-algebras and the max-separable problems are contained in this general class of optimization problems as special cases.
[1] K. Zimmermann,et al. On Max-Separable Optimization Problems , 1984 .
[2] Ivan I.Eremin. About some problems of disjunctive programming , 1998 .
[3] Domaine de Voluceau,et al. Two Lectures on Max-plus Algebra , 1998 .
[4] Peter Butkovic,et al. Strong Regularity of Matrices - A Survey of Results , 1994, Discret. Appl. Math..