Hi Datamiser, my apologies for not being clear, thank you for your time. I am talking about a linear programming problem, with linear constraints.

For example, find the maximum of Z = x1+x2+x3 for which the following constaints are satisfied: 3x1+4x2+x3 <= 20, x1+x2 <= 6, x1-x3 <= 2, x1 x2 x3 integers. (Random examples, probably give a poor solution). When solving this normally, it's possible to get the optimal solution whereby x1 and/or x2 and/or x3 are not integers. I am trying to find the best solution available where they are all integers. For example, this is a production problem and you can't make/sell half a chair. I am trying to write a VBA code with say ten macros going through this process. Excel is able to do this using the solver command but we have to write our own solver.

Thank you dglienna, I will definitely look into that, it should help a lot with my learning!

I thought that perhaps this was a common VBA exercise but I think now that it is rather specific to linear programming courses only. I will keep trying things out and hopefully one day reach the solution. Thank you for your time and advice and apologies for asking a poor question.

Best wishes.