Research Areas
Integer programming (esp. Lagrangean relaxation and decomposition, pre-processing techniques, dual ascent methods); duality; graph theory; knapsack problems; location problems; mathematical programming; network flows; nonlinear programming; optimality conditions; production scheduling
Current Projects
"Relax-and-Cut", a technique for strengthening Lagrangean relaxations in integer programming. Theoretical study of cuts, design of algorithms, applications. Management of natural resources, especially timber. Combining cutting and road building decisions. Modeling issues. Optimization methods.
Representative Publications
"Generalized Kuhn-Tucker Conditions for Mathematical Programming Problems in a Banach Space." Society for Industrial and Applied Mathematics 7.2 (1969).
(with K. Spielberg)
"Logical Reduction Methods in 0-1 Programming." Operations Research Society of America 29.1 (1981).
(with S. Kim)
"Lagrangean Decomposition: A Model Yielding Stronger Bounds." Mathematical Programming 39.2 (1987).
Education
Doctorat es-Sciences Mathematiques, Universite des Sciences et Techniques de Lille, 1980; Doctorat de Specialite, Universite des Sciences et Techniques de Lille, 1967; Diplome D'Etudes Approfondies, Universite des Sciences et Techniques de Lille, 1965
Academic Positions Held
Wharton: 1972-present. Previous appointments: Universite des Sciences et Techniques de Lille; Institut Industriel du Nord, France; Ecole Nationale Superieure de la Statistique et de l'Administration Economique, Paris
Professional Leadership 2005-2009
Associate Editor, Computational Optimization and Applications, 1991-present
