This is a preview. Log in through your library . Abstract We use the models of cognitive psychology and the early literature on linear programming models to understand how experts organize their ...

It is shown that the integer linear programming problem with a fixed number of variables is polynomially solvable. The proof depends on methods from geometry of numbers. Journal Information ...

Studies linear and nonlinear programming, the simplex method, duality, sensitivity, transportation and network flow problems, some constrained and unconstrained optimization theory, and the ...