How can we express union of two or more constraints, for example x ≥ 0 ∨ y ≥ 0, in an inequality system as below: f 1 ( x , y ) ≥ 0 f 2 ( x , y ) ≥ 0 f 3 ( x , y ) ≥ 0 ⋮where f i ∈ C 1 . This feasible set is not necessarily a convex set, hence there is not any linear inequality system for this problem. Is there any non-linear one?

Question

How can we express union of two or more constraints, for example   x  ≥  0  ∨  y  ≥  0, in an inequality system as below:      f    1    (  x  ,  y  )  ≥  0        f    2    (  x  ,  y  )  ≥  0        f    3    (  x  ,  y  )  ≥  0      ⋮where       f    i    ∈        C    1  .  This feasible set is not necessarily a convex set, hence there is not any linear inequality system for this problem. Is there any non-linear one?

jmibanezla · Accepted Answer

It is not clear to me what you are asking, you could write       max    k        f    f    (  x  ,  y  )  ≥  0, but that is just a notation, it doesn&#039;t change anything.

How can we express union of two or more constraints, for example x ≥ 0 &#x

Answered question

Answer & Explanation

New Questions in Algebra I