• # cdd

• Referenced in 119 articles [sw00114]
• polyhedron given by a system of linear inequalities ... problem which is to obtain a linear inequality representation of a convex polyhedron given ... basic functions, cdd/cdd+ can solve the general linear programming (LP) problem to maximize (or minimize...
• # PORTA

• Referenced in 127 articles [sw04869]
• system of linear equations and inequalities. The name PORTA is an abbreviation for POlyhedron Representation ... Fourier - Motzkin elimination algorithm which projects a linear system on subspaces xi = 0. This ... projection of a given system of linear inequalities can be done separately by using...
• # CFSQP

• Referenced in 61 articles [sw04658]
• user is infeasible for some inequality constraint or some linear equality constraint, CFSQP first generates ... constraints. Nonlinear equality constraints are turned into inequality constraints (to be satisfied by all iterates ... each iteration after feasibility for nonlinear inequality and linear constraints has been reached (monotone line...
• # MINTO

• Referenced in 135 articles [sw04587]
• branch-and-bound algorithm with linear programming relaxations. It also provides automatic constraint classification, preprocessing ... inequalities perform variable fixing based on reduced prices control the size of the linear programs...
• # QSDPNAL

• Referenced in 33 articles [sw18799]
• large number of linear equality and inequality constraints, a simple convex polyhedral set constraint ... proposed algorithm and prove the R-(super)linear convergence of the KKT residual...
• # cddplus

• Referenced in 13 articles [sw04443]
• given by a system of linear inequalities: P = { x : A x <= b } where ... move back and forth between an inequality representation and a generator (i.e. vertex ... with cdd+. Also, cdd+ can solve a linear programming problem, i.e. a problem of maximizing...