Back to search
A duality theorem for non-linear programming
Data up to Jan 2025
Published1961
Citations566
References9
Total Citations Per Year
Abstract
References (9)
The Cutting-Plane Method for Solving Convex Programs
1960 • 1,530 citations
Nonlinear Programming
1951 • 1,127 citations
The Simplex Method for Quadratic Programming
1960 • 518 citations
The Simplex Method for Quadratic Programming
1959 • 502 citations
Duality in quadratic programming
1960 • 255 citations
Mathematical Programming and Electrical Networks
1960 • 153 citations
A Duality Theorem for Convex Programs
1960 • 59 citations
Mathematical Programming and Electrical Networks
1960 • 58 citations
4. Theory of Linear Programming
1957 • 49 citations
Cited By (0)
Loading...