Linear Software Question

I am trying to prepare for my medium term, and I selected some problems from my book of algorithms, but it seems that I can not understand the following problem:

Find the necessary and sufficient conditions for the reals a and b, under which the linear program

max: x+y
ax + by <=1
x, y =>0

(a) is unacceptable. (b) unlimited. (c) has a finite and unique optimal solution.

here's what i came up with: for (a) we can add another constraint: ax + by => 5

I am not sure what to do with b and c. I'm not sure. If I am allowed to change restrictions that I have already been granted, or add new ones.

Any help would be appreciated. Thanks so much for the promotion.

+3
source share
3 answers

a) , , , . b) a b ,
c) a b , , .

+1

. . , a b, ax + <= 1

. , a <= 0, b <= 0.

. , a = b a > 0 b > 0

0

(a): , a = 0 b < 0 a < 0 b = 0

-1

Source: https://habr.com/ru/post/1775058/


All Articles