About Some Problems of Disjunctive Programming
Yugoslav journal of operations research, Tome 8 (1998) no. 1, p. 25
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
In this paper we analyze algebra (operations and transformations) and
geometry of the class of continuous piecewise linear functions (k -functions), in
particular, their universal representativity and the algorithms reducing them from one
representation to another. For the general piecewise linear programming problem, the
dual is formed and the corresponding duality theorem is presented, the method of exact
penalty function is grounded, and the saddle point theorems for the disjunctive
Lagrangian are proved. It is noted that the logical part of algorithmic tools to solve k-problems
can be implemented as a universal computer code allowing the formation and
solution of the concluding family of standard linear programs, one of which gives the
solution to the original k-problem.
Classification :
90C08 90C46
Keywords: Piecewise linear functions, algebra or transformations, saddle point and duality theorems
Keywords: Piecewise linear functions, algebra or transformations, saddle point and duality theorems
@article{YJOR_1998_8_1_a1,
author = {Ivan I. Eremin},
title = {About {Some} {Problems} of {Disjunctive} {Programming}},
journal = {Yugoslav journal of operations research},
pages = {25 },
year = {1998},
volume = {8},
number = {1},
zbl = {1006.90055},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_1998_8_1_a1/}
}
Ivan I. Eremin. About Some Problems of Disjunctive Programming. Yugoslav journal of operations research, Tome 8 (1998) no. 1, p. 25 . http://geodesic.mathdoc.fr/item/YJOR_1998_8_1_a1/