• Title/Summary/Keyword: interval-valued optimization problem

Search Result 3, Processing Time 0.019 seconds

ROBUST SEMI-INFINITE INTERVAL-VALUED OPTIMIZATION PROBLEM WITH UNCERTAIN INEQUALITY CONSTRAINTS

  • Jaichander, Rekha R.;Ahmad, Izhar;Kummari, Krishna
    • Korean Journal of Mathematics
    • /
    • v.30 no.3
    • /
    • pp.475-489
    • /
    • 2022
  • This paper focuses on a robust semi-infinite interval-valued optimization problem with uncertain inequality constraints (RSIIVP). By employing the concept of LU-optimal solution and Extended Mangasarian-Fromovitz Constraint Qualification (EMFCQ), necessary optimality conditions are established for (RSIIVP) and then sufficient optimality conditions for (RSIIVP) are derived, by using the tools of convexity. Moreover, a Wolfe type dual problem for (RSIIVP) is formulated and usual duality results are discussed between the primal (RSIIVP) and its dual (RSIWD) problem. The presented results are demonstrated by non-trivial examples.

INTERVAL VALUED VECTOR VARIATIONAL INEQUALITIES AND VECTOR OPTIMIZATION PROBLEMS VIA CONVEXIFICATORS

  • TIRTH RAM;ROHIT KUMAR BHARDWAJ
    • Journal of applied mathematics & informatics
    • /
    • v.41 no.6
    • /
    • pp.1419-1432
    • /
    • 2023
  • In this study, we take into account interval-valued vector optimization problems (IVOP) and obtain their relationships to interval vector variational inequalities (IVVI) of Stampacchia and Minty kind in aspects of convexificators, as well as the (IVOP) LU-efficient solution under the LU-convexity assumption. Additionally, we examine the weak version of the (IVVI) of the Stampacchia and Minty kind and determine the relationships between them and the weakly LU-efficient solution of the (IVOP). The results of this study improve and generalizes certain earlier results from the literature.

NONLINEAR FRACTIONAL PROGRAMMING PROBLEM WITH INEXACT PARAMETER

  • Bhurjee, A.K.;Panda, G.
    • Journal of applied mathematics & informatics
    • /
    • v.31 no.5_6
    • /
    • pp.853-867
    • /
    • 2013
  • In this paper a methodology is developed to solve a nonlinear fractional programming problem, whose objective function and constraints are interval valued functions. Interval valued convex fractional programming problem is studied. This model is transformed to a general convex programming problem and relation between the original problem and the transformed problem is established. These theoretical developments are illustrated through a numerical example.