Sigma-piecewise functions and problems of disjunctive programming
Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 5 (1998), pp. 357-380
Voir la notice de l'article provenant de la source Math-Net.Ru
Some special statements of mathematical programming problems are considered. The feasible domain is defined by disjunction of constraints, unlike traditional formulations, where the domain is determined as the intersection of sets. A problem of piecewise linear programming is an important particular case. The notion of disjunctive Lagrangian is introduced. Theorems of Kuhn-Tucker type, duality theorems, theorems on exact penalty functions, etc. cire formulated.
@article{TIMM_1998_5_a24,
author = {I. I. Eremin},
title = {Sigma-piecewise functions and problems of disjunctive programming},
journal = {Trudy Instituta matematiki i mehaniki},
pages = {357--380},
publisher = {mathdoc},
volume = {5},
year = {1998},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TIMM_1998_5_a24/}
}
I. I. Eremin. Sigma-piecewise functions and problems of disjunctive programming. Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 5 (1998), pp. 357-380. http://geodesic.mathdoc.fr/item/TIMM_1998_5_a24/