Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
