The following pages link to (Q3929386):
Displaying 19 items.
- Local tests for consistency of support hyperplane data. (Q960495) (← links)
- General criteria for redundant and nonredundant linear inequalities (Q1076606) (← links)
- A new family of exponential LP problems (Q1097169) (← links)
- Testing the definiteness of matrices on polyhedral cones (Q1104045) (← links)
- On linear inequality systems without strongly redundant constraints (Q1130083) (← links)
- On relaxation methods for systems of linear inequalities (Q1159953) (← links)
- Dynamic versions of set covering type public facility location problems (Q1167656) (← links)
- Weakly redundant constraints and their impact on postoptimal analyses in LP (Q1199513) (← links)
- A computational study of redundancy in randomly generated polytopes (Q1207047) (← links)
- A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs (Q1266607) (← links)
- Standard forms for rational linear arithmetic in constraint logic programming. (Q1354046) (← links)
- Redundancy elimination with a lexicographic solved form (Q1380440) (← links)
- The isometries and the \(G\)-invariance of certain seminorms. (Q1414151) (← links)
- Analysis of structure in fuzzy linear programs (Q1814624) (← links)
- A pathological case in the reduction of linear programs (Q1837107) (← links)
- Analytic centers and repelling inequalities (Q1848382) (← links)
- Redundancy in linear inequality system (Q4210734) (← links)
- Generalized theorems for permanent basic and nonbasic variables (Q5187070) (← links)
- The complexity of linear programming (Q5904897) (← links)
