Minimization Problem in Model Predictive Control Using a Modified Simplex Method

Authors : Mokeddem DIAB

Pages : 199-210

View : 19 | Download : 12

Publication Date : 0000-00-00

Article Type : Research Paper

Abstract :Since the simplex method requires the polyhedron to be in the positive domain, the 1-norm minimization problems are formulated by substantially increasing the size of the linear programming insert ignore into journalissuearticles values(LP); problems. This paper presents a simple modification that enables the simplex method to be directly applicable to a polyhedron, which extends into the negative domain. That is, instead of requiring the problem to change, the method is changed to fit the problem. The modification eliminates the need to increase the size of the problem and thus eliminates the associated computational effort. The proposed method skips iterations and Phase 1 of the simplex method. Its computational advantage is verified in 2 examples.
Keywords : Simplex method, Minimization of absolute value, 1 Norm minimization, Predictive control