Abstract. In this paper, some interval valued programming problems are discussed. The solution concepts are adopted fromWu [7] and Chalco-Cano et al. [34]. By considering generalized Hukuhara ...

To solve the problem, the authors use a partial outer convexification approach, which involves two stages: the solution of a (smoothed) nonlinear programming problem with dynamic constraints and a ...

Mathematics of Operations Research, Vol. 41, No. 2 (May 2016), pp. 442-465 (24 pages) In view of solving nonsmooth and nonconvex problems involving complex constraints (like standard NLP problems), we ...