rams 0.1 → 0.1.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 67e00b03b834709c1fe99786d347e930d4446738
-  data.tar.gz: 92e7882abc5840a724ec73a9966180150bedddd4
+  metadata.gz: 892ffe4b05f309fee78d179745713f1880362428
+  data.tar.gz: a659e1f65de80be3dae780ea30cb3b3ed504e5f9
 SHA512:
-  metadata.gz: a8d314f2631447ae0a8d500b5b358f55fe319cb6a60a44c21ac439a032c9a7b0504654ac14bbe1b81bc9c52687ec04e68f8d6b3d617e305f143912d8cff748ad
-  data.tar.gz: d9944355d64f23fd6c43ddc841e668ae9f6d272eeec906b1df9809a01df987a59514e43600528619eec3a34db7df0dafb0e6f0557542438452b3b2a5b68e3b73
+  metadata.gz: dcd53a0bd69bf259195e74ad33162b4176a89d55388ca400516da6b43916d819d2a613ade587906d3b26bf07897b105d20f7098487e839bfbbb0f99dcc1e723b
+  data.tar.gz: 45cd3f47128cb9c4ee68ece0e9e309495b0b2049e53522aa3914aa404147164183ce67b0b0e4ceb49dbc4118f31174d192215ee7407f328a403edec651063fc3

data/lib/rams/model.rb

@@ -1,5 +1,7 @@
 require 'tempfile'
 require_relative 'variable'
+require_relative 'solvers/cbc'
+require_relative 'solvers/clp'
 require_relative 'solvers/glpk'
 
 module RAMS
@@ -28,7 +30,11 @@ module RAMS
     attr_accessor :objective, :args, :verbose
     attr_reader :solver, :sense, :variables, :constraints
 
-    SOLVERS = { glpk: RAMS::Solvers::GLPK.new }.freeze
+    SOLVERS = {
+      cbc: RAMS::Solvers::CBC.new,
+      clp: RAMS::Solvers::CLP.new,
+      glpk: RAMS::Solvers::GLPK.new
+    }.freeze
 
     def initialize
       @solver = :glpk

data/lib/rams/solvers/cbc.rb

@@ -0,0 +1,45 @@
+require_relative 'solver'
+
+module RAMS
+  module Solvers
+    # Interface to COIN-OR Branch-and-Cut
+    class CBC < Solver
+      def solver_command(model_file, solution_file, args)
+        ['cbc', model_file.path] + args + ['printingOptions', 'all', 'solve', 'solution', solution_file.path]
+      end
+
+      private
+
+      def parse_status(model, lines)
+        return :undefined if lines.count < 1
+        status = lines.first
+        return :optimal if status =~ /Optimal/
+        return :feasible if status =~ /Stopped/
+        return :infeasible if status =~ /Infeasible/
+        return :unbounded if status =~ /Unbounded/
+        :undefined
+      end
+
+      def parse_objective(model, lines)
+        return nil if lines.count < 1
+        objective = lines.first.split[-1].to_f
+        model.sense == :max ? -objective : objective
+      end
+
+      def parse_primal(model, lines)
+        lines[model.constraints.count + 1, model.variables.count].map do |l|
+          comps = l.split
+          [model.variables[comps[1]], comps[2].to_f]
+        end.to_h
+      end
+
+      def parse_dual(model, lines)
+        lines[1, model.constraints.count].map do |l|
+          comps = l.split
+          dual = model.sense == :max ? -comps[3].to_f : comps[3].to_f
+          [model.constraints[comps[1]], dual]
+        end.to_h
+      end
+    end
+  end
+end

data/lib/rams/solvers/clp.rb

@@ -0,0 +1,45 @@
+require_relative 'solver'
+
+module RAMS
+  module Solvers
+    # Interface to COIN-OR Linear Programming
+    class CLP < Solver
+      def solver_command(model_file, solution_file, args)
+        ['clp', model_file.path] + args + ['printingOptions', 'all', 'solve', 'solution', solution_file.path]
+      end
+
+      private
+
+      def parse_status(model, lines)
+        return :undefined if lines.count < 1
+        status = lines.first
+        return :optimal if status =~ /optimal/
+        return :feasible if status =~ /stopped/
+        return :infeasible if status =~ /infeasible/
+        return :unbounded if status =~ /unbounded/
+        :undefined
+      end
+
+      def parse_objective(model, lines)
+        return nil if lines.count < 2
+        objective = lines[1].split[-1].to_f
+        model.sense == :max ? -objective : objective
+      end
+
+      def parse_primal(model, lines)
+        lines[model.constraints.count + 2, model.variables.count].map do |l|
+          comps = l.split
+          [model.variables[comps[1]], comps[2].to_f]
+        end.to_h
+      end
+
+      def parse_dual(model, lines)
+        lines[2, model.constraints.count].map do |l|
+          comps = l.split
+          dual = model.sense == :max ? -comps[3].to_f : comps[3].to_f
+          [model.constraints[comps[1]], dual]
+        end.to_h
+      end
+    end
+  end
+end

data/lib/rams/solvers/glpk.rb

@@ -4,36 +4,35 @@ module RAMS
   module Solvers
     # Interface to the GNU Linear Programming Kit
     class GLPK < Solver
-      def solver_command(model_file, solution_file)
-        ['glpsol', '--lp', model_file.path, '--output', solution_file.path]
+      def solver_command(model_file, solution_file, args)
+        ['glpsol', '--lp', model_file.path, '--output', solution_file.path] + args
       end
 
       private
 
-      def parse_status(lines)
+      def parse_status(_model, lines)
         status = lines.select { |l| l =~ /^Status/ }.first
         return :optimal if status =~ /OPTIMAL/
         return :feasible if status =~ /FEASIBLE/
         return :infeasible if status =~ /EMPTY/
+        return :unbounded if status =~ /UNBOUNDED/
         :undefined
       end
 
-      def parse_objective(lines)
+      def parse_objective(_model, lines)
         lines.select { |l| l =~ /^Objective/ }.first.split[3].to_f
       end
 
       def parse_primal(model, lines)
-        primal = model.variables.values.map { |v| [v, 0.0] }.to_h
         start_idx = lines.index { |l| l =~ /Column name/ } + 2
         length = lines[start_idx, lines.length].index { |l| l == '' }
-        primal.update(lines[start_idx, length].map { |l| [model.variables[l[7, 12].strip], l[23, 13].to_f] }.to_h)
+        lines[start_idx, length].map { |l| [model.variables[l[7, 12].strip], l[23, 13].to_f] }.to_h
       end
 
       def parse_dual(model, lines)
-        duals = model.constraints.values.map { |c| [c, 0.0] }.to_h
         start_idx = lines.index { |l| l =~ /Row name/ } + 2
         length = lines[start_idx, lines.length].index { |l| l == '' }
-        duals.update(lines[start_idx, length].map { |l| [model.constraints[l[7, 12].strip], l[-13, 13].to_f] }.to_h)
+        lines[start_idx, length].map { |l| [model.constraints[l[7, 12].strip], l[-13, 13].to_f] }.to_h
       end
     end
   end

data/lib/rams/solvers/solver.rb

@@ -39,7 +39,7 @@ module RAMS
 
       # rubocop:disable MethodLength
       def call_solver(model, model_file, solution_file)
-        command = solver_command(model_file, solution_file) + model.args
+        command = solver_command(model_file, solution_file, model.args)
         _, stdout, stderr, exit_code = Open3.popen3(*command)
 
         begin
@@ -54,25 +54,25 @@ module RAMS
       end
       # rubocop:enable MethodLength
 
-      def solver_command(_model_file, _solution_file)
+      def solver_command(_model_file, _solution_file, _args)
         raise NotImplementedError
       end
 
       def parse_solution(model, solution_text)
         lines = solution_text.split "\n"
         RAMS::Solution.new(
-          parse_status(lines),
-          parse_objective(lines),
+          parse_status(model, lines),
+          parse_objective(model, lines),
           parse_primal(model, lines),
           parse_dual(model, lines)
         )
       end
 
-      def parse_status(_lines)
+      def parse_status(_model, _lines)
         raise NotImplementedError
       end
 
-      def parse_objective(_lines)
+      def parse_objective(_model, _lines)
         raise NotImplementedError
       end
 

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: rams
 version: !ruby/object:Gem::Version
-  version: '0.1'
+  version: 0.1.1
 platform: ruby
 authors:
 - Ryan J. O'Neil
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2017-01-07 00:00:00.000000000 Z
+date: 2017-01-08 00:00:00.000000000 Z
 dependencies: []
 description: A library for solving MILPs in Ruby.
 email:
@@ -23,6 +23,8 @@ files:
 - lib/rams/model.rb
 - lib/rams/numeric.rb
 - lib/rams/solution.rb
+- lib/rams/solvers/cbc.rb
+- lib/rams/solvers/clp.rb
 - lib/rams/solvers/glpk.rb
 - lib/rams/solvers/solver.rb
 - lib/rams/variable.rb