DUALITY IN DISCRETE PROGRAMMING: IV. APPLICATIONS.
CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP
Pagination or Media Count:
The paper develops a method for solving integer and mixed-integer nonlinear programs whose objective and constraint-functions are differentiable and concave convex on the set of nonnegative variables i.e. on the domain obtained by disregarding the integrity conditions. Author
- Operations Research