How to minimize $|Ax+By + C|$ given that $x \geq 0$ and $y\geq 0$

Question

I am trying to solve problem related to absolute value function, i.e given $Z(x,y) = |Ax + By + C|$ , what is the minimum value of $Z$, if $x \geq 0$ and $y\geq 0$ and x,y belongs to integers

This is at least the third time I see this question in the last few hours. — Servaes, Jun 04 '16 at 21:24

score 3 · Answer 1 · answered Jun 04 '16 at 21:04

3

The absolute value is always $\ge0$.
In this case, if there is no restriction on the value of A, B, or C, then $x=y=0$ and $C=0$ will make $Z=0$, which is the smallest you can get for an absolute value.

answered Jun 04 '16 at 21:04

Serina

201

We have to minimize over integral values – Srivatsa Sinha Jun 04 '16 at 21:18

How to minimize $|Ax+By + C|$ given that $x \geq 0$ and $y\geq 0$

1 Answers1