Math::Optimization — prompts

First version of linear-programming

Tell me the implementation steps of the sub `linear-programming` described in "./docs/LinearProgramming.md"
in the module "Math::Optimization".
The directory "./lib/Math/Backends" is used to have the "COIN-OR" backend, that uses the Raku package "COIN-OR".

Sparse constraint matrices

The Raku package "COIN-OR" supports the use of constraint matrices given as sparse matrices.
The corresponding method of the class `COIN-OR::Model` is `load-problem`.
The Raku package "Math::SparseMatrix" has a conversion method `to-csc`.
When the sub `linear-programming` of this package is given a `Math::SparseMatrix:D` object as 
a second argument then `load-problem` should be used by COIN-OR's backend.
Tell me your plan to implement this -- do not implement anything yet.

Math::Optimization v0.0.3

Mathematical optimization algorithms.

Authors

  • Anton Antonov

License

Artistic-2.0

Dependencies

COIN-OR:ver<0.0.4+>Data::TypeSystem:ver<0.1.9+>Math::MatrixMath::SparseMatrix:ver<0.0.16+>

Test Dependencies

Provides

  • Math::Backends::COIN-OR
  • Math::Optimization

The Camelia image is copyright 2009 by Larry Wall. "Raku" is a trademark of the Yet Another Society. All rights reserved.

Built with Podlite — the markup and publishing tools behind this site.