Let A and B represent two linear inequalities: A : a 1 </msub> x

measgachyx5q9

measgachyx5q9

Answered question

2022-05-15

Let A and B represent two linear inequalities:
A : a 1 x 1 + . . . + a n x n k 1
B : b 1 x 1 + . . . + b n x n k 2
If A and B is unsatisfiable (does not have solution), does the following hold in general (the conjunction of two inequalities implies the summation of them )? If so, I am looking for a formal proof?
A B A + B
𝑎 1 𝑥 1 + . . . + 𝑎 n 𝑥 n 𝑘 1 𝑏 1 𝑥 1 + . . . 𝑏 n 𝑥 n 𝑘 2 𝑎 1 𝑥 1 + . . . + 𝑎 n 𝑥 n + 𝑏 1 𝑥 1 + . . . 𝑏 n 𝑥 n 𝑘 1 + 𝑘 2
and then I would like to generalize the above theorem to summation of several inequalities.

Answer & Explanation

Carolyn Farmer

Carolyn Farmer

Beginner2022-05-16Added 16 answers

It's still false, even with the unsatisfiability assumption.
Consider the inequalities
2 x > 2 x > 3
Their sum is
x > 5
i.e., x < 5. But x < 5 does not imply that x > 3.
quorums15lep

quorums15lep

Beginner2022-05-17Added 4 answers

I don't see how the linear combination part is relevant. A k 1 , B k 2 A + B k 1 + k 2 regardless of where A and Bcome from. This can be seem by
A k 2
A k 1 0
B + ( A k 1 ) B k 2
B + A k 1 + k 2

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?