Linear Programm...

Which of the following sets are not convex?

Consider the linear programming problem
Maximise z = 4x + y
Subject to constraints x + y ≤ 50, x + y ≥ 100,
and x, y ≥ 0
Then, maximum value of z is

The point which provides the solution of the linear programming problem, maximise z = 45x + 55y
Subject to constraints x, y ≥ 0, 6x + 4y ≤ 120 and 3x + 10y ≤ 180 is

The linear programming problem
Maximise z = x₁ + x₂
Subject to constraints x₁ + 2x₂ ≤ 2000, x₁ + x₂ ≤ 1500, x₂ ≤ 600 and x₁ ≥ 0 has

The optimal value of the objective function is attained at the point is

The maximum value of z = 9x + 13y, subject to constraints 2x + 3y ≤ 18, 2x + y ≤ 10, x ≥ 0 and y ≥ 0 is

The maximum value of z = 10x + 6y, subject to constraints x ≥ 0, y ≥ 0, x + y ≤ 12, 2x + y ≤ 20 is

A vertex of a feasible region by the linear constraints 3x + 4y ≤ 18, 2x + 3y ≥ 3 and x, y ≥ 0 is

For an LPP, minimise z = 2x + y subject to constraints 5x + 10y ≤ 50 , x + y ≥ 1, y ≤ 4 and x,y ≥ 0, then z is equal to

For the LPP, minimise z = x₁ + x₂ such that inequalities 5x₁ + 10x₂ ≥ 0, x₁ + x₂ ≤ 1, x₂ ≤ 4 and x₁ , x₂ ≥ 0