Mathematical programming with Semilocally Subconvex functions over cones

Authors

  • 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 Department of Mathematics, Miranda House, University of Delhi, Delhi, India

DOI:

https://doi.org/10.19139/soic-2310-5070-2502

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).

Downloads

Published

2025-08-13

Issue

Section

Research Articles

How to Cite

Mathematical programming with Semilocally Subconvex functions over cones. (2025). Statistics, Optimization & Information Computing, 14(3), 1473-1480. https://doi.org/10.19139/soic-2310-5070-2502