Diet models based on goal programming (GP) are valuable tools in designing diets that comply with nutritional, palatability and cost constraints. Results derived from GP models are usually very ...

In the linear programming approach to approximate dynamic programming, one tries to solve a certain linear program-the ALP-that has a relatively small number K of variables but an intractable number M ...

Using convex analysis and a characterization of the entire family of optimal solutions to an L.P., we show that in order to obtain shadow prices, one has to solve a much smaller L.P. derived from any ...