How do you solve a linear programming problem?

Answer:

Maximise 16x1 + 6x2 + 12x3 subject to

4x1 + 8x2 + 6x3 £ 125

6x1 + 12x2 + 15x3 ³ 120

7x1 + 9x2 + 8x3 = 105

x1 ³ 0, x2 ³ 0, x3 ³ 0

Note: There are comments associated with this question. See the discussion page to add to the conversation.
First answer by ID2057520739. Last edit by ID2057520739. Question popularity: 8 [recommend question].