In this paper, the nonlinear programming problem with quasimonotonic （ both quasiconvex and quasiconcave ）objective function and linear constraints is considered. With the decomposition theorem of polyhedral sets, t...In this paper, the nonlinear programming problem with quasimonotonic （ both quasiconvex and quasiconcave ）objective function and linear constraints is considered. With the decomposition theorem of polyhedral sets, the structure of optimal solution set for the programming problem is depicted. Based on a simplified version of the convex simplex method, the uniqueness condition of optimal solution and the computational procedures to determine all optimal solutions are given, if the uniqueness condition is not satisfied. An illustrative example is also presented.展开更多
Using a fixed point theorem by Kuo, Jeng and Huang, we obtain in G-convex spaces a very general intersection theorem concerning the values of three maps. From this result we derive successively alternative theorems co...Using a fixed point theorem by Kuo, Jeng and Huang, we obtain in G-convex spaces a very general intersection theorem concerning the values of three maps. From this result we derive successively alternative theorems concerning maximal elements, analytic alternatives and minimax inequalities.展开更多
In this paper,two existence theorems are given concerning the following 3-point boundary value problem of second order differential systems with impulses[HL(2:1,1Z;2,1Z]x″(t)=f(t,x(t),x′(t)),t∈(0,1),t≠t_k,k=1,2,.....In this paper,two existence theorems are given concerning the following 3-point boundary value problem of second order differential systems with impulses[HL(2:1,1Z;2,1Z]x″(t)=f(t,x(t),x′(t)),t∈(0,1),t≠t_k,k=1,2,...,m, Δx|_~t=t_k =I_k(x(t_k)),k=1,2,...,m, Δx′|_~t=t_k =J_k(x(t_k),x′(t_k)),k=1,2,...,m, x(0)=0,x(1)=αx(η).展开更多
In this paper, two alternative theorems which differ from Theorem 10.2.6 in [1] and Theorem 1 in [3] are presented for a class of feasible direction algorithms. On the basis of alternative theorems, furthermore, two s...In this paper, two alternative theorems which differ from Theorem 10.2.6 in [1] and Theorem 1 in [3] are presented for a class of feasible direction algorithms. On the basis of alternative theorems, furthermore, two sufficient conditions of global convergence of this class of algorithms are obtained.展开更多
基金Supported by the Research Foundation of Jinan University(04SKZD01).
文摘In this paper, the nonlinear programming problem with quasimonotonic （ both quasiconvex and quasiconcave ）objective function and linear constraints is considered. With the decomposition theorem of polyhedral sets, the structure of optimal solution set for the programming problem is depicted. Based on a simplified version of the convex simplex method, the uniqueness condition of optimal solution and the computational procedures to determine all optimal solutions are given, if the uniqueness condition is not satisfied. An illustrative example is also presented.
文摘Using a fixed point theorem by Kuo, Jeng and Huang, we obtain in G-convex spaces a very general intersection theorem concerning the values of three maps. From this result we derive successively alternative theorems concerning maximal elements, analytic alternatives and minimax inequalities.
文摘In this paper,two existence theorems are given concerning the following 3-point boundary value problem of second order differential systems with impulses[HL(2:1,1Z;2,1Z]x″(t)=f(t,x(t),x′(t)),t∈(0,1),t≠t_k,k=1,2,...,m, Δx|_~t=t_k =I_k(x(t_k)),k=1,2,...,m, Δx′|_~t=t_k =J_k(x(t_k),x′(t_k)),k=1,2,...,m, x(0)=0,x(1)=αx(η).
文摘In this paper, two alternative theorems which differ from Theorem 10.2.6 in [1] and Theorem 1 in [3] are presented for a class of feasible direction algorithms. On the basis of alternative theorems, furthermore, two sufficient conditions of global convergence of this class of algorithms are obtained.
