schedcat.git/native/include/linprog, branch master [ARCHIVE] Bjorn's schedulability study framework. Now on GitHub. Add support for dumping LPs to iostreams 2013-02-12T11:55:16+00:00 Bjoern Brandenburg bbb@mpi-sws.org 2013-01-05T13:28:14+00:00 de2e2536976faecc0a90d1276c9a02789bd479cc Quite handy when debugging LPs... 
Quite handy when debugging LPs...
C++ LP analysis: add LP debugging helper 2013-02-12T11:55:16+00:00 Bjoern Brandenburg bbb@mpi-sws.org 2012-12-12T10:55:22+00:00 299ad40e3f0ae8fe2a8436371cce7edd22d98b8c Dump a LP solution to a stream for inspection. 
Dump a LP solution to a stream for inspection.
Refactor linprog_solve() into a proper function 2013-02-12T11:55:16+00:00 Bjoern Brandenburg bbb@mpi-sws.org 2012-12-10T18:19:31+00:00 7c79568606ee9bfdc22666954feac8d16fe37beb 






Switch to CPX (CPLEX C API) as default LP solver
2013-02-12T11:55:15+00:00

Bjoern Brandenburg
bbb@mpi-sws.org

2012-08-13T20:41:09+00:00

5a7cba3cc5e17fec43285997eb519eb3c2da40f7

Much faster than the alternatives, so use it when available.





Much faster than the alternatives, so use it when available.







Implement CPLEX integration via C API
2013-02-12T11:55:15+00:00

Bjoern Brandenburg
bbb@mpi-sws.org

2012-08-13T20:40:19+00:00

79818e276e30d037501b4eceaa25b9b2ccffbff6

Using the plain, old C API seems to be *much* faster.

single:
lp_dpcp_bounds::cpu_costs: total=19569.9ms last=93.2767ms average=88.9543ms count=220
lp_dflp_bounds::cpu_costs: total=21537.3ms last=102.459ms average=97.8969ms count=220





Using the plain, old C API seems to be *much* faster.

single:
lp_dpcp_bounds::cpu_costs: total=19569.9ms last=93.2767ms average=88.9543ms count=220
lp_dflp_bounds::cpu_costs: total=21537.3ms last=102.459ms average=97.8969ms count=220







Add GLPK Integration
2013-02-12T11:49:40+00:00

Bjoern Brandenburg
bbb@mpi-sws.org

2012-08-07T11:09:21+00:00

f79777a2c66301c6b8f7ec757f02b4b13e640d94

Add a bridge to the GLPK library. Availability is auto-discovered by
the build system. Most of the code is solver-agnostic.





Add a bridge to the GLPK library. Availability is auto-discovered by
the build system. Most of the code is solver-agnostic.







Add DPCP and DFLP linear program generation
2013-02-12T11:49:40+00:00

Bjoern Brandenburg
bbb@mpi-sws.org

2012-08-07T18:28:29+00:00

4d45e06a55ad463247edd949e6d0c98a69fcf332

These files implement the generation and evaluation of linear programs
that bound maximum s-aware pi-blocking under the DPCP and the DFLP.





These files implement the generation and evaluation of linear programs
that bound maximum s-aware pi-blocking under the DPCP and the DFLP.







Add CPLEX integration
2013-02-12T11:49:39+00:00

Bjoern Brandenburg
bbb@mpi-sws.org

2012-08-07T18:19:14+00:00

a4ff45bfbaef292ee1106b759c7ae80213b03cd4

This patch introduces a concrete subclass of Solution that implements the actual
solving of linear programs by means of invoking the CPLEX Concert Technology API.

The project can still be compiled on systems that do not have CPLEX installed.





This patch introduces a concrete subclass of Solution that implements the actual
solving of linear programs by means of invoking the CPLEX Concert Technology API.

The project can still be compiled on systems that do not have CPLEX installed.







Add simple C++ linear program representation
2013-02-12T11:49:39+00:00

Bjoern Brandenburg
bbb@mpi-sws.org

2012-08-07T18:10:06+00:00

673f367fc5835ebce3357dfebee9c0e414e5c09b

- Constraints are expressed as lists of terms.
- Linear programs consist of only equalities and less-than-or-equal constraints.
- Solvers hide behind an abstract solution class that can evaluate
  linear expressions.





- Constraints are expressed as lists of terms.
- Linear programs consist of only equalities and less-than-or-equal constraints.
- Solvers hide behind an abstract solution class that can evaluate
  linear expressions.