On the equivalence between some discrete and continuous optimization problems

DOI10.1007/BF02283701zbMath0719.90057OpenAlexW1995043357MaRDI QIDQ2640444

Fabio Tardella

Publication date: 1990

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02283701

zbMATH Keywords

simplex algorithmdiscrete problemcontinuous optimization

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Nonconvex programming, global optimization (90C26) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Zonotopes and the LP-Newton method, Continuous quadratic programming formulations of optimization problems on graphs, New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability, The fundamental theorem of linear programming: extensions and applications, Existence and sum decomposition of vertex polyhedral convex envelopes, The use of edge-directions and linear programming to enumerate vertices, A clique algorithm for standard quadratic programming, Optimality conditions for maximizing a function over a polyhedron, Reductions of Approximate Linear Programs for Network Revenue Management, Edge-directions of standard polyhedra with applications to network flows

Cites Work

• Unnamed Item
• Active constraints, indefinite quadratic test problems, and complexity
• The ellipsoid method and its consequences in combinatorial optimization
• Methods for Global Concave Minimization: A Bibliographic Survey
• Methods of Nonlinear 0-1 Programming
• Minimizing a Submodular Function on a Lattice
• Convex Analysis
• A Review of Quasi-Convex Functions