A validation and verification tool for global optimization solvers
From MaRDI portal
Recommendations
Cites work
- A mathematical programming approach to clusterwise regression model and its extensions
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- A practical anti-cycling procedure for linearly constrained optimization
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- A variant of the Topkis-Veinott method for solving inequality constrained optimization problems
- Affine geometric method for linear programs
- An algorithm for determining all extreme points of a convex polytope
- An algorithm for enumerating all vertices of a convex polyhedron
- Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
- Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach
- Combinatorial face enumeration in convex polytopes
- Constraint exploration method for quadratic programming problem.
- Enumerating extreme points of a highly degenerate polytope
- Formulation assistance for global optimization problems
- Fuel economy and motor vehicle emissions
- How good are convex hull algorithms?
- scientific article; zbMATH DE number 3918320 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- Lectures on Polytopes
- New LP bound in multivariate Lipschitz optimization: Theory and applications
- Principles of Optimal Design
Cited in
(3)
This page was built for publication: A validation and verification tool for global optimization solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3598649)
