|
|
|
|
|
Vladimir Krutikov, Elena Tovbis, Anatoly Bykov, Predrag Stanimirovic, Ekaterina Chernova and Lev Kazakovtsev
We investigate a solution of a convex programming problem with a strongly convex objective function based on the dual approach. A dual optimization problem has constraints on the positivity of variables. We study the methods and properties of transformat...
ver más
|
|
|
|
|
|
|
|
|
|
|
Chunming Tang, Yanni Li, Xiaoxia Dong and Bo He
In this paper, we consider a class of structured optimization problems whose objective function is the summation of two convex functions: f and h, which are not necessarily differentiable. We focus particularly on the case where the function f is general...
ver más
|
|
|
|
|
|
|
|
|
|
|
V.V. Voloshinov
Pág. 32 - 37
The article describes decomposition method for solving linear programming problems in a general case when it is impossible or difficult to reveal the block structure (of the constraint matrix) used by the classic Danzig-Wulf or Benders decomposition algo...
ver más
|
|
|
|
|
|
|
|
|
|
|
Rakesh Kawatra
In this paper we present a new heuristic procedure to solve the degree constrained minimal spanning tree problem. This procedure uses Lagrangian relaxation of the integer programming formulation of the problem to get a lower bound for the optimal objecti...
ver más
|
|
|
|
|
|
|
|
|
|
|
Combettes, P L
Pág. 493 - 506
|
|
|
|
|
|