K. Richter : On a possibility to Decompose a Bordering Structured Programming Problem

Author(s) :

K. Richter

Title :

On a possibility to Decompose a Bordering Structured Programming Problem

Electronic source:

application/pdf

Preprint series

Technische Universität Chemnitz, Fakultät für Mathematik (Germany). Preprint 98-30, 1998

Mathematics Subject Classification :

65K05 [ Mathematical programming (numerical methods) ]

90C25 [ Convex programming ]

49M27 [ Decomposition methods ]

Abstract :

A possible decomposition approach for a convex bordering structured programming problem is suggested. Some properties of the decomposed problem and in particular of the resulting subproblems are described. For instance, these are equivalence, convexity, and solvability. The last part deals with the nonemptiness of the optimal sets of the subproblems. Finally, some assumptions are described ensuring that the optimal values are attained.

Keywords :

convex programming, decomposition methods, bordering structure

Language :

english

Publication time :

11/1998