Mathematical programming with Semilocally Subconvex functions over cones

  • Vani Sharma Department of Mathematics, Satyawati College, University of Delhi, Delhi, India
  • Mamta Chaudhary Department of Mathematics, Satyawati College, University of Delhi, Delhi, India
  • Meetu Bhatia Grover Miranda House, University of Delhi
Keywords: vector optimization, duality, Theorem of Alternatives, cones

Abstract

In this paper, we introduce another generalization of semilocally convex functions over cones, called conesemilocallysubconvex function (C-slsb), and compare it with other generalizations of convex functions through examples.Further, using its properties we establish a theorem of the alternatives for these functions. Then we investigate the optimalsolutions of the mathematical programming problem (MP) over cones using these functions, directional derivatives, andthe alternative theorem. Investigation of optimal solutions of (MP) is done by deriving optimality and duality results forsemilocally subconvex mathematical programming problems over cones (MP).
Published
2025-08-13
How to Cite
Sharma, V., Chaudhary, M., & Grover, M. B. (2025). Mathematical programming with Semilocally Subconvex functions over cones. Statistics, Optimization & Information Computing. https://doi.org/10.19139/soic-2310-5070-2502
Section
Research Articles