ISSN:
1436-4646
Keywords:
Capacity programming problem
;
semi-finite programming
;
normal programming
;
subdifferential
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract This paper studies the infinite dimensional linear programming problems in the integration type. The variable is taken in the space of bounded regular Borel measures on compact Hausdorff spaces. It will find an optimal measure for a constrained optimization problem, namely a capacity problem. Relations between extremal points of the feasible region and optimal solutions of the optimization problem are investigated. The necessary/sufficient conditions for a measure to be optimal are established. The algorithm for optimal solution of the general capacity problem onX = Y = [0, 1] is formulated.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01586043
Permalink
