A gentle introduction to optimization

MaRDI QIDQ3191865zbMATH OpenFDO

Authors Bertrand Guenin, Jochen Könemann, Levent Tunçel

Publication date 25 September 2014

zbMATH Keywords

branch and boundcomputational complexityduality theoryinteger programsinterior-point methodlinear programsnonconvex optimization problemsnonlinear optimizationoptimality conditionsoptimization problems on graphs

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Linear programming (90C05) Nonlinear programming (90C30) Programming involving graphs or networks (90C35) Operations research, economics (aspects of mathematics education) (97M40)

Recommendations

• scientific article; zbMATH DE number 2106106
• Linear and nonlinear optimization
• scientific article; zbMATH DE number 1393135
• Linear and convex optimization. A mathematical approach
• scientific article; zbMATH DE number 5359577

Cited in

(9)

• Efficient heuristic algorithms for maximum utility product pricing problems
• scientific article; zbMATH DE number 48217 (Why is no real title available?)
• scientific article; zbMATH DE number 2106106 (Why is no real title available?)
• A mathematical primer on linear optimization
• scientific article; zbMATH DE number 6316796 (Why is no real title available?)
• scientific article; zbMATH DE number 6435534 (Why is no real title available?)
• Linear optimization and duality. A modern exposition
• Vertex downgrading to minimize connectivity
• An initialization approach for metaheuristic algorithms by using Gibbs sampling

This page was built for publication: A gentle introduction to optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3191865)