Mond-Weir's type duality for interval-valued programming

摘要

In this paper, we consider interval-valued programming where the objective function and the constrict conditions are interval-valued function. We define the concepts of MW optimal solution to interval-valued programming problem. Mond-Weir''s type dual for interval-valued optimization problem is formulated. Under (p, r) − ρ − (η, θ) ∔ invexity assumptions, weak, strong and converse duality results are proved.