Free chapterTry everything here: cards, proofs and practice. Sign up free to save your progress and unlock all 4 chapters.Sign up free

OPTIM · 1

Linear programming

12 concepts · 16 questions

← Back to cards1 / 4

OPTIMStep●○○○○new1 Linear programming

Step 1 of 3 towards a full problem

The problem

Maximise $2x + 3y$ subject to $x + y\le4$ , $x + 3y\le6$ , $x, y\ge0$ . (a) List the vertices and find the optimum. (b) Write the dual and solve it using complementary slackness. (c) Check the optimal values agree.

Optimal vertex.