The paper presents the semi-numerical solution for the magnetohydrodynamic (MHD) viscous flow due to a stretching sheet caused by boundary layer of an incompressible viscous flow. The governing partial differential equations of momentum equations are reduced into a nonlinear ordinary differential equation (NODE) by using a classical similarity transformation along with appropriate boundary cond...

In this paper, a new numerical algorithm is introduced to solve the Blasius equation, which is a third-order nonlinear ordinary differential equation arising in the problem of two-dimensional steady state laminar viscous flow over a semi-infinite flat plate. The proposed approach is based on the first kind of Bessel functions collocation method. The first kind of Bessel function is an infinite ...

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...

This paper deals with generalized semi-infinite optimization problems where the (infinite) index set of inequality constraints depends on the state variables and all involved functions are twice continuously differentiable. Necessary and sufficient second order optimality conditions for such problems are derived under assumptions which imply that the corresponding optimal value function is seco...

Generalized semi-infinite optimization problems (GSIP) are considered. It is investigated how the numerical methods for standard semi-infinite programming (SIP) can be extended to GSIP. Newton methods can be extended immediately. For discretization methods the situation is more complicated. These difficulties are discussed and convergence results for a discretizationand an exchange method are d...

In this paper, we develop the sufficient conditions for the existence of local and global saddle points of two classes of augmented Lagrangian functions for nonconvex optimization problem with both equality and inequality constraints, which improve the corresponding results in available papers. The main feature of our sufficient condition for the existence of global saddle points is that we do ...

In this paper we study first order optimality conditions for the class of generalized semi-infinite programming problems (GSIPs). We extend various wellknown constraint qualifications for finite programming problems to GSIPs and analyze the extent to which a corresponding Karush-Kuhn-Tucker (KKT) condition depends on these extensions. It is shown that in general the KKT condition for GSIPs take...

‎linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints‎. ‎in this paper‎, ‎to solve this problem‎, ‎we combine a discretization method and a neural network method‎. ‎by a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem‎. ‎then‎, ‎we use...

We clarify a financial meaning of duality in the semi-infinite programming problem which emerges in the context of determining a derivative price range based only on the no-arbitrage assumption and the observed prices of other derivatives. The interpretation links studies in the above context to studies in stochastic models.