I am having trouble understanding the feasibility of dual programs. I am new in this topic and some help would be greatly appreciated :))
For example , here i have two problems in duality :
The primal (P) which is
max 1 + 32
1 + 22≤ 7
x≥0
and the dual (D) which is
min 7
≥1
2≥3
≥0.
On the answer sheet it states that x=(0,0) fulfills the constraints of the primal problem and =2 satisfies the dual constraint, so both problems are feasible.
Couldn't y=3 satisfy the dual constraint ?
I do not really understand this answer. Where are the x=(0,0) and the =2 coming from and how are they linked to feasibility ?
Thanks for the help guys !