A validation and verification tool for global optimization solvers
From MaRDI portal
Publication:3598649
DOI10.1080/02522667.2008.10699791zbMath1178.90276OpenAlexW1998929942MaRDI QIDQ3598649
Publication date: 3 February 2009
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02522667.2008.10699791
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- An algorithm for enumerating all vertices of a convex polyhedron
- A practical anti-cycling procedure for linearly constrained optimization
- Affine geometric method for linear programs
- Fuel economy and motor vehicle emissions
- Enumerating extreme points of a highly degenerate polytope
- Combinatorial face enumeration in convex polytopes
- How good are convex hull algorithms?
- Formulation assistance for global optimization problems
- A variant of the Topkis-Veinott method for solving inequality constrained optimization problems
- A mathematical programming approach to clusterwise regression model and its extensions
- New LP bound in multivariate Lipschitz optimization: Theory and applications
- Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- An algorithm for determining all extreme points of a convex polytope
- Lectures on Polytopes
- Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach
- Principles of Optimal Design
- Constraint exploration method for quadratic programming problem.
This page was built for publication: A validation and verification tool for global optimization solvers
