In recent years, convex programming has become a sophisticated tool ofcentral importance in engineering, finance, operations research, statistics etc. The goalof this paper is to emphasize modeling and present several convex programmingproblem formulations especially in optimal design and location theory. We buildsimple models to address this question, investigate their properties and apply a variantof the Weierstrass theorem to prove the existence of a solution. Our results extend andimprove some other comparable results of the author [2,8,20,21,22,23,24,25].
The Bulletin of Society for Mathematical Services and Standards (Volume 5)
I. A. Osinuga and D. A. Agunbiade, "A Note on Convex Programming in Practical Problems", The Bulletin of Society for Mathematical Services and Standards, Vol. 5, pp. 19-26, 2013