The hyperbolic (or fractional) linear programming problem with only one aggregate constraint is solved by a simple and extremely efficient algorithm. The core step in the iterative procedure is the ...

This paper presents a constraint logic programming model for the traveling salesman problem with time windows which yields an exact branch-and-bound optimization algorithm without any restrictive ...

Example 8.10: Quadratic Programming The quadratic program can be solved by solving an equivalent linear complementarity problem when H is positive semidefinite. The approach is outlined in the ...

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, each with a new objective function. These objective ...