First solution. Swapping, if necessary, the roles of a and c and those of b and d, we may assume that a≤c. In this case, the function f(x)=c+xa+x is increasing on [1,2], while g(x)=a+xc+x is decreasing on [1,2], hence b+ca+b+d+ac+d≤c+2a+2+a+1c+1. On the other hand, 4⋅b+da+c≥a+c, therefore it is sufficient to prove that c+2a+2+a+1c+1≤a+c, which reduces to a+c+4≤a2c+ac2+a2+3ac. From (a−1)(c−1)≥0 and a2c+ac2+a2+2ac≥5 the conclusion follows, with equality if a=c=1, and b=d=2.
Second solution. We show that
b+ca+b≤2⋅b+2a+c≤2⋅b+da+candd+ac+d≤2⋅b+da+c,
inequalities which give the conclusion. The second inequality can be obtained from the first one by swapping a with c and b with d, therefore it is sufficient to prove the first one. This inequality reduces to b2+ab+2b+2a≤2c2+2ac+2bc+2ab. But 2a≤2ac, 2b≤2bc and b2≤b+2≤ab+2c2, the inequality b2≤b+2 being equivalent to (b+1)(b−2)≤0. We obtain the equality case a=1,b=2,c=1 and d=2.
Third solution. As 0<b+d≤4, it is sufficient to prove that the left hand side is at most a+c. Without loss of generality, we may assume that a≤c. In this case,
b+ca+b+d+ac+d≤1+(1+d+ac−a)≤2+c−a≤c+a,
with equality if a=1,b=2,c=1 and d=2.