In this paper we study the nonsmooth semi-infinite programming problem with inequality constraints. First, we consider the notions of local cone approximation $Lambda$ and $Lambda$-subdifferential. Then, we derive the Karush-Kuhn-Tucker optimality conditions under the Abadie and the Guignard constraint qualifications.

A typical discrete-time sequential decision problem involves a system whose state is assumed to evolve either deterministically or probabilistically over time-periods that are often called stages. This evolution is affected by the decisions a planner makes at the beginning of each stage after observing the system state. The decision maker’s goal then is to optimize some measure of system perfor...

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

in this paper, we investigate infinite product representation of the solution of a sturm-liouville equation with an indefinite weight function which has two zeros and/or singularitiesin a finite interval. first, by using of the asymptotic estimates provided in [w. eberhard, g.freiling, k. wilcken-stoeber, indefinite eigenvalue problems with several singular pointsand turning points, math. nachr...