This paper deals with testing a numerical solution for the discrete classical optimal control problem governed by a linear hyperbolic boundary value problem with variable coefficients. When the discrete classical control is fixed, the proof of the existence and uniqueness theorem for the discrete solution of the discrete weak form is achieved. The existence theorem for the discrete classical optimal control and the necessary conditions for optimality of the problem are proved under suitable assumptions. The discrete classical optimal control problem (DCOCP) is solved by using the mixed Galerkin finite element method to find the solution of the discrete weak form (discrete state). Also, it is used to find the solution for the discrete adjoint weak form (discrete adjoint) with the Gradient Projection method (GPM) , the Gradient method (GM), or the Frank Wolfe method (FWM) to the DCOCP. Within each of these three methods, the Armijo step option (ARSO) or the optimal step option (OPSO) is used to improve (to accelerate the step) the solution of the discrete classical control problem. Finally, some illustrative numerical examples for the considered discrete control problem are provided. The results show that the GPM with ARSO method is better than GM or FWM with ARSO methods. On the other hand, the results show that the GPM and GM with OPSO methods are better than the FWM with the OPSO method.
In this work, nonlinear diabetes controlled model with and without complications in a population is considered. The dynamic behavior of diabetes in a population by including a constant control is studied and investigated. The existence of all its possible fixed points is investigated as well as the conditions of the local stability of the considered model are set. We also find the optimal control strategy in order to reduce the number of people having diabetes with complications over a finite period of time. A numerical simulation is provided and confirmed the theoretical results.
The method of operational matrices is based on the Bernoulli and Shifted Legendre polynomials which is used to solve the Falkner-Skan equation. The nonlinear differential equation converting to a system of nonlinear equations is solved using Mathematica®12, and the approximate solutions are obtained. The efficiency of these methods was studied by calculating the maximum error remainder ( ), and it was found that their efficiency increases as increases. Moreover, the obtained approximate solutions are compared with the numerical solution obtained by the fourth-order Runge-Kutta method (RK4), which gives a good agreement.
The fuzzy sets theory has been applied in many fields, such as operations research, control theory and management sciences, etc. In particular, an application of this theory in decision making problem is linear programming problems with fuzzy technological coefficients numbers, as well as studying the parametric linear programming problems in the case of changes in the objective function. In this paper presenting a new procedure which connects and makes link between fuzzy linear programming problem with fuzzy technological coefficients numbers and parametric linear programming problem with change in coefficients of the objective function, then develop a numerical example illustrates the steps of solution to this kind of problems.
ABSTRICT:
This study is concerned with the estimation of constant and time-varying parameters in non-linear ordinary differential equations, which do not have analytical solutions. The estimation is done in a multi-stage method where constant and time-varying parameters are estimated in a straight sequential way from several stages. In the first stage, the model of the differential equations is converted to a regression model that includes the state variables with their derivatives and then the estimation of the state variables and their derivatives in a penalized splines method and compensating the estimations in the regression model. In the second stage, the pseudo- least squares method was used to es
... Show MoreDens itiad ns vcovadoay fnre Dec2isco0D,ia asrn2trcds4 fenve ns 6ocfo ts ida%n2notd, rasr sedno6t(a asrn2trcd fnre sc2a 2cynwnvtrnco co nrs wcd2 /nt sedno6t(a fan(er wtvrcd ﯿ)ﺔ mh Dens r,ia cw asrn2trcds et/a laao vcosnyaday wcd asrn2trno( rea itdt2arads ﻘ cw sn2i%a %noatd da(dassnco 2cya%4 feao t idncd asrn2tra cw rea itdt2arad /t%ua )ﻘm ns t/tn%tl%a4 st, ﻘxh Dens ﻘx ets laao dawadday no srtrnsrnvt% %nradtrudas ts (uass icnor tlcur rea itdt2arad ﻘh Dea aMidassncos wcd Snts4 Oato -9utday 8ddcd )O-8m toy .a%trn/a 8wwnvnaov, cw rea idcicsay asrn2trcds tda clrtnoayh 1u2adnvt% dasu%rs tda idc/nyay feao rea
... Show MoreGiven a binary matrix, finding the maximum set of columns such that the resulting submatrix has the Consecutive Ones Property (C1P) is called the Consecutive Ones Submatrix (C1S) problem. There are solution approaches for it, but there is also a room for improvement. Moreover, most of the studies of the problem use exact solution methods. We propose an evolutionary approach to solve the problem. We also suggest a related problem to C1S, which is the Consecutive Blocks Minimization (CBM). The algorithm is then performed on real-world and randomly generated matrices of the set covering type.
Abstract Political power in Lebanon is a fundamental objective of any political organization, whether political party or political group. Thus, there is a conflict of power. There are two kinds of political conflict that are differentiated by the idea of legitimacy. The competition is in the political system when the agreement between the social forces is considered legitimate, and the conflict is on the political system when the agreement between these forces ceases to be legitimate and Are working to topple it and seek to establish an alternative system. Therefore, the succession of power in Lebanon is a result of the competition and political conflict, which is in turn a result of the large number of regional and international players
... Show More