LDRD final report on massively-parallel linear programming : the parPCx system.

@inproceedings{Parekh2005LDRDFR,
  title={LDRD final report on massively-parallel linear programming : the parPCx system.},
  author={Ojas Parekh and Cynthia A. Phillips and Erik G. Boman},
  year={2005}
}
This report summarizes the research and development performed from October 2002 to September 2004 at Sandia National Laboratories under the Laboratory-Directed Research and Development (LDRD) project ''Massively-Parallel Linear Programming''. We developed a linear programming (LP) solver designed to use a large number of processors. LP is the optimization of a linear objective function subject to linear constraints. Companies and universities have expended huge efforts over decades to produce… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 43 REFERENCES

Expected losses

R. E. Carlson, M. A. Turnquist, L. K. Nozick
  • insurability, and benefi ts from reducing vulnerability to attack. Technical Report SAND2004-0742, Sandia National Laboratories
  • 2004
VIEW 1 EXCERPT

Polyhedral combinatorics

R. D. Carr, G. Konjevod
  • H.J. Greenberg, editor, Tutorials on Emerging Methodologies and Applications in Operations Research. Kluwer Academic Press
  • 2004
VIEW 1 EXCERPT