Geodesic
About the Problem of Disjunctive Programming
Yugoslav journal of operations research, Tome 10 (2000) no. 2, p. 149 Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

Voir la notice de l'article

In this paper we investigate the problems of disjunctive programming with an infinite array of components forming a feasible set (as their union). The investigation continues the theme of the author's earlier work and describes an original conceptual approach to a) the analysis of saddle point problems for disjunctive Lagrangian functions, b) the analysis of dual relations for disjunctive programming problems and c) the technique of equivalent (on argument) reduction of such problems of unconstrained optimization.
Classification : 90C26 90C46
Keywords: Disjunctive programming, Lagrangian duality, piece-wise linear functions. 
@article{YJOR_2000_10_2_a0,
     author = {Ivan I. Eremin},
     title = {About the {Problem} of {Disjunctive} {Programming}},
     journal = {Yugoslav journal of operations research},
     pages = {149 },
     year = {2000},
     volume = {10},
     number = {2},
     zbl = {1006.90063},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_2000_10_2_a0/}
}
TY  - JOUR
AU  - Ivan I. Eremin
TI  - About the Problem of Disjunctive Programming
JO  - Yugoslav journal of operations research
PY  - 2000
SP  - 149 
VL  - 10
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/YJOR_2000_10_2_a0/
LA  - en
ID  - YJOR_2000_10_2_a0
ER  - 
%0 Journal Article
%A Ivan I. Eremin
%T About the Problem of Disjunctive Programming
%J Yugoslav journal of operations research
%D 2000
%P 149 
%V 10
%N 2
%U http://geodesic.mathdoc.fr/item/YJOR_2000_10_2_a0/
%G en
%F YJOR_2000_10_2_a0
Ivan I. Eremin. About the Problem of Disjunctive Programming. Yugoslav journal of operations research, Tome 10 (2000) no. 2, p. 149 . http://geodesic.mathdoc.fr/item/YJOR_2000_10_2_a0/