rams 0.1.7 → 0.2.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 2698305984dbac218b10cdacc6ae51d400a163824bbe4f589ac6b137515e5294
-  data.tar.gz: daa2eaa37952ad4fdd5e45b80f759a3e3673e66f30768995706c3644fd62e5f0
+  metadata.gz: 51df1f0581f9e3537db77282d196e48f2f0c36a89dabf596117894bbc071fd27
+  data.tar.gz: 2c05958f5ce73828097854aa0b3084af2e208b6112ffa97eac01e29daf3d7289
 SHA512:
-  metadata.gz: 06e3e2d8c5db855ce2ada7f400b5208199fec2c81e2ab5037e59aa382311f2019563f66abb072c38e6f5725f60725eee881e2354258987f4d4d5d76af6dcc8db
-  data.tar.gz: 63347ef76f94ca8f162424ac8bdc269041ccbc181a251fd1d49f2751d3dc8040170c85e2796d59146b6b2e67d91580b9cafd00e65e85c8e523a7c5e87658a0b6
+  metadata.gz: 5d3fe18d6745528aa1296bdc02dcab81e0cab9536856ba14110a1baa94fddec213db9d69d0915d9fc1c7ceac2c770057891f1f309f3e62243aef45c9e23d1455
+  data.tar.gz: 9607509c99f7476ba6853a56a965ed3ffd8fa6cd024f9c9bc7bcfae9e5b030f961afbdfe8959481cbd8df07a805333018227f486b9567e8f2000fe4c8657340a

data/lib/rams/model.rb

@@ -3,8 +3,8 @@ require_relative 'expression'
 require_relative 'formatters/lp'
 require_relative 'solvers/cbc'
 require_relative 'solvers/clp'
-require_relative 'solvers/cplex'
 require_relative 'solvers/glpk'
+require_relative 'solvers/highs'
 require_relative 'solvers/scip'
 require_relative 'variable'
 
@@ -26,7 +26,7 @@ module RAMS
   #
   #   m.sense = :max
   #   m.objective = (x1 + (2 * x2))
-  #   m.solver = :glpk
+  #   m.solver = :highs
   #   m.verbose = true
   #   m.solve
   #
@@ -38,13 +38,13 @@ module RAMS
     SOLVERS = {
       cbc: RAMS::Solvers::CBC.new,
       clp: RAMS::Solvers::CLP.new,
-      cplex: RAMS::Solvers::CPLEX.new,
       glpk: RAMS::Solvers::GLPK.new,
+      highs: RAMS::Solvers::HiGHS.new,
       scip: RAMS::Solvers::SCIP.new
     }.freeze
 
     def initialize
-      @solver = :glpk
+      @solver = :highs
       @sense = :max
       @objective = nil
       @verbose = false

data/lib/rams/solvers/cbc.rb

@@ -5,7 +5,7 @@ module RAMS
     # Interface to COIN-OR Branch-and-Cut
     class CBC < Solver
       def solver_command(model_path, solution_path, args)
-        ['coin.cbc', model_path] + args + ['printingOptions', 'all', 'solve', 'solution', solution_path]
+        [solver_executable('coin.cbc', 'cbc'), model_path] + args + ['printingOptions', 'all', 'solve', 'solution', solution_path]
       end
 
       private

data/lib/rams/solvers/clp.rb

@@ -5,7 +5,7 @@ module RAMS
     # Interface to COIN-OR Linear Programming
     class CLP < Solver
       def solver_command(model_path, solution_path, args)
-        ['clp', model_path] + args + ['printingOptions', 'all', 'solve', 'solution', solution_path]
+        [solver_executable('clp', 'clp'), model_path] + args + ['printingOptions', 'all', 'solve', 'solution', solution_path]
       end
 
       private

data/lib/rams/solvers/glpk.rb

@@ -5,7 +5,7 @@ module RAMS
     # Interface to the GNU Linear Programming Kit
     class GLPK < Solver
       def solver_command(model_path, solution_path, args)
-        ['glpsol', '--lp', model_path, '--output', solution_path] + args
+        [solver_executable('glpsol', 'glpk'), '--lp', model_path, '--output', solution_path] + args
       end
 
       private

data/lib/rams/solvers/highs.rb

@@ -0,0 +1,94 @@
+require_relative 'solver'
+
+module RAMS
+  module Solvers
+    # Interface to HiGHS solver
+    class HiGHS < Solver
+      def solver_command(model_path, solution_path, args)
+        [solver_executable('highs', 'highs'), model_path, '--solution_file', solution_path] + args
+      end
+
+      private
+
+      def parse_status(_model, lines)
+        status_idx = lines.index { |l| l =~ /^Model status/ }
+        return :undefined unless status_idx
+
+        # Status is on the next line after "Model status"
+        status = lines[status_idx + 1]
+        return :undefined unless status
+
+        return :optimal if status =~ /optimal/i
+        return :feasible if status =~ /^feasible/i
+        return :infeasible if status =~ /infeasible/i
+        return :unbounded if status =~ /unbounded/i
+        :undefined
+      end
+
+      def parse_objective(_model, lines)
+        objective_line = lines.find { |l| l =~ /^Objective/ }
+        return nil unless objective_line
+        objective_line.split.last.to_f
+      end
+
+      def parse_primal(model, lines)
+        # Find the primal section
+        start_idx = lines.index { |l| l =~ /^# Columns/ }
+        return {} unless start_idx
+
+        num_columns = lines[start_idx].split.last.to_i
+        primal_values = {}
+
+        # Parse variable values
+        (1..num_columns).each do |i|
+          line = lines[start_idx + i]
+          next unless line
+
+          parts = line.split
+          next unless parts.length >= 2
+
+          var_name = parts[0]
+          var_value = parts[1].to_f
+          variable = model.variables[var_name]
+          primal_values[variable] = var_value if variable
+        end
+
+        primal_values
+      end
+
+      def parse_dual(model, lines)
+        # Find the dual section
+        dual_start_idx = lines.index { |l| l =~ /^# Dual solution values/ }
+        return {} unless dual_start_idx
+
+
+        # Check if dual solution is available
+        lines = lines[dual_start_idx..-1]
+        return {} if lines[dual_start_idx + 1] =~ /^None/
+
+        # Find the rows section within dual values
+        rows_idx = lines.index { |l| l =~ /^# Rows/ }
+        return {} unless rows_idx
+
+        num_rows = lines[rows_idx].split.last.to_i
+        dual_values = {}
+
+        # Parse constraint dual values
+        (1..num_rows).each do |i|
+          line = lines[rows_idx + i]
+          next unless line
+
+          parts = line.split
+          next unless parts.length >= 2
+
+          constraint_name = parts[0]
+          dual_value = parts[1].to_f
+          constraint = model.constraints[constraint_name]
+          dual_values[constraint] = dual_value if constraint
+        end
+
+        dual_values
+      end
+    end
+  end
+end

data/lib/rams/solvers/scip.rb

@@ -11,7 +11,7 @@ module RAMS
       end
 
       def solver_command(model_path, _solution_path, args)
-        ['scip', '-c', "read #{model_path}"] + args +
+        [solver_executable('scip', 'scip'), '-c', "read #{model_path}"] + args +
           ['-c', 'optimize', '-c', 'display solution', '-c', 'display dualsolution', '-c', 'quit']
       end
 

data/lib/rams/solvers/solver.rb

@@ -60,6 +60,11 @@ module RAMS
         raise NotImplementedError
       end
 
+      # Get solver executable name, checking environment variable first
+      def solver_executable(default_name, solver_name)
+        ENV["RAMS_SOLVER_PATH_#{solver_name.upcase}"] || default_name
+      end
+
       def parse_solution(model, solution_text)
         lines = solution_text.split "\n"
         RAMS::Solution.new(

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: rams
 version: !ruby/object:Gem::Version
-  version: 0.1.7
+  version: 0.2.0
 platform: ruby
 authors:
 - Ryan J. O'Neil
@@ -11,7 +11,7 @@ date: 2025-06-24 00:00:00.000000000 Z
 dependencies: []
 description: A library for solving MILPs in Ruby.
 email:
-- ryanjoneil@gmail.com
+- adventures-in-opt.1ba50@passmail.net
 executables: []
 extensions: []
 extra_rdoc_files: []
@@ -25,8 +25,8 @@ files:
 - lib/rams/solution.rb
 - lib/rams/solvers/cbc.rb
 - lib/rams/solvers/clp.rb
-- lib/rams/solvers/cplex.rb
 - lib/rams/solvers/glpk.rb
+- lib/rams/solvers/highs.rb
 - lib/rams/solvers/scip.rb
 - lib/rams/solvers/solver.rb
 - lib/rams/variable.rb

data/lib/rams/solvers/cplex.rb

@@ -1,55 +0,0 @@
-require 'nokogiri'
-require_relative 'solver'
-
-module RAMS
-  module Solvers
-    # Interface to CPLEX
-    class CPLEX < Solver
-      def solve_and_parse(model, model_path, solution_path)
-        call_solver model, model_path, solution_path
-        return RAMS::Solution.new(:infeasible, nil, {}, {}) unless File.exist? solution_path
-        parse_solution model, File.read(solution_path)
-      end
-
-      def solver_command(model_path, solution_path, args)
-        ['cplex', '-c', "read #{model_path}"] + args + ['optimize', "write #{solution_path}"]
-      end
-
-      private
-
-      def parse_solution(model, solution_text)
-        xml_doc = Nokogiri::XML solution_text
-        RAMS::Solution.new(
-          parse_status(model, xml_doc),
-          parse_objective(model, xml_doc),
-          parse_primal(model, xml_doc),
-          parse_dual(model, xml_doc)
-        )
-      end
-
-      def parse_status(_model, xml_doc)
-        status = xml_doc.css('CPLEXSolution').css('header').first['solutionStatusString']
-        return :optimal if status =~ /optimal/i
-        return :feasible if status =~ /feasible/i
-        return :unbounded if status =~ /unbounded/i
-        :unknown
-      end
-
-      def parse_objective(_model, xml_doc)
-        xml_doc.css('CPLEXSolution').css('header').first['objectiveValue'].to_f
-      end
-
-      def parse_primal(model, xml_doc)
-        xml_doc.css('CPLEXSolution').css('variables').css('variable').map do |v|
-          [model.variables[v['name']], v['value'].to_f]
-        end.to_h
-      end
-
-      def parse_dual(model, xml_doc)
-        xml_doc.css('CPLEXSolution').css('linearConstraints').css('constraint').map do |c|
-          [model.constraints[c['name']], c['dual'].to_f]
-        end.to_h
-      end
-    end
-  end
-end