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.展开更多
In this paper, for a second-order three-point boundary value problem u″＋f（t,u）=0,0〈t〈1,au（0）-bu′（0）=0,u（1）-au（η）=0,where η∈ （0, 1）, a, b, α ∈R with a^2 ＋ b^2 〉 0, the existence of its nontrivia...In this paper, for a second-order three-point boundary value problem u″＋f（t,u）=0,0〈t〈1,au（0）-bu′（0）=0,u（1）-au（η）=0,where η∈ （0, 1）, a, b, α ∈R with a^2 ＋ b^2 〉 0, the existence of its nontrivial solution is studied. The＇conditions on f which guarantee the existence of nontrivial solution are formulated. As an application, some examples to demonstrate the results are given.展开更多
A new upper and lower solution theory is presented for the second order problem （G＇（y））＇＋ f（t, y） = 0 on finite and infinite intervals. The theory on finite intervals is based on a Leray-Schauder alternative,...A new upper and lower solution theory is presented for the second order problem （G＇（y））＇＋ f（t, y） = 0 on finite and infinite intervals. The theory on finite intervals is based on a Leray-Schauder alternative, where as the theory on infinite intervals is based on results on the finite interval and a diagonalization process.展开更多
基金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.
基金This work was supported by Key Academic Discipline of Zhejiang Province of China(2005)the Natural Science Foundation of Zhejiang Province of China(Y605144)the Education Department of Zhejiang Province of China(20051897).
文摘In this paper, for a second-order three-point boundary value problem u″＋f（t,u）=0,0〈t〈1,au（0）-bu′（0）=0,u（1）-au（η）=0,where η∈ （0, 1）, a, b, α ∈R with a^2 ＋ b^2 〉 0, the existence of its nontrivial solution is studied. The＇conditions on f which guarantee the existence of nontrivial solution are formulated. As an application, some examples to demonstrate the results are given.
基金Supported by Grant No.201/01/1451 of the Grant Agency of Czech Republicthe Council of Czech Government J14/98:153100011
文摘A new upper and lower solution theory is presented for the second order problem （G＇（y））＇＋ f（t, y） = 0 on finite and infinite intervals. The theory on finite intervals is based on a Leray-Schauder alternative, where as the theory on infinite intervals is based on results on the finite interval and a diagonalization process.
