WEIGHTING METHOD FOR CONVEX VECTOR INTERVAL-VALUED OPTIMIZATION PROBLEMS

In this paper, a nonlinear vector optimization problem with the multiple interval-valued objective function is considered. We use the weighting method for finding its weakly type-I Pareto and type-I Pareto solutions. Therefore, for the considered nonlinear interval-valued multiobjective programming problem, its associated noninterval scalar optimization problem with weights is defined in the aforesaid approach. Then, under appropriate convexity hypotheses, the equivalence between a (weakly) type-I Pareto of the considered nonlinear interval-valued multiobjective programming problem and an optimal solution of its associated noninterval scalar weighting optimization problem is established.