The colourful feasibility problem

DOI10.1016/j.dam.2008.01.016zbMath1151.90487arXivmath/0511749OpenAlexW2015695027MaRDI QIDQ944700

Sui Huang, Tamás Terlaky, Antoine Deza, Tamon Stephen

Publication date: 10 September 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0511749

zbMATH Keywords

colourful feasibility problemcolourful linear programming

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)

Related Items

Examples with decreasing largest inscribed ball for deterministic rescaling algorithms, Computing colourful simplicial depth and Median in \(\mathbb{R}_2\), A note on lower bounds for colourful simplicial depth, Algorithms for Colourful Simplicial Depth and Medians in the Plane, The intersection of a matroid and an oriented matroid, Colorful linear programming, Nash equilibrium, and pivots, The colourful feasibility problem, A quadratic lower bound for colourful simplicial depth

Uses Software

• CLP

Cites Work

• Unnamed Item
• Unnamed Item
• The colourful feasibility problem
• A quadratic lower bound for colourful simplicial depth
• A generalization of Caratheodory's theorem
• Colourful simplicial depth
• Finding the nearest point in A polytope
• Colourful Linear Programming and its Relatives
• Quadratically Many Colorful Simplices
• A continuous analogue of the upper bound theorem