Call Us 080-41656200 (Mon-Sat: 10AM-8PM)
Free Shipping above Rs. 1499
Cash On Delivery*

Colourful Linear Programming Feasibility Problem


Marketed By :  LAP LAMBERT Academic Publishing   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days


Check Your Delivery Options

Rs. 3,651

Availability: In stock

  • Product Description

This problem was presented by Barany and Onn in 1997 and it is still not known if a polynomial-time algorithm for the problem exists. The monochrome version of this problem, expressing p as a convex combination of points in a set S, is a traditional linear programming feasibility problem. The colourful Caratheodory Theorem, due to Barany in 1982, provides a sufficient condition for the existence of a colourful set of points containing p in its convex hull. Barany's result was generalized by Holmsen et al. in 2008 and by Arocha et al. in 2009 before being recently further generalized by Meunier and Deza. We study algorithms for colourful linear programming under the conditions of Barany and their generalizations. In particular, we implement the Meunier-Deza algorithm and enhance previously used random case generators. Computational benchmarking and a performance analysis including a comparison between the two algorithms of Barany and Onn and the one of Meunier and Deza, and random picking are presented.

Product Specifications
SKU :COC17993
AuthorAlexandre Lopes,João Moreira and Joao Gama
Number of Pages84
Publishing Year11/16/2012
Edition1 st
Book TypeComputer networking & communications
Country of ManufactureIndia
Product BrandLAP LAMBERT Academic Publishing
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-07-27 00:00:00