974 resultados para Linear semi-infinite optimization
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Técnicas de otimização numérica são úteis na solução de problemas de determinação da melhor entrada para sistemas descritos por modelos matemáticos e cujos objetivos podem ser expressos de uma maneira quantitativa. Este trabalho aborda o problema de otimizar as dosagens dos medicamentos no tratamento da AIDS em termos de um balanço entre a resposta terapêutica e os efeitos colaterais. Um modelo matemático para descrever a dinâmica do vírus HIV e células CD4 é utilizado para calcular a dosagem ótima do medicamento no tratamento a curto prazo de pacientes com AIDS por um método de otimização direta utilizando uma função custo do tipo Bolza. Os parâmetros do modelo foram ajustados com dados reais obtidos da literatura. Com o objetivo de simplificar os procedimentos numéricos, a lei de controle foi expressa em termos de uma expansão em séries que, após truncamento, permite obter controles sub-ótimos. Quando os pacientes atingem um estado clínico satisfatório, a técnica do Regulador Linear Quadrático (RLQ) é utilizada para determinar a dosagem permanente de longo período para os medicamentos. As dosagens calculadas utilizando a técnica RLQ , tendem a ser menores do que a equivalente terapia de dose constante em termos do expressivo aumento na contagem das células T+ CD4 e da redução da densidade de vírus livre durante um intervalo fixo de tempo.
Resumo:
In early studies, we have reported the antinociceptive profile of (-)-spectaline, a piperidine alkaloid from Cassia spectabilis. The present study describes the synthesis, the antinociceptive and anti-inflammatory activities of a series of 2,3,6-trialkyl-piperidine alkaloids: the natural (-)-3-O-acetyl-spectaline (LASSBio-755) and ten semi-synthetic spectaline derivatives. Structure-activity relationship (SARs) studies were performed. The structures of all synthesized derivatives were confirmed by means of nuclear magnetic resonance. Compounds were evaluated for their analgesic (acetic acid-induced mouse abdominal constrictions, hot-plate test, formalin-induced pain test) and some of them for the anti-inflammatory activities (carrageenan-induced rat paw edema test). The pharmacological results showed that several of the new compounds given orally at a dose of 100 mu mol/kg significantly inhibited the acetic acid-induced abdominal constrictions, but they were less active than (-)-spectaline. LASSBio-755 and LASSBio-776 were the most actives with 37% and 31.7% of inhibition. In the formalin-induced pain only LASSBio-776 was able to inhibit by 34.4% the paw licking response of the inflammatory phase, (-)-spectaline and LASSBio-755 did show any activity. In the carrageenan-induced rat paw edema, only (-)-spectaline exhibited an anti-inflammatory profile, showing an ED(50) value of 56.6 mu mol/kg. Our results suggest different mechanisms of action for the analgesic activity observed for LASSBio-776 (3-O-Bocspectaline), LASSBio-755 (3-O-acetyl-spectaline) and (-)-spectaline (LASSBio-754). The antinociceptive profile of some of the semi-synthetic spectaline derivatives extends our research concerning the chemical and pharmacological optimization of isolated natural products in the search of new drug candidates from brazilian biodiversity.
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
The extended linear complementarity problem (XLCP) has been introduced in a recent paper by Mangasarian and Pang. In the present research, minimization problems with simple bounds associated to this problem are defined. When the XLCP is solvable, their solutions are global minimizers of the associated problems. Sufficient conditions that guarantee that stationary points of the associated problems are solutions of the XLCP will be proved. These theoretical results support the conjecture that local methods for box constrained optimization applied to the associated problems could be efficient tools for solving the XLCP. (C) 1998 Elsevier B.V. All rights reserved.
Resumo:
In this paper we consider nonautonomous optimal control problems of infinite horizon type, whose control actions are given by L-1-functions. We verify that the value function is locally Lipschitz. The equivalence between dynamic programming inequalities and Hamilton-Jacobi-Bellman (HJB) inequalities for proximal sub (super) gradients is proven. Using this result we show that the value function is a Dini solution of the HJB equation. We obtain a verification result for the class of Dini sub-solutions of the HJB equation and also prove a minimax property of the value function with respect to the sets of Dini semi-solutions of the HJB equation. We introduce the concept of viscosity solutions of the HJB equation in infinite horizon and prove the equivalence between this and the concept of Dini solutions. In the Appendix we provide an existence theorem. (c) 2006 Elsevier B.V. All rights reserved.
Resumo:
This work presents a mathematical model for helping mills choose sugarcane varieties for planting. It maximizes crop residual biomass energy balance by considering the difference between generated and consumed energy in the process of transferring this biomass from the field to the processing center; it takes into account enterprise demand restrictions and cane planting area. For this full zero-one linear programming techniques were proposed. The model is viable for choosing sugarcane varieties that would benefit sugarcane production and industrial systems, by reducing crop residue and increasing final energy production. (c) 2006 Published by Elsevier Ltd.
Resumo:
We propose a method for accelerating iterative algorithms for solving symmetric linear complementarity problems. The method consists in performing a one-dimensional optimization in the direction generated by a splitting method even for non-descent directions. We give strong convergence proofs and present numerical experiments that justify using this acceleration.
Resumo:
This work was conducted to evaluate food intake and digestive efficiency of temperate wool and tropic semi-arid hair lambs, according to different concentrate: forage ratios in diet. Twenty-four lambs, averaging 90 +/- 1.8 days old and a mean body weight of 20 +/- 0.69 kg, 12 of them wool lambs, F, from Ideal x Ile de France crossing, and 12 others pure Santa Ines hair lambs, were distributed into a four replication 3 x 2 factorial arrangement consisting of three diets and two genotypes. Experimental diets consisted of: D1 = 60% concentrate mix (C) and 40% Cynodon sp. cv. Tifton-85 hay (F), D2 = 40% C and 60% F, and D3 = 20% C and 80% F. D1 was formulated for a daily gain of 300g per animal. Increasing forage levels in diets resulted in linear reductions (P < 0.01) in DM, OM, CP, TCH and metabolizable energy (ME) intake, and a linear increase (P < 0.01) in NDF ingestion. Tropic semi-arid hair lambs had higher DM, OM, NDF, CP, and TCH intake than temperate wool lambs. Although there were no genotype effects in OM and GE coefficient of digestibility, hair lambs showed more efficient (P < 0.05) digestibility of DM, CP, NDF and TCH. Increases in forage levels of diets corresponded to a negative linear effect (P < 0.01) in the apparent digestibility of DM, OM, CP, TCH and GE, while apparent digestibility of NDF increased linearly (P < 0.01). Total endogenous nitrogen (fecal plus urinary N) for F(1) Ideal x Ilede France wool and Santa Ines hair lambs were, respectively, 182 and 312 mg/kg(0.75) per day. Thus, Santa Ines tropic semi-arid hair lambs showed to be more responsive than F(1) Ideal x Ile de France temperate wool lambs to low quality fibrous diets. (C) 2004 Elsevier B.V. All rights reserved.
Resumo:
One hundred and twenty crossbred pigs (Large White x Landrace) weaned at an average age of 28 days, were used. Pigs were alloted to five dietary treatments according to weight, sex and litter as follows: T1- Simple diet (SD) during whole Starter phase (SP) (28-63 days); T2- Semi-complex diet (SCD) for the first seven days followed by a SD during 28 days of SP; T3- SCD for the first 14 days followed by SD during 21 days of SP; T4- SCD for the first 21 days followed by SD during 14 days of SP; T5- SCD during the entire SP. A completely randomized block design was used with six replications. At the end of the SP one castrated male and one female, weighing closest to the average live weight of the group, were transferred to growing-finishing pens and fed growing-finishing diets ad libitum until they reached approximately 90kg live weight. Increasing the period of feeding the semi-complex diet resulted in a linear increase in average daily feed intake and average daily gain during the first 28 days of the initial phase. However, when the entire initial phase was considered there was a linear increase only in daily feed intake. There were no differences in incidence and severity of diarrhea in SP or in the performance of pigs during the growing-finishing phases. There were was no differences in average daily gain among diets from weaning to 90 kg body weight. It was concluded that the advantage of the semi-complex starter diet tended to disappear as age increased.
Resumo:
The increase of computing power of the microcomputers has stimulated the building of direct manipulation interfaces that allow graphical representation of Linear Programming (LP) models. This work discusses the components of such a graphical interface as the basis for a system to assist users in the process of formulating LP problems. In essence, this work proposes a methodology which considers the modelling task as divided into three stages which are specification of the Data Model, the Conceptual Model and the LP Model. The necessity for using Artificial Intelligence techniques in the problem conceptualisation and to help the model formulation task is illustrated.
Resumo:
A branch and bound algorithm is proposed to solve the H2-norm model reduction problem for continuous-time linear systems, with conditions assuring convergence to the global optimum in finite time. The lower and upper bounds used in the optimization procedure are obtained through Linear Matrix Inequalities formulations. Examples illustrate the results.
Resumo:
This paper is concerned with the stability of discrete-time linear systems subject to random jumps in the parameters, described by an underlying finite-state Markov chain. In the model studied, a stopping time τ Δ is associated with the occurrence of a crucial failure after which the system is brought to a halt for maintenance. The usual stochastic stability concepts and associated results are not indicated, since they are tailored to pure infinite horizon problems. Using the concept named stochastic τ-stability, equivalent conditions to ensure the stochastic stability of the system until the occurrence of τ Δ is obtained. In addition, an intermediary and mixed case for which τ represents the minimum between the occurrence of a fix number N of failures and the occurrence of a crucial failure τ Δ is also considered. Necessary and sufficient conditions to ensure the stochastic τ-stability are provided in this setting that are auxiliary to the main result.
Resumo:
In this paper is proposed a methodology for semiautomatic CBERS image orientation using roads as ground control. It is based on an iterative strategy involving three steps. In the first step, an operator identifies on the image the ground control roads and supplies along them a few seed points, which could be sparsely and coarsely distributed. These seed points are used by the dynamic programming algorithm for extracting the ground control roads from the image. In the second step, it is established the correspondences between points describing the ground control roads and the corresponding ones extracted from the image. In the last step, the corresponding points are used to orient the CBERS image by using the DLT (Direct Linear Transformation). The two last steps are iterated until the convergence of the orientation process is verified. Experimental results showed that the proposed methodology was efficient with several test images. In all cases the orientation process converged. Moreover, the estimated orientation parameters allowed the registration of check roads with pixel accuracy or better.
Resumo:
A branch and bound algorithm is proposed to solve the [image omitted]-norm model reduction problem for continuous and discrete-time linear systems, with convergence to the global optimum in a finite time. The lower and upper bounds in the optimization procedure are described by linear matrix inequalities (LMI). Also proposed are two methods with which to reduce the convergence time of the branch and bound algorithm: the first one uses the Hankel singular values as a sufficient condition to stop the algorithm, providing to the method a fast convergence to the global optimum. The second one assumes that the reduced model is in the controllable or observable canonical form. The [image omitted]-norm of the error between the original model and the reduced model is considered. Examples illustrate the application of the proposed method.