703 research outputs found

    Multiple positive solutions for a superlinear problem: a topological approach

    Full text link
    We study the multiplicity of positive solutions for a two-point boundary value problem associated to the nonlinear second order equation u+f(x,u)=0u''+f(x,u)=0. We allow xf(x,s)x \mapsto f(x,s) to change its sign in order to cover the case of scalar equations with indefinite weight. Roughly speaking, our main assumptions require that f(x,s)/sf(x,s)/s is below λ1\lambda_{1} as s0+s\to 0^{+} and above λ1\lambda_{1} as s+s\to +\infty. In particular, we can deal with the situation in which f(x,s)f(x,s) has a superlinear growth at zero and at infinity. We propose a new approach based on the topological degree which provides the multiplicity of solutions. Applications are given for u+a(x)g(u)=0u'' + a(x) g(u) = 0, where we prove the existence of 2n12^{n}-1 positive solutions when a(x)a(x) has nn positive humps and a(x)a^{-}(x) is sufficiently large.Comment: 36 pages, 3 PNG figure

    Existence of positive solutions in the superlinear case via coincidence degree: the Neumann and the periodic boundary value problems

    Full text link
    We prove the existence of positive periodic solutions for the second order nonlinear equation u"+a(x)g(u)=0u" + a(x) g(u) = 0, where g(u)g(u) has superlinear growth at zero and at infinity. The weight function a(x)a(x) is allowed to change its sign. Necessary and sufficient conditions for the existence of nontrivial solutions are obtained. The proof is based on Mawhin's coincidence degree and applies also to Neumann boundary conditions. Applications are given to the search of positive solutions for a nonlinear PDE in annular domains and for a periodic problem associated to a non-Hamiltonian equation.Comment: 41 page

    Pairs of positive periodic solutions of nonlinear ODEs with indefinite weight: a topological degree approach for the super-sublinear case

    Get PDF
    We study the periodic and the Neumann boundary value problems associated with the second order nonlinear differential equation \begin{equation*} u'' + c u' + \lambda a(t) g(u) = 0, \end{equation*} where g ⁣:[0,+[[0,+[g \colon \mathopen{[}0,+\infty\mathclose{[}\to \mathopen{[}0,+\infty\mathclose{[} is a sublinear function at infinity having superlinear growth at zero. We prove the existence of two positive solutions when 0Ta(t) ⁣dt<0\int_{0}^{T} a(t) \!dt < 0 and λ>0\lambda > 0 is sufficiently large. Our approach is based on Mawhin's coincidence degree theory and index computations.Comment: 26 page

    Equilibrium points, periodic solutions and the Brouwer fixed point theorem for convex and non-convex domains

    Get PDF
    We show the direct applicability of the Brouwer fixed point theorem for the existence of equilibrium points and periodic solutions for differential systems on general domains satisfying geometric conditions at the boundary. We develop a general approach for arbitrary bound sets and present applications to the case of convex and star-shaped domains. We also provide an answer to a question raised in a recent paper of Cid and Mawhin.Comment: 22 pages, 3 figure

    The multimode covering location problem

    Get PDF
    In this paper we introduce the Multimode Covering Location Problem. This is a generalization of the Maximal Covering Location Problem that consists in locating a given number of facilities of different types with a limitation on the number of facilities sharing the same site. The problem is challenging and intrinsically much harder than its basic version. Nevertheless, it admits a constant factor approximation guarantee, which can be achieved combining two greedy algorithms. To improve the greedy solutions, we have developed a Variable Neighborhood Search approach, based on an exponential-size neighborhood. This algorithm computes good quality solutions in short computational time. The viability of the approach here proposed is also corroborated by a comparison with a Heuristic Concentration algorithm, which is presently the most effective approach to solve large instances of the Maximal Covering Location Problem
    corecore