Skip to main content

iB4e: A Software Framework for Parametrizing Specialized LP Problems

  • Conference paper
Mathematical Software - ICMS 2006 (ICMS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4151))

Included in the following conference series:

Abstract

Given a polytope P, the classical linear programming (LP) problem asks us to find a point in P which attains maximal inner product with a given real objective vector c. When the objective is a vector of unknown parameters, the LP problem amounts to computing certain information about the polytope P, such as its vertices and normal fan.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Similar content being viewed by others

References

  1. Preparata, F., Shamos, M.I.: Computational Geometry: An Introduction. Texts and Monographs in Computer Science. Springer, New York (1985)

    Google Scholar 

  2. Fukuda, K., Weibel, C.: Computing All Faces of the Minkowski Sum of V-Polytopes. In: Proceedings of the 17th Canadian Conference on Computational Geometry (2005)

    Google Scholar 

  3. Gritzmann, P., Sturmfels, B.: Minkowski addition of polytopes: computational complexity and applications to Gröbner Bases. SIAM J. Disc. Math. 6, 246–269 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dewey, C., Huggins, P., Woods, K., Sturmfels, B., Pachter, L.: Parametric alignment of Drosophila genomes. In: PLoS Computational Biology (to appear, 2006)

    Google Scholar 

  5. Pachter, L., Sturmfels, B.: Parametric inference for biological sequence analysis. Proceedings of the National Academy of Sciences, USA 101(46), 16138–16143 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  6. Needleman, S.B., Wunsch, C.D.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology 48, 443–445 (1970)

    Article  Google Scholar 

  7. Gawrilow, E., Joswig, M.: Polymake: A framework for analyzing convex polytopes. In: Kalai, G., Ziegler, G.M. (eds.) Polytopes—Combinatorics and Computation, pp. 43–74, Birkhäuser (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huggins, P. (2006). iB4e: A Software Framework for Parametrizing Specialized LP Problems. In: Iglesias, A., Takayama, N. (eds) Mathematical Software - ICMS 2006. ICMS 2006. Lecture Notes in Computer Science, vol 4151. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11832225_24

Download citation

  • DOI: https://doi.org/10.1007/11832225_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-38084-9

  • Online ISBN: 978-3-540-38086-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics