Optimality Criteria for Fuzzy Pseudo Convex Functions
Sanjaya Kumar Behera
Abstract
Sanjaya Kumar Behera
Abstract
Convex optimization can provide both global as well as local solution; in the case of non convex optimization, it is difficult to get global solution. This paper presents some optimality criteria for the non convex programming problem whose objective function is fuzzy pseudo convex functions. Keywords: Fuzzy Pseudo Convex Functions, Fuzzy Quasi Convex Functions, Non Convex Programming Problem
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Convex optimization can provide both global as well as local solution; in the case of non convex optimization, it is difficult to get global solution. This paper presents some optimality criteria for the non convex programming problem whose objective function is fuzzy pseudo convex functions. Keywords: Fuzzy Pseudo Convex Functions, Fuzzy Quasi Convex Functions, Non Convex Programming Problem
Key concepts: Proper convex function, Convex optimization, Subderivative, Convex analysis, Conic optimization, Mathematical optimization, Convex combination, Mathematics