作者: MA Goberna , MA López
DOI: 10.1007/BF00938312
关键词: Semi-infinite programming 、 Duality (optimization) 、 Duality gap 、 Convex function 、 Convex analysis 、 Subderivative 、 Mathematics 、 Mathematical optimization 、 Linear programming 、 Perturbation function
摘要: In this paper, we provide a systematic approach to the main topics in linear semi-infinite programming by means of new methodology based on many properties sub-differential mapping and closure given convex function. particular, deal with duality gap problem its relation discrete approximation program. Moreover, have made precise conditions that allow us eliminate introducing perturbation primal objective As by-product, supply different extensions well-known results concerning subdifferential mapping.