Lagrangian Duality
Lagrangian Duality is a theoretical framework in convex analysis and unconstrained optimization that associates a primal optimization problem with a dual problem by introducing Lagrange multipliers to incorporate constraints into the objective function, thereby enabling the derivation of lower bounds on the optimal value and establishing duality relations through the Lagrangian function.
1.3K
Publications
77.6K
Citations
2K
Authors
861
Institutions
Publications per year
2017–2026
205
1.3K
Branch-and-Price: Column Generation for Solving Huge Integer Programs
Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser et al. · Operations Research · 1998 · 2.2K citations
1–5 of 1.3K
2K
15
h-index
15
h-index
12
h-index
12
h-index
11
h-index
1–5 of 2K
861
Georgia Institute of Technology
Atlanta, United States
23 h-index
49 publications
13.6K citations
Massachusetts Institute of Technology
Cambridge, United States
20 h-index
31 publications
4.1K citations

Hong Kong Polytechnic University
Hong Kong, Hong Kong
17 h-index
36 publications
1.2K citations

UNSW Sydney
Sydney, Australia
17 h-index
25 publications
767 citations

University of Toronto
Toronto, Canada
15 h-index
32 publications
5.2K citations

University of Delhi
New Delhi, India
14 h-index
32 publications
870 citations
Princeton University
Princeton, United States
14 h-index
15 publications
3.4K citations
Stanford University
Stanford, United States
14 h-index
23 publications
1.5K citations
1–8 of 861
97 publications · 7.3K citations
43
h-index
120 publications · 4.6K citations
40
h-index
47 publications · 3.2K citations
33
h-index
64 publications · 2.7K citations
30
h-index
50 publications · 1.3K citations
24
h-index
1–5