5,246 research outputs found

    Multiobjective optimization to a TB-HIV/AIDS coinfection optimal control problem

    Full text link
    We consider a recent coinfection model for Tuberculosis (TB), Human Immunodeficiency Virus (HIV) infection and Acquired Immunodeficiency Syndrome (AIDS) proposed in [Discrete Contin. Dyn. Syst. 35 (2015), no. 9, 4639--4663]. We introduce and analyze a multiobjective formulation of an optimal control problem, where the two conflicting objectives are: minimization of the number of HIV infected individuals with AIDS clinical symptoms and coinfected with AIDS and active TB; and costs related to prevention and treatment of HIV and/or TB measures. The proposed approach eliminates some limitations of previous works. The results of the numerical study provide comprehensive insights about the optimal treatment policies and the population dynamics resulting from their implementation. Some nonintuitive conclusions are drawn. Overall, the simulation results demonstrate the usefulness and validity of the proposed approach.Comment: This is a preprint of a paper whose final and definite form is with 'Computational and Applied Mathematics', ISSN 0101-8205 (print), ISSN 1807-0302 (electronic). Submitted 04-Feb-2016; revised 11-June-2016 and 02-Sept-2016; accepted for publication 15-March-201

    An efficient method for multiobjective optimal control and optimal control subject to integral constraints

    Full text link
    We introduce a new and efficient numerical method for multicriterion optimal control and single criterion optimal control under integral constraints. The approach is based on extending the state space to include information on a "budget" remaining to satisfy each constraint; the augmented Hamilton-Jacobi-Bellman PDE is then solved numerically. The efficiency of our approach hinges on the causality in that PDE, i.e., the monotonicity of characteristic curves in one of the newly added dimensions. A semi-Lagrangian "marching" method is used to approximate the discontinuous viscosity solution efficiently. We compare this to a recently introduced "weighted sum" based algorithm for the same problem. We illustrate our method using examples from flight path planning and robotic navigation in the presence of friendly and adversarial observers.Comment: The final version accepted by J. Comp. Math. : 41 pages, 14 figures. Since the previous version: typos fixed, formatting improved, one mistake in bibliography correcte

    A multiobjective optimization framework for multicontaminant industrial water network design.

    Get PDF
    The optimal design of multicontaminant industrial water networks according to several objectives is carried out in this paper. The general formulation of the water allocation problem (WAP) is given as a set of nonlinear equations with binary variables representing the presence of interconnections in the network. For optimization purposes, three antagonist objectives are considered: F1, the freshwater flow-rate at the network entrance, F2, the water flow-rate at inlet of regeneration units, and F3, the number of interconnections in the network. The multiobjective problem is solved via a lexicographic strategy, where a mixed-integer nonlinear programming (MINLP) procedure is used at each step. The approach is illustrated by a numerical example taken from the literature involving five processes, one regeneration unit and three contaminants. The set of potential network solutions is provided in the form of a Pareto front. Finally, the strategy for choosing the best network solution among those given by Pareto fronts is presented. This Multiple Criteria Decision Making (MCDM) problem is tackled by means of two approaches: a classical TOPSIS analysis is first implemented and then an innovative strategy based on the global equivalent cost (GEC) in freshwater that turns out to be more efficient for choosing a good network according to a practical point of view

    Singular Continuation: Generating Piece-wise Linear Approximations to Pareto Sets via Global Analysis

    Full text link
    We propose a strategy for approximating Pareto optimal sets based on the global analysis framework proposed by Smale (Dynamical systems, New York, 1973, pp. 531-544). The method highlights and exploits the underlying manifold structure of the Pareto sets, approximating Pareto optima by means of simplicial complexes. The method distinguishes the hierarchy between singular set, Pareto critical set and stable Pareto critical set, and can handle the problem of superposition of local Pareto fronts, occurring in the general nonconvex case. Furthermore, a quadratic convergence result in a suitable set-wise sense is proven and tested in a number of numerical examples.Comment: 29 pages, 12 figure

    Mutual benefits of two multicriteria analysis methodologies: A case study for batch plant design

    Get PDF
    This paper presents a MultiObjective Genetic Algorithm (MOGA) optimization framework for batch plant design. For this purpose, two approaches are implemented and compared with respect to three criteria, i.e., investment cost, equipment number and a flexibility indicator based on work in process (the so-called WIP) computed by use of a discrete-event simulation model. The first approach involves a genetic algorithm in order to generate acceptable solutions, from which the best ones are chosen by using a Pareto Sort algorithm. The second approach combines the previous Genetic Algorithm with a multicriteria analysis methodology, i.e., the Electre method in order to find the best solutions. The performances of the two procedures are studied for a large-size problem and a comparison between the procedures is then made

    A Descent Method for Equality and Inequality Constrained Multiobjective Optimization Problems

    Full text link
    In this article we propose a descent method for equality and inequality constrained multiobjective optimization problems (MOPs) which generalizes the steepest descent method for unconstrained MOPs by Fliege and Svaiter to constrained problems by using two active set strategies. Under some regularity assumptions on the problem, we show that accumulation points of our descent method satisfy a necessary condition for local Pareto optimality. Finally, we show the typical behavior of our method in a numerical example

    Optimal Control and Sensitivity Analysis of a Fractional Order TB Model

    Full text link
    A Caputo fractional-order mathematical model for the transmission dynamics of tuberculosis (TB) was recently proposed in [Math. Model. Nat. Phenom. 13 (2018), no. 1, Art. 9]. Here, a sensitivity analysis of that model is done, showing the importance of accuracy of parameter values. A fractional optimal control (FOC) problem is then formulated and solved, with the rate of treatment as the control variable. Finally, a cost-effectiveness analysis is performed to assess the cost and the effectiveness of the control measures during the intervention, showing in which conditions FOC is useful with respect to classical (integer-order) optimal control.Comment: This is a preprint of a paper whose final and definite form is with 'Statistics Opt. Inform. Comput.', Vol. 7, No 2 (2019). See [http://www.IAPress.org]. Submitted 09/Sept/2018; Revised 10/Dec/2018; Accepted 11/Dec/2018. arXiv admin note: text overlap with arXiv:1801.09634, arXiv:1810.0690
    corecore