My bachelour thesis theme is "Parallel algorithms for solving linear programming problems". I am using the revised simplex method with LU decomposition. I don't know how to exploit the sparsity of the restrictions matrix other than tridiagonal systems.
In the attachments I have plotted some matrices I use. Do you know which methods should I use for this? How can I identify the patterns?
Thank you.
Showing the output of your code isn't particularly helpful. Please state the algorithms you are using, in detail (functionally). You mention stuff like "revised simplex method with LU decomposition", but you don't show specifically how your are applying these abstractions. Show the math...
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.