How to find the minimum value of $ax+by+cz$ given $x,y,z$ are non negative integers that satisfy $x+2y+3z=d$?

1.4k Views Asked by At

how to find the minimum value of the given expression $ax+by+cz$ if the constraints are $x,y,z$ are non negative integers that satisfy $x+2y+3z=d$, where $a,b,c,d$ all are positive integers and known beforehand. Or if I substitute one variable from the equation the question can be also asked as How to find minimum non negative value of $Ax+By+C$ given that $x,y$ are non negative integers and A,B are integers?