Pages that link to "Item:Q4159164"
From MaRDI portal
The following pages link to An algorithm for determining all extreme points of a convex polytope (Q4159164):
Displaying 37 items.
- On the calculation of a membership function for the solution of a fuzzy linear optimization problem (Q423156) (← links)
- On the use of cuts in reverse convex programs (Q913668) (← links)
- On degeneracy in enumeration (Q1053414) (← links)
- Pivoting rules and redundancy schemes in extreme point enumeration (Q1063390) (← links)
- Evolution, games theory and polyhedra (Q1096563) (← links)
- Enumerative techniques for solving some nonconvex global optimization problems (Q1102205) (← links)
- Linear programs with an additional reverse convex constraint (Q1140531) (← links)
- An improved vertex enumeration algorithm (Q1160560) (← links)
- On the duality of a non-convex optimization problem and the strong unicity constant in linear Chebyshev approximation (Q1192138) (← links)
- A new pivoting rule for solving various degeneracy problems (Q1198621) (← links)
- Selected bibliography on degeneracy (Q1312748) (← links)
- Degeneracy graphs: Theory and applications. An updated survey (Q1312751) (← links)
- An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex (Q1312773) (← links)
- Efficient enumeration of the vertices of polyhedra associated with network LP's (Q1315430) (← links)
- Enumerating extreme points of a highly degenerate polytope (Q1318458) (← links)
- Practical issues on the projection of polyhedral sets (Q1356171) (← links)
- Restricting weights in value efficiency analysis. (Q1584828) (← links)
- Errors bounds for finite approximations of coherent lower previsions on finite probability spaces (Q1726342) (← links)
- Linearly constrained global optimization: a general solution algorithm with applications. (Q1855939) (← links)
- Segments in enumerating faces (Q1904658) (← links)
- Directional differentiability of optimal solutions under Slater's condition (Q2366608) (← links)
- Sufficient optimality criterion for linearly constrained, separable concave minimization problems (Q2569195) (← links)
- Linear optimization with fuzzy variable over fuzzy polytope (Q2953524) (← links)
- An Interactive Polyhedral Approach for Multi-objective Combinatorial Optimization with Incomplete Preference Information (Q3297811) (← links)
- A common formula to compute the efficient sets of a class of multiple objective linear programming problems (Q3454856) (← links)
- A validation and verification tool for global optimization solvers (Q3598649) (← links)
- A simple algorithm for the-linear bilevel programming problem (Q3773715) (← links)
- Extreme point Quadratic Minimization Problem (Q4272558) (← links)
- A Calculation of all Separating Hyperplanes of two Convex Polytopes (Q4342958) (← links)
- On a calculation of an arbitrary separating hyperplane of convex polyhedral sets (Q4397408) (← links)
- Separating support hyperplanes for a pair of convex polyhedral sets (Q4397409) (← links)
- The generalized jacobian of the optimal solution in parametric optimization (Q4531540) (← links)
- Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints (Q5039515) (← links)
- Fourier algorithm revisited (Q5096191) (← links)
- Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices (Q5116482) (← links)
- Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices (Q5220475) (← links)
- Generating all vertices of a polyhedron is hard (Q5920505) (← links)