Abstract
This paper discusses the application of matrix-vector operations technique for solving constrained optimization problems. The method is aimed at circumventing the computational rigours undergone using the simplex and revised simplex method in solving this class of problems with aim of reducing the computer memory space occupied by the methods. In other to achieve this, a straightforward and simple to handle matrix-vector operations algorithm has been developed to solve the same constrained problems. Numerical results show some improvements compared with the classical method.
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
