• Fulltext

       

        Click here to view fulltext PDF


      Permanent link:
      https://www.ias.ac.in/article/fulltext/sadh/047/0050

    • Keywords

       

      Convex programming; gH-subgradient; gH-subdifferential; interval optimization problems.

    • Abstract

       

      In this article, the concepts of gH-subgradient and gH-subdifferential of interval-valued functions are illustrated. Several important characteristics of the gH-subdifferential of a convex interval-valued function, e.g., closeness, boundedness, chain rule, etc. are studied. Alongside, we prove that gH-subdifferential of a gHdifferentiable convex interval-valued function contains only the gH-gradient. It is observed that the directional gH-derivative of a convex interval-valued function is the maximum of all the products between gH-subgradients and the direction. Importantly, we prove that a convex interval-valued function is gH-Lipschitz continuous if it has gH-subgradients at each point in its domain. Furthermore, relations between efficient solutions of anoptimization problem with interval-valued function and its gH-subgradients are derived.

    • Author Affiliations

       

      DEBDAS GHOSH1 AMIT KUMAR DEBNATH1 RAM SURAT CHAUHAN1 RADKO MESIAR2 3

      1. Department of Mathematical Sciences, Indian Institute of Technology (BHU), Varanasi 221005, India
      2. Faculty of Civil Engineering, Slovak University of Technology, Radlinske´ho 11, 810 05 Bratislava, Slovakia
      3. Department of Algebra and Geometry, Faculty of Science, Palacky´ University Olomouc, 17. listopadu 12, 771 46 Olomouc, Czech Republic
    • Dates

       
  • Sadhana | News

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2022-2023 Indian Academy of Sciences, Bengaluru.