نتایج جستجو برای: semi infinite programming
تعداد نتایج: 522435 فیلتر نتایج به سال:
Generalized semi-infinite optimization problems (GSIP) are considered. The difference between GSIP and standard semi-infinite problems (SIP) is illustrated by examples. By applying the ’Reduction Ansatz’, optimality conditions for GSIP are derived. Numerical methods for solving GSIP are considered in comparison with methods for SIP. From a theoretical and a practical point of view it is investi...
We consider a generalized semi-infinite programming problem (GSIP) with one semi-infinite constraint where the index set depends on the variable to be minimized. Keeping in mind the integral global optimization method of Zheng & Chew and its modifications we would like to outline theoretical considerations for determining coarse approximations of a solution of (GSIP) via global optimization of ...
A semi-infinite programming problem is an optimization problem in which finitely many variables appear in infinitely many constraints. This model naturally arises in an abundant number of applications in different fields of mathematics, economics and engineering. The paper, which intends to make a compromise between an introduction and a survey, treats the theoretical basis, numerical methods, ...
Article history: Received 28 July 2007 Received in revised form 30 April 2008 Accepted 1 May 2008 Available online 9 May 2008
In this paper, a trust region method for generalized semi-infinite programming problems is presented. The method is based on [O. Yi-gui, “A filter trust region method for solving semi-infinite programming problems”, J. Appl. Math. Comput. 29, 311 (2009)]. We transformed the method from standard to generalized semi-infinite programming problems. The semismooth reformulation of the Karush–Kuhn–Tu...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید