نتایج جستجو برای: interval programming
تعداد نتایج: 523693 فیلتر نتایج به سال:
We consider a nonsmooth semi-infinite interval-valued vector programming problem, where the objectives and constraint functions need not to be locally Lipschitz. Using Abadie’s qualification convexificators, we provide Karush–Kuhn–Tucker necessary optimality conditions by converting initial problem into bi-criteria optimization problem. Furthermore, establish sufficient under asymptotic convexi...
In this paper, we will discusse the strong optimality of general interval linear program (IvLP), that is, the IvLP has an optimal solution for each realization, and some necessary and sufficient conditions are established, based on the duality theory. Keywordsoptimal solution; strongly feasible; duality;
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید