opl 2.4.1 → 2.5.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
-SHA1:
-  metadata.gz: 1a11eb865eed8b1f280c8dd764f76fa4916357d3
-  data.tar.gz: 78ec8f5196e4d90f2d6f237c21571262cab92dd0
+SHA256:
+  metadata.gz: 577e5853623d778f8c4aa44f28e787180aededce471e953107af513a132793d8
+  data.tar.gz: 58364f2f6b34053fa45a8a6bdb827b6fcd777cfb14d4752a6be82c1f214d6b7f
 SHA512:
-  metadata.gz: 5124341d93c8438663e4c2244c7abad2f51036ea6278b0f6e9f2ae092823cf29a821cc4d29541a3ee64ee668a4bad1068e424a2c39f950a0d0ff85f468ec7eee
-  data.tar.gz: fd1490b7e159ab31361fe0e748bafb0dfd8f03a2c578e732f79d0eaea7a25309d37cbb302b4ca11e2f8b84dd7a1671e34c75f2e59bc8adea02fdda441783597f
+  metadata.gz: d529766f941755f63be3a3e44a1cb8986c16368119493076bdb61aaf1f91c63e8bc73d6ab66b5bca512aebaf1ce72c99a1cf94f37a041000fa99cbc0bfbc43a4
+  data.tar.gz: 98d388bdd84b40c9476031fffd036255eb06e9c120b84ef916f9bf796714b68087bf7fa7dcc379fc7c5e6d25e270283f08219ec8edf828c68591f46612135963

data/lib/opl.rb

@@ -1,6 +1,7 @@
 require "rglpk"
-require_relative "string.rb"
 require_relative "array.rb"
+require_relative "string.rb"
+require_relative "sudoku.rb"
 
 # Notes for future functionality
 #
@@ -1115,7 +1116,11 @@ def optimize(optimization, objective, lp)
 	end
 	lp.solution = answer
 	lp.rglpk_object = p
-	lp.matrix_solution = lp.solution_as_matrix
+	begin
+		lp.matrix_solution = lp.solution_as_matrix
+	rescue
+		return lp
+	end
 	if lp.stop_processing
 		lp.solution = lp.error_message
 		lp.matrix_solution = lp.error_message

data/lib/sudoku.rb

@@ -0,0 +1,71 @@
+class OPL
+  class Sudoku
+    attr_accessor :input_matrix
+    attr_accessor :lp
+    attr_accessor :solution
+
+    def initialize(input_matrix)
+      @input_matrix = input_matrix
+      ""
+    end
+
+    def solve
+      size = input_matrix.count
+      rubysize = size-1
+
+      constant_constraints = []
+      input_matrix.each_index do |i|
+        row = input_matrix[i]
+
+        row.each_index do |j|
+          element = input_matrix[i][j]
+
+          if element != 0
+            constant_constraints << "x[#{i}][#{j}][#{element-1}] = 1"
+          end
+        end
+      end
+
+      @lp = minimize("y", subject_to([
+        "y = 2",# y is a dummy variable so I don't have to worry about the objective function
+        "forall(i in (0..#{rubysize}), j in (0..#{rubysize}), sum(k in (0..#{rubysize}), x[i][j][k]) = 1)",# an element contains only one number
+        "forall(i in (0..#{rubysize}), k in (0..#{rubysize}), sum(j in (0..#{rubysize}), x[i][j][k]) = 1)",# every row contains every number
+        "forall(j in (0..#{rubysize}), k in (0..#{rubysize}), sum(i in (0..#{rubysize}), x[i][j][k]) = 1)",# every column contains every number
+        "forall(u in [0,3,6], v in [0,3,6], k in (0..#{rubysize}), sum(i in ((0+u)..(#{(size/3)-1}+u)), j in ((0+v)..(#{(size/3)-1}+v)), x[i][j][k]) = 1)",# every 3x3 grid contains every number
+        constant_constraints# some elements already have their values set
+      ].flatten,["BOOLEAN: x"]))
+      ""
+    end
+
+    def format_solution
+      @lp.matrix_solution["x"]
+      mat = @lp.matrix_solution["x"]
+      sol = Array.new(mat[0][0].size) { Array.new(mat[0][0].size, 0) }
+      mat.each_index do |i|
+        mat[i].each_index do |j|
+          mat[i][j].each_index do |k|
+            if mat[i][j][k].to_f == 1.0
+              sol[i][j] = k+1
+            end
+          end
+        end
+      end
+      @solution = sol
+      ""
+    end
+
+    def print_problem
+      @input_matrix.each do |row|
+        puts row.join(" ")
+      end
+      ""
+    end
+
+    def print_solution
+      @solution.each do |row|
+        puts row.join(" ")
+      end
+      ""
+    end
+  end
+end

metadata

@@ -1,15 +1,29 @@
 --- !ruby/object:Gem::Specification
 name: opl
 version: !ruby/object:Gem::Version
-  version: 2.4.1
+  version: 2.5.1
 platform: ruby
 authors:
 - Benjamin Godlove
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2015-02-15 00:00:00.000000000 Z
-dependencies: []
+date: 2020-06-20 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rglpk
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.4.0
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.4.0
 description: This gem gives you a beautifully simple way to formulate your linear
   or mixed integer program. The syntax is inspired by OPL Studio, which remains my
   favorite linear programming software, but the license is quite expensive.
@@ -21,9 +35,10 @@ files:
 - lib/array.rb
 - lib/opl.rb
 - lib/string.rb
+- lib/sudoku.rb
 homepage: http://github.com/brg8/opl
 licenses:
-- GNU
+- MIT
 metadata: {}
 post_install_message: 
 rdoc_options: []
@@ -40,8 +55,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubyforge_project: 
-rubygems_version: 2.2.2
+rubygems_version: 3.0.6
 signing_key: 
 specification_version: 4
 summary: Linear Or Mixed Integer Program Solver