Linear programming is a powerful technique for finding the optimal solution to a problem that involves maximizing or minimizing a linear objective function subject to a set of linear constraints.

Example 3.7: Goal-Programming a Product Mix Problem. This example shows how to use PROC LP to solve a linear goal-programming problem. PROC LP has the ability to solve a series of linear programs, ...

Example 3.12: An Assignment Problem. This example departs somewhat from the emphasis of previous ones. Typically, linear programming models are large, have considerable structure, and are solved with ...

This paper aims to investigate the capability of mixed-integer linear programming (MILP) method and genetic algorithm (GA) to solve binary problem (BP). A comparative study on the MILP method and GA ...

Linear and nonlinear programming to optimize the nutrient density of a population's diet: an example based on diets of preschool children in rural Malawi. Am J Clin Nutr 2002; 75 : 245–253.