626 Integer Programming
10.18 C. A. Trauth, Jr., and R. E. Woolsey, Integer linear programming: a study in computa-
tional efficiency,Management Science, Vol. 15, No. 9, pp. 481–493, 1969.
10.19 E. L. Lawler and M. D. Bell, A method for solving discrete optimization problems,
Operations Research, Vol. 14, pp. 1098–1112, 1966.
10.20 P. Hansen, Quadratic zero–one programming by implicit enumeration, pp. 265–278 in
Numerical Methods for Nonlinear Optimization, F. A. Lootsma, Ed., Academic Press,
London, 1972.
10.21 R. R. Meyer, Integer and mixed-integer programming models: general properties,Jour-
nal of Optimization Theory and Applications, Vol. 16, pp. 191–206, 1975.
10.22 R. Karni, Integer linear programming formulation of the material requirements planning
problem,Journal of Optimization Theory and Applications, Vol. 35, pp. 217–230, 1981.
10.23 R. J. Dakin, A tree-search algorithm for mixed integer programming problems,Computer
Journal, Vol. 8, No. 3, pp. 250–255, 1965.
10.24 D. K. Shin, Z. Gurdal, and O. H. Griffin, Jr., A penalty approach for nonlinear opti- ̈
mization with discrete design variables,Engineering Optimization, Vol. 16, pp. 29–42,
1990.
10.25 O. K. Gupta and A. Ravindran, Nonlinear mixed integer programming and discrete
optimization, pp. 27–32 inProgress in Engineering Optimization—1981, R. W. Mayne
and K. M. Ragsdell, Eds., ASME, New York, 1981.
10.26 G. R. Olsen and G. N. Vanderplaats, Method for nonlinear optimization with discrete
variables,AIAA Journal, Vol. 27, No. 11, pp. 1584–1589, 1989.
10.27 K. V. John, C. V. Ramakrishnan, and K. G. Sharma, Optimum design of trusses from
available sections: use of sequential linear programming with branch and bound algo-
rithm,Engineering Optimization, Vol. 13, pp. 119–145, 1988.
10.28 M. W. Cooper, A survey of methods for pure nonlinear integer programming,Manage-
ment Science, Vol. 27, No. 3, pp. 353–361, 1981.
10.29 A. Glankwahmdee, J. S. Liebman, and G. L. Hogg, Unconstrained discrete nonlinear
programming,Engineering Optimization, Vol. 4, pp. 95–107, 1979.
10.30 K. Hager and R. Balling, New approach for discrete structural optimization,ASCE
Journal of the Structural Division, Vol. 114, No. ST5, pp. 1120–1134, 1988.
10.31 S. S. Rao, T. S. Pan, and V. B. Venkayya, Optimal placement of actuators in
actively controlled structures using genetic algorithms,AIAA Journal, Vol. 29, No. 6,
pp. 942–943, 1991.
10.32 R. G. Parker and R. L. Rardin,Discrete Optimization, Academic Press, Boston, 1988.Review Questions
10.1 Answer true or false:
(a)The integer and discrete programming problems are one and the same.
(b)Gomory’s cutting plane method is applicable to mixed-integer programming
problems.
(c)The Balas method was developed for the solution of all-integer programming
problems.
(d)The branch-and-bound method can be used to solve zero–one programming
problems.
(e)The branch-and-bound method is applicable to nonlinear integer programming
problems.