Items related to Colourful Linear Programming Feasibility Problem: Algorithms
Synopsis
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.
"synopsis" may belong to another edition of this title.
About the Author
Guohong has more than ten years experience as a software developer especially in network security and embedded system. He obtained his Master of Science in Computer Science from McMaster University in 2012.
"About this title" may belong to another edition of this title.
- PublisherLAP LAMBERT Academic Publishing
- Publication date2012
- ISBN 10 365928677X
- ISBN 13 9783659286773
- BindingPaperback
- LanguageEnglish
- Number of pages80
Buy New
View this item
US$ 56.83
Shipping:
US$ 25.90
From Germany to U.S.A.
Search results for Colourful Linear Programming Feasibility Problem: Algorithms
Seller Image
Colourful Linear Programming Feasibility Problem
Published by
LAP LAMBERT Academic Publishing Nov 2012, 2012
ISBN 10: 365928677X
ISBN 13: 9783659286773
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 80 pp. Englisch. Seller Inventory # 9783659286773
Quantity: 2 available
Seller Image
Colourful Linear Programming Feasibility Problem : Algorithms
Published by
LAP LAMBERT Academic Publishing, 2012
ISBN 10: 365928677X
ISBN 13: 9783659286773
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Seller Inventory # 9783659286773
Quantity: 1 available
Seller Image
Colourful Linear Programming Feasibility Problem
Published by
LAP LAMBERT Academic Publishing, 2012
ISBN 10: 365928677X
ISBN 13: 9783659286773
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Rong GuohongGuohong has more than ten years experience as a software developer especially in network security and embedded system. He obtained his Master of Science in Computer Science from McMaster University in 2012.This proble. Seller Inventory # 5145822
Quantity: Over 20 available
Stock Image
Colourful Linear Programming Feasibility Problem: Algorithms
Published by
LAP LAMBERT Academic Publishing, 2012
ISBN 10: 365928677X
ISBN 13: 9783659286773
New
paperback
Seller: dsmbooks, Liverpool, United Kingdom
Seller rating 4 out of 5 stars
paperback. Condition: New. New. book. Seller Inventory # D8S0-3-M-365928677X-6
Quantity: 1 available