Skip to main content
SpringerLink
Log in

En hommage à Joseph-Louis Lagrange et à Pierre Huard

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  • Ahn, S. (1996). On Solving Some Optimization Problems in Stochastic and Integer Programming with Applications in Finance and Banking. Ph.D. dissertation, University of Pennsylvania, OPIM Department.

  • Ahn, S., L. Contesse, and M. Guignard. (latest revision March 2006). “A Proximal Augmented Lagrangean Relaxation for Linear and Nonlinear Integer Programming.” OPIM Department Report, University of Pennsylvania.

  • Andalaft, N., P. Andalaft, M. Guignard, A. Magendzo, A. Wainer, and A. Weintraub. (2003). “A Problem of Forest Harvesting and Road Building.” Operations Research, 51(4), 613–628.

    Article  Google Scholar 

  • Balakrishnan, A., T.L. Magnanti, and Richard T. Wong. (1989). “A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design.” Operations Research, 37, 716–740.

    Google Scholar 

  • Bilde, O. and J. Krarup. (1977). “Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem.” Annals of Discrete Mathematics, 1, 79–97.

    Google Scholar 

  • Bowman Edward H. (1956). “Production Scheduling by the Transportation Method of Linear Programming.” Operations Research, 4(1), 100–103.

    Google Scholar 

  • Boyd, S. and L. El Ghaoui. (1993). “Method of Centers for Minimizing Generalized Eigenvalues.” Linear Algebra and Applications, Special Issue on Systems & Control, 188, 63–111,

    Article  Google Scholar 

  • Broise, P., P. Huard, and J. Sentenac. (1968). Decomposition Des Programmes Mathematiques. Monographies de Recherche Opérationnelle, Dunod, Paris.

  • Caron, R.J., H.J. Greenberg, and A.G. Holder. (2002). “Analytic Centers and Repelling Inequalities.” European Journal of Operational Research, 144, 268—290.

    Article  Google Scholar 

  • Chajakis E. and M. Guignard. (1994). “The Setup Knapsack Problem.” In S. Martello (Ed.), INFOR, Special Issue on Knapsack Problems, 124–142.

  • Chajakis E. and M. Guignard. (2003). “Scheduling Deliveries for Vehicles with Multiple Compartments.” Journal of Global Optimization, special issue on Supply Chain Optimization, 26(1), 43–78.

    Article  Google Scholar 

  • Chen, B. and M. Guignard. (1998). “Polyhedral Analysis and Decompositions for Capacitated Plant Location-Type Problems.” Discrete Applied Mathematics, 82, 79–91.

    Article  Google Scholar 

  • Cosnard M., Y. Robert, and D. Trystram. (1986). “Résolution Parallèle De Systèmes Linéaires Denses Par Diagonalisation.” E.D.F. Bulletin de la Direction des Etudes et des Recherches C(2), 67–87.

    Google Scholar 

  • Dekker T.J. and W. Hoffmann. (1989). “Rehabilitation of the Gauss-Jordan Algorithm.” Nümerische Mathematik, 54, 591–599.

    Article  Google Scholar 

  • Dekker T.J., W. Hoffmann, and K. Potma. (1994). “Parallel Algorithms for Solving Large Linear Systems.” Journal of Computational and Applied Mathematics, 50, 221–232.

    Article  Google Scholar 

  • Dekker T.J., W. Hoffmann, and K. Potma. (1997). “Stability of the Gauss-Huard Algorithm with Partial Pivoting.” Computing, 58(3), 225–244.

    Google Scholar 

  • de Matta, R. (1989). On Solving Production Scheduling Problems with Changeover Cost Using Lagrangean Relaxation. Ph.D. dissertation, Dept. of Decision Sciences, the University of Pennsylvania.

  • de Matta, R. and M. Guignard. (1994). Dynamic Production Scheduling for A Process Industry. Operations Research, 42(3), 1–12.

    Google Scholar 

  • Denel, J., J.-C. Fiorot, and P. Huard. (1979). “Maximisation D’une Fonction Concave Linéaire Par Morceaux, Cas Sans Et Avec Contraintes, Méthode Finie De La Plus Forte Pente.” Research Report ANO-004, Université des sciences et technologies de Lille (Lille-1).

  • Denel, J., J.-C. Fiorot, and P. Huard. (1981). “The Steepest Ascent Method for the Linear Programming Problem.” RAIRO Analyse Numerique, 15(3), 195–200.

    Google Scholar 

  • Dietrich, B.L. and L.F. Escudero. (1993). “On modelling the Maximum Workload Allocation for Parallel Unrelated Machines with Setups.” Annals of Operations Research, 43(1–4), 359–77.

    Google Scholar 

  • Dodu, J.-C. and P. Huard. (1988). “Algorithme à pénalisation simple : méthode quadratique séquentielle non réalisable à convergence globale.” Rapport de recherche/INRIA, RR 0925, 0249–6399.

  • Dodu, J.-C. and P. Huard. (1990). “Méthodes de Quasi-Newton en Optimisation Non Linaire.” EDF, HR.30–2245. 96 pages.

  • Dodu, J.-C. and P. Huard. (1993). Quasi-Newton Methods in Nonlinear Optimization. Research Report 93NJ00024, EDF, Direction des études et de la recherche (Clamart).

  • Erlenkotter, D.E. (1978). “A Dual-Based Procedure for Uncapacitated Facility Location.” Operations Research, 26, 992–1009.

    Google Scholar 

  • Escudero, L.F., M. Guignard, and K. Malik. (1994). “A Langrangian Relax-and-Cut Approach for the Sequential Ordering Problem with Precedence Relationships.” In C. Ribeiro (Ed.) Annals of Operations Research 50, Applications of Combinatorial Optimization, pp. 219–237.

  • Fiorot, J.-C. and P. Huard. (1974). “Une approche théorique du problème de linéarisation en programmation mathématique convexe.” Research Report P-042, Université des sciences et technologies de Lille (Lille-1).

  • Fiorot, J.-C. and P. Huard. (1979). “Composition and Union of General Algorithms of Optimization.” Mathematical Programming Study, 10, 69–85.

    Google Scholar 

  • Fisher, M.L. (1981). “The Lagrangian Relaxation Method for Solving Integer Programming Problems.” Management Science, 27 (1), 1–18.

    Google Scholar 

  • Fisher, M.L., R. Jaikumar, L.N. van Wassenhove. (1986). “A Multiplier Adjustment Method for the Generalized Assignment Problem.” Management Science, 32, 1095–1103.

    Google Scholar 

  • Flegel, M.L. and C. Kanzow. (2005). “On the Guignard Constraint Qualification for Mathematical Programs with Equilibrium Constraints, “ Optimization, 54, 517–534.

    Article  Google Scholar 

  • Fréville A. and M. Guignard. (1994). “Relaxations for Minimax Problems.” Investigacion Operativa, 119–138.

  • Geoffrion, A.M. (1971). “Duality in Nonlinear Programming.” SIAM Review, 13(1), 1–37.

    Article  Google Scholar 

  • Geoffrion, A.M. (1974). “Lagrangean Relaxation and its uses in Integer Programming.” Mathematical Programming Study, 2, 82–114.

    Google Scholar 

  • Geoffrion, A.M. and R. McBride. (1978). “Lagrangean Relaxation Applied to Capacitated Facility Location Problems.” AIIE Transactions, 10(1), 40–47.

    Google Scholar 

  • Glover, F. and D. Klingman. (1988). “Layering Strategies for Creating Exploitable Structure in Linear and Integer Programs.” Mathematical Programming 40, 165–181.

    Article  Google Scholar 

  • Gondzio, J., R. Sarkissian and J.-P. Vial. (2001). “Parallel Implementation of a Central Decomposition Method for Solving Large Scale Planning Problems.” Computational Optimization and Applications 19, 5–29.

    Article  Google Scholar 

  • Gould, F.J. and J.W. Tolle. (1971). “A Necessary and Sufficient Qualification for Constrained Optimization.” SIAM J. Appl. Math., 20, 164–172.

    Article  Google Scholar 

  • Guignard, M. (1969). “Generalized Kuhn-Tucker Conditions for Mathematical Programming Problems in a Banach Space.” SIAM. J. Control, 7(2), 232–241.

    Article  Google Scholar 

  • Guignard, M. (1970). “Conditions d’optimalité et Dualité en programmation mathématique.” Cahiers du Bureau Universitaire de Recherche Opérationnelle, Institut de Statistique de l’Université de Paris, Série Recherche, Cahier n. 14, 62 pages.

  • Guignard, M. (1971). “Une condition d’optimalité en programmation en nombres entiers.” Revue Francaise d’Informatique et de Recherche Opérationelle, R2, 108–113.

    Google Scholar 

  • Guignard, M. (1988). “Décomposition Lagrangienne Et Facettes De Polytopes Entiers.” Comptes Rendus de l’Acagemie des Sciences, Paris, France, t. 307, Serie 1, 225–230.

  • Guignard, M. (1993). “Solving Makespan Minimization Problems with Lagrangean Decomposition.” Discrete Applied Mathematics, 42, 17–29.

    Article  Google Scholar 

  • Guignard, M. (1994). “Primal Relaxations for Integer Programming.” VII CLAIO (Latin-Ibero American Conference on Operations Research and Systems Engineering), Santiago, Chile, also OPIM Department Research Report 94-02-01, University of Pennsylvania.

  • Guignard, M. (1998). “Efficient Cuts in Lagrangean Relax-and-Cut Schemes.” European Journal of Operational Research, 105(1), 216–223.

    Article  Google Scholar 

  • Guignard, M. (2003). “Lagrangean Relaxation.” TOP,11(2), 151–228.

    Google Scholar 

  • Guignard, M. and S. Kim. (1986). “Décomposition lagrangienne: un modèle fournissant de meilleures bornes. ” Comptes Rendus de l’Académie des Sciences, Paris, France, t. 303, Serie 1, 667–670.

  • Guignard, M. and S. Kim. (1987). “Lagrangean Decomposition: A Model Yielding Stronger Bounds.” Mathematical Programming, 39(2), 215–228.

    Google Scholar 

  • Guignard, M. and S. Kim. (1987). “Lagrangean Decomposition for Integer Programming: Theory and Applications.” RAIRO — RO — Operations Research 21(4), 307–323.

    Google Scholar 

  • Guignard M., C. Ryu, and K. Spielberg. (1998). “Model Tightening for Integrated Timber Harvest and Transportation Planning.” European J. of Operational Research, 111, 448–460.

    Article  Google Scholar 

  • Guignard, M. and M. Rosenwein. (1989). “An Improved Dual-Based Algorithm for the Generalized Assignment Problem.” Operations Research, 37, 658–663.

    Google Scholar 

  • Guignard, M. and M. Rosenwein. (1990). “An Application of Lagrangean Decomposition to Resource-Constrained Minimum Weighted Arborescence Problem.” Networks, 20, 345–359.

    Google Scholar 

  • Guignard, M. and K. Spielberg. (1979). “A Direct Dual Method for the Mixed Plant Location Problem with Some Side Constraints.” Mathematical Programming, 17, 198–228.

    Article  Google Scholar 

  • Guignard, M. and K. Spielberg. (1981). “Logical Reduction Methods in 0–1 Programming.” Operations Research, 29(1), 49–74.

    Article  Google Scholar 

  • Gunn, E.A. and A.K. Rai. (1987). “Modeling and Decomposition for Planning Long-Term Forest Harvesting in an Integrated Industry Structure.” Can. J. For. Res. 17, 1507–1518.

    Google Scholar 

  • Held, M. and R.M. Karp. (1970). “The Traveling-Salesman Problem and Minimum Spanning Trees.” Operations Research, 18, 1138–1162.

    Google Scholar 

  • Held, M. and R.M. Karp. (1971). “The Traveling-Salesman Problem and Minimum Spanning Trees: Part II.” Mathematical Programming 1, 6–25.

    Article  Google Scholar 

  • Hoffmann, W. (1998). “The Gauss-Huard Algorithm and LU Factorization.” Linear Algebra and Its Applications, 275–276, 281–286.

  • Hoffmann, W. and G.G. Pronk. (1994). “Implementation of Gauss-Huard’s Method on the IBM 9076 SP1.” Technical Report CS-94-03, Department of Computer Systems, Faculty of Mathematics and Computer Science, University of Amsterdam.

  • Hoffmann, W., K. Potma, and G.G. Pronk. (1994). “Solving Dense Linear Systems by Gauss-Huard’s Method on a Distributed Memory System.” Future Generation Computer Systems, 10, 321–325.

    Article  Google Scholar 

  • Huard, P. (1961). “Sur l’ecriture du maître-programme dans le cas d’un programme satellite décomposé.” Technical report, Note E.D.F. HX 410/365.

  • Huard, P. (1962). “Dual Programs.” IBM J. of Res. and Dev., 137–139.

  • Huard, P. (1963a). Convex Programming—Dual Algorithm. Research Report 63—21, O.R. Center, University of California at Berkeley.

  • Huard, P. (1963b). “Application Du Principe De Décomposition Aux Programmes Mathématiques Non Linéaires.” Technical report, Note E.D.F. HR 5467.

  • Huard P. (1964a). “Mathématiques Des Programmes Economiques.” Monographies de Recherche Opérationnelle, Dunod, Paris.

  • Huard, P. (1964b). “Résolution des programmes mathématiques par la méthode des centres.” Technical report, Note E.D.F. HR 5690.

  • Huard, P. (1967). “Resolution of Mathematical Programming with Nonlinear Constraints by the Method of Centers.” In J. Abadie, (Ed.), Nonlinear Programming, North Holland, Amsterdam, pp. 207–219.

  • Huard, P. (1970). “A Method of Centers by Upper-Bounding Functions with Applications.” In J. B. Rosen, O. L. Mangasarian and K. Ritter, (Eds.) Nonlinear Programming, Proceedings of a Symposium held at the University of Wisconsin, Madison, Wisconsin, USA, May 1970, Academic Press, New York, pp. 1–30.

  • Huard, P. (1975a). “La méthode du gradient projeté dans le cas de contraintes non-linéaires.” Research Report P-058, Université des sciences et technologies de Lille (Lille-1).

  • Huard, P. (1975b). “Optimization Algorithms and Point-to-Set Maps.” Mathematical Programming, 8, 308–331.

    Article  Google Scholar 

  • Huard, P. (1976). “Implementation of Gradient Methods by Tangential Discretization.” Research Report P-073, Université des sciences et technologies de Lille (Lille-1). Appeared in 1979 in JOTA, 28(4), 483–499.

  • Huard, P. (1979a). “La methode Simplex sans inverse éxplicite.” E. D. F.—Bulletin de la D. E. R., Série C, 2, 79–98.

    Google Scholar 

  • Huard, P. (1979b). “La methode de frank ét wolfe ‘a petits pas’.” Research Report ANO-007, Université des Sciences et Technologies de Lille (Lille-1).

  • Huard, P. (1979c). “Extensions of Zangwill’s Theorem.” Mathematical Programming Study, 10, 98–103.

    Google Scholar 

  • Huard, P. (1981). “Une approche synthétique des recherches linéaires dans les méthodes de pente.” Research Report ANO-044, Université des Sciences et Technologies de Lille (Lille-1).

  • Huard, P. (1982). “Un algorithme général de gradient réduit.” Research Report ANO-066, Université des Sciences et Technologies de Lille (Lille-1).

  • Jörnsten, K.O., M. Näsberg, and P.A. Smeds. (1985). “Variable Splitting—A New Lagrangean Relaxation Approach to Some Mathematical Programming Models.” Report LiTH-MAT-R-85-04, Department of Mathematics, Linköping Institute of Technology, Sweden.

  • Karmarkar, U.S. and L. Schrage. (1985). “The Deterministic Dynamic Product Cycling Problem.” Operations Research, 33(2), 326–345.

  • Karush, W. (1939). “Minima of Functions of Several Variables with Inequalities as Side Constraints.” M.Sc. dissertation, Dept. of Mathematics, Univ. of Chicago, Chicago, Ill.

  • Kuhn, H.W. and A.W. Tucker. (1951). “Nonlinear Programming.” In J. Neyman (Ed.), Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, Univ. of California Press, Berkeley, California, pp. 481–492.

  • Laurent-Gengoux, P. and D. Trystram. (1990). “A New Presentation of the Conjugate Direction Algorithm.” Journal of Computational and Applied Mathematics, 32, 417–422.

    Article  Google Scholar 

  • Lee, H. and M. Guignard. (1996). “A Hybrid Bounding Procedure for the Workload Allocation Problem on Parallel Unrelated Machines with Setups.” J. Operational Research Society, 47, 1247–1261.

    Google Scholar 

  • Lieu, B.-T. and P. Huard. (1966). “La méthode des centres dans un espace topologique.” Nümerische Mathematik, 8, 56–57.

    Article  Google Scholar 

  • Mangasarian, O.L. (1975). “Second Order and Higher Order Duality in Nonlinear Programming.” J. Math. Anal. Appl., 51 (3), 607–620.

    Article  Google Scholar 

  • Michelon, P. (1992). Private Communication.

  • Michelon, P. and N. Maculan. (1992). “Solving the Lagrangean Dual Problem in Integer Programming.” Department d’Informatique et de Recherche Operationnelle, Université de Montréal, Publication 82.

  • Minoux, M. (1983). “Lagrangean Decomposition.” Oral communication.

  • Opaswongkarn, K. (1984). Single and Multi-Commodity Plant Location Problems. Ph.D. dissertation, Dept. of Decision Sciences, the University of Pennsylvania.

  • Potma, K. and W. Hoffmann. (1994). “Performance Evaluation of Gauss-Huard’s Method for Hierarchical Memory Systems.” Report CS-94–07, University of Amsterdam (NL). Institute for logic, language and computation.

  • Reinoso, H. and N. Maculan. (1992). “Lagrangean Decomposition in Integer Linear Programming: A New Scheme.” INFOR, 30, 1–5.

    Google Scholar 

  • Ribeiro, C. (1983). “Algorithmes de recherche de plus courts chemins avec contraintes: etude théorique, implémantation et parallélisation.” Doctoral Dissertation, Paris.

  • Ribeiro, C. and M. Minoux. (1984). “Solving Hard Constrained Shortest Paths Problems.” ORSA-TIMS Meeting, Dallas.

  • Ribeiro, C. and M. Minoux. (1986). “Solving Hard Constrained Shortest Paths Problems by Lagrangean Relaxation and Branch-and-Bound Algorithme.” Methods of Operations Research 53, 303–316.

    Google Scholar 

  • Roos, C. (2002). “Interior-Point Methods for Linear Optimization.” In P. Pardalos and M. Resende, (Eds.) Handbook of Applied Optimization, New York, USA, Oxford University Press, pp. 21–39.

  • Roos, K. (2004). “From Linear Optimization to Conic Optimization.” NMC 2004, Tilburg, April 17, 2004, and Seminar, Department of Mathematics, Universitas Padjadjaran, Bandung, Indonesia, August 21, 2004.

  • Shepardson, F. and R.E. Marsten. (1980). “A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem.” Management Science, 26(3), 274–281.

    Google Scholar 

  • Trick, M. (1987). “Networks with Additonal Structured Constraints,” Ph.D. Thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology.

  • Vajda, S. (1974). “Test of Optimality.” In P. L. Hammer and G. Zoutendijk, (Eds.) Mathematical programming in theory and practice, Proceedings of the NATO advanced study institute, Figueira da Foz, Portugal, June 12–23, 1972, North-Holland Pub. Co., Amsterdam, ISBN 044410741X.

  • Yang X.M., X.Q. Yang, and K.L. Teo. (2005). “Huard Type Second-Order Converse Duality for Nonlinear Programming.” Appl. Math. Lett. 18(2), 205–208.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. OPIM Department, The Wharton School, University of Pennsylvania, Philadelphia, PA, 19104-6340, USA

    Monique Guignard

Authors
  1. Monique Guignard
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Monique Guignard.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guignard, M. En hommage à Joseph-Louis Lagrange et à Pierre Huard. Ann Oper Res 149, 103–116 (2007). https://doi.org/10.1007/s10479-006-0111-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-006-0111-y

Keywords

Search

Navigation