The purpose of this code was just to calculate field patterns. The units were all arbitrary. One can always normalize and scale to desired units. This code implements Biot Savart's law without giving importance to units of physical quantities which can be anything.

Hi Scott Richardson,
An objective of standard linear program problem is to maximize or minimize a vector c'x, subjected to the condition L<Ax<H. In this problem, we are trying to minimize the cost and lower bound L and upper bound H are given by lower and upper bounds on nutrients. So the condition matrix A should be the A_new matrix you are asking about. I have referred this textbook and I would suggest you also ,if you are interested more on Diet problem. Text: Linear Programming by Robert Vanderbei. Thanks

The purpose of this code was just to calculate field patterns. The units were all arbitrary. One can always normalize and scale to desired units. This code implements Biot Savart's law without giving importance to units of physical quantities which can be anything.