In this work, we propose an algorithm for finding an approximate global minimum of a concave quadratic function with a negative semi-definite matrix, subject to linear equality and inequality constraints, where the variables are bounded with finite or infinite bounds. The proposed algorithm starts with an initial extreme point, then it moves from the current extreme point to a new one with a better objective function value. The passage from one basic feasible solution to a new one is done by the construction of certain approximation sets and solving a sequence of linear programming problems. In order to compare our algorithm with the existing approaches, we have developed an implementation with MATLAB and conducted numerical experiments on numerous collections of test problems. The obtained numerical results show the accuracy and the efficiency of our approach.
In this work, we have modelled the problem of maximizing the velocity of a rocket moving with a rectilinear motion by a linear optimal control problem, where the control represents the action of the pilot on the rocket. In order to solve the obtained model, we applied both analytical and numerical methods. The analytical solution is calculated using the Pontryagin maximum principle while the approximate solution of the problem is found using the shooting method as well as two techniques of discretization: the technique using the Cauchy formula and the one using the Euler formula. In order to compare the different methods, we developed an implementation with MATLAB and presented some simulation results.
We develop a single artificial variable technique to initialize the primal support method for solving linear programs with bounded variables. We first recall the full artificial basis technique, then we will present the proposed algorithm. In order to study the performances of the suggested algorithm, an implementation under the MATLAB programming language has been developed. Finally, we carry out an experimental study about CPU time and iterations number on a large set of the NETLIB test problems. These test problems are practical linear programs modelling various real-life problems arising from several fields such as oil refinery, audit staff scheduling, airline scheduling, industrial production and allocation, image restoration, multisector economic planning, and data fitting. It has been shown that our approach is competitive with our implementation of the primal simplex method and the primal simplex algorithm implemented in the known open-source LP solver LP_SOLVE.
In this work, we have proposed a new approach for solving the linear-quadratic optimal control problem, where the quality criterion is a quadratic function, which can be convex or non-convex. In this approach, we transform the continuous optimal control problem into a quadratic optimization problem using the Cauchy discretization technique, then we solve it with the active-set method. In order to study the efficiency and the accuracy of the proposed approach, we developed an implementation with MATLAB, and we performed numerical experiments on several convex and non-convex linearquadratic optimal control problems. The obtained simulation results show that our method is more accurate and more efficient than the method using the classical Euler discretization technique. Furthermore, it was shown that our method fastly converges to the optimal control of the continuous problem found analytically using the Pontryagin's maximum principle.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.