I am presuming this is a feasibility problem, because no objective function is displayed. This is a Linear Programming feasibility problem because the constraints are linear (affine)…

Declare `x`

as a variable of appropriate dimension. Place the two inequalities between `cvx_begin`

and `cvx_end`

. Presuming the solver does not encounter numerical difficulties, CVX will call the solver to produce an `x`

which satisfies both inequalities if thee is one, otherwise it will report the problem is infeasible.

If there is an objective function, insert a `minimize`

or `maximize`

statement somewhere after the variable declaration.

Please read the CVX Users’ Guide.