Simplex method in prime how to use the constrains maximise s.t. constraints.

[ftneek]

Generally the system of equations must be converted into standard form and the coefficients extracted into a matrix, and then a series of pivots and row reductions are performed. There are different styles of standard form depending on the source.

I recommend searching online for "simplex method examples" for videos and examples to get a better idea of how it works or referring to a linear programming textbook for more details.

This text uses minimization for standard form, it's discussed in section 3.1. Section 3.5 shows examples of the simplex method in tableau/matrix form.
An Introduction to Linear Programming and Game Theory 3rd Edition, Paul R. Thie and Gerard E. Keough (ISBN: 978-0470232866).