no software, no matlab etc- please write/type it out as though you are answering without access to a software.

Use Simplex method and then solve their duals using duality theory (including complementary slackness conditions). Try to formulate an LP problem such that its dual has exactly the same feasible region. 11. Maximize z=3x1+x2+3x3+x4 subject to x1+x2+4x3+x462x1+6x3+2x4820x1+2x2+47x3+11x448x10,x20,x30,x40