On the Development of Optimization Theory

DOI10.2307/2321417zbMath0452.01007OpenAlexW4251167060MaRDI QIDQ3898452

Prékopa, András

Publication date: 1980

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.5193

zbMATH Keywords

equality constraintsinequality constraintsFourierlinear inequalitiesLagrangeanalytical mechanicsGaussJohnKuhnTuckerHamelOstrogradskyFarkashistory of optimizationKarush

Mathematics Subject Classification ID

Nonlinear programming (90C30) Linear programming (90C05) History of operations research and mathematical programming (90-03) History of mathematics in the 19th century (01A55) History of mechanics of particles and systems (70-03)

Related Items

MULTISYMPLECTIC VARIATIONAL INTEGRATORS FOR NONSMOOTH LAGRANGIAN CONTINUUM MECHANICS ⋮ Results of farkas type ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Unnamed Item ⋮ New perspective on the Kuhn-Tucker theorem ⋮ A new proof of the Kuhn-Tucker and Farkas theorems ⋮ A contextualized historical analysis of the Kuhn-Tucker theorem in nonlinear programming: The impact of World War II ⋮ A simple algebraic proof of Farkas's lemma and related theorems ⋮ Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems ⋮ A simple and elementary proof of the Karush-Kuhn-Tucker theorem for inequality-constrained optimization ⋮ Elementary proof of classical necessary optimality conditions for a mathematical programming problem with inequality constraints ⋮ Comment on the theorems of Farkas and Haar ⋮ Pivot versus interior point methods: Pros and cons ⋮ Farkas' Lemma, other theorems of the alternative, and linear programming in infinite-dimensional spaces: a purely linear-algebraic approach

This page was built for publication: On the Development of Optimization Theory