Linear inequalities and linear programming

Question 1 of 10

Solve 4x − 3 > 37.

Question 2 of 10

A carpenter makes x chairs and y tables. A chair takes 2 hours and a table 2 hours, and he has at most 12 hours. He can make at most 4 chairs. Profit is GH₵ 30 per chair and GH₵ 50 per table. (a) Write the inequalities. (b) Find the corner points of the feasible region. (c) Find the combination that gives maximum profit.

Question 3 of 10

A broken (dotted) line on a graph of an inequality means

Question 4 of 10

How many integers satisfy −3 < x ≤ 0? ___

Question 5 of 10

Solve 2x + 8 > 0.

Question 6 of 10

Solve 3x + 7 < 1.

Question 7 of 10

Solve 3x + 12 < 42.

Question 8 of 10

How many integers satisfy −1 < x ≤ 4? ___

Question 9 of 10

In linear programming, the "feasible region" is

Question 10 of 10

Solve −2x ≤ 10.