Convexity in the 1st Class of the Rough
Mathematical Programming Problems
T.E.M. Atteya, Kamilia El-Bess "Convexity in the 1st Class of the Rough Mathematical Programming Problems", International Journal of Mathematics Trends and Technology (IJMTT). V37(3):224-228 September 2016. ISSN:2231-5373. www.ijmttjournal.org. Published by Seventh Sense Research Group.
Abstract
Convex optimization is considered to be a
reliable computational tool in engineering as it is used
to solve many engineering problems in an efficient
and fast method. The goal of this paper is to discuss,
in depth, the convexity in the 1st class of rough
mathematical programming and to present some
related results.
References
[1] Z. Pawlak, Rough sets, International Journal of Computer
and Information Sciences, 11, 341-356, 1982.
[2] R. T. Rockafellar, Convex Analysis, Princeton University
Press, 1970.
[3] J. Stoer and C. Witzgall, Convexity and Optimization in
Finite Dimensions I, Springer-Verlag, 1970.
[4] Holmes, R. B., A Course on Optimization and Best
Approximation, Springer-Verlag, Berlin and New York,
1972.
[5] Bazaraa, M. S., and Shetty, C. M., Foundations of
Optimization, Springer-Verlag, Berlin and New York, 1976.
[6] Ekeland, I., and Temam, R., Convex Analysis and
Variational Problems, North Holland Publisher, Amsterdam,
1976.
[7] Ioffe, A. D., and Tihomirov, Y. M., Theory of External
Problems, North Holland Publisher, Amsterdam, 1979.
[8] Barbu, V., and Precupanu, T., Convexity and Optimization in
Banach Spaces, Sijthoff and Noordhoff, Alphen aan de Rijn,
1978.
[9] Ponstein, J., "Approaches to the Theory of Optimization,"
Cambridge University, Press, London and New York, 1980.
[10] E.A. Youness, Characterizing solutions of rough
programming problems, European Journal of Operational
Research, vol.168, no.3, pp.1019-1029, 2006.
[11] M.S. Osman, E.F. Lashein, E.A. Youness, T.E.M. Atteya,
Mathematical programming in rough environment,
Optimization, vol.60, no.5, pp.603-611,2011.
[12] Mokhtar S. Bazaraaa, Hanif D. Sherali, C. M. Shetty,
Nonlinear Programming: Theory and Algorithms, John Wiley
and Sons Inc., 3rd ed.; 2006.
Keywords
convexity, optimization, rough
programming.