├── VERSION ├── swig ├── configure.in ├── Makefile.in └── glpk.i ├── Gemfile ├── .travis.yml ├── test ├── test_all.rb ├── test_memory_leaks.rb ├── test_brief_example.rb ├── helper.rb ├── test_problem_kind.rb └── test_basic.rb ├── ext └── extconf.rb ├── .gitignore ├── ChangeLog.md ├── Gemfile.lock ├── Rakefile ├── rglpk.gemspec ├── README.md ├── lib └── rglpk.rb └── License.txt /VERSION: -------------------------------------------------------------------------------- 1 | 0.4.0 -------------------------------------------------------------------------------- /swig/configure.in: -------------------------------------------------------------------------------- 1 | AC_INIT(glpk.i) 2 | AC_CHECK_HEADERS_ONCE(glpk.h) 3 | AC_PATH_PROG([SWIG], [swig]) 4 | AC_OUTPUT(Makefile) -------------------------------------------------------------------------------- /Gemfile: -------------------------------------------------------------------------------- 1 | source 'https://rubygems.org' 2 | 3 | group :development do 4 | gem 'jeweler' 5 | gem 'minitest' 6 | gem 'rake' 7 | end 8 | -------------------------------------------------------------------------------- /swig/Makefile.in: -------------------------------------------------------------------------------- 1 | glpk_wrapper.c: glpk.i 2 | @SWIG@ -I/usr/local/include -ruby -w801 -o $@ $? 3 | wrap: glpk_wrapper.c 4 | cp $? ../ext/$? -------------------------------------------------------------------------------- /.travis.yml: -------------------------------------------------------------------------------- 1 | language: ruby 2 | cache: bundler 3 | rvm: 4 | - 1.9.3 5 | before_install: 6 | - sudo apt-get update -qq 7 | - sudo apt-get install -y libglpk-dev swig 8 | -------------------------------------------------------------------------------- /test/test_all.rb: -------------------------------------------------------------------------------- 1 | here = File.expand_path(File.dirname(__FILE__)) 2 | 3 | require here+'/helper' 4 | require here+'/test_basic' 5 | require here+'/test_problem_kind' 6 | require here+'/test_brief_example' 7 | require here+'/test_memory_leaks' -------------------------------------------------------------------------------- /ext/extconf.rb: -------------------------------------------------------------------------------- 1 | require 'mkmf' 2 | dir_config('glpk') 3 | unless have_library("glpk") 4 | $stderr.puts "\nERROR: Cannot find the GLPK library, aborting." 5 | exit 1 6 | end 7 | unless have_header("glpk.h") 8 | $stderr.puts "\nERROR: Cannot find the GLPK header, aborting." 9 | exit 1 10 | end 11 | 12 | create_makefile('glpk_wrapper') 13 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | pkg 2 | *.swp 3 | .bundle/ 4 | 5 | # SWIG Files 6 | swig/Makefile 7 | swig/autom4te.cache/ 8 | swig/config.log 9 | swig/config.status 10 | swig/configure 11 | swig/rglpk.c 12 | 13 | # ext Files 14 | ext/Makefile 15 | ext/conftest.dSYM/ 16 | ext/mkmf.log 17 | ext/glpk_wrapper.bundle 18 | ext/glpk_wrapper.o 19 | ext/glpk_wrapper.so 20 | 21 | # Test Files 22 | test.lp 23 | -------------------------------------------------------------------------------- /test/test_memory_leaks.rb: -------------------------------------------------------------------------------- 1 | require File.expand_path('helper', File.dirname(__FILE__)) 2 | 3 | class TestMemoryLeaks < Minitest::Test 4 | include Examples 5 | 6 | def test_memory_prof 7 | 5.times do 8 | 1000.times do |i| 9 | brief_example 10 | end 11 | 12 | change = change_to_real_memory_in_kb 13 | assert (change < 10000), "memory leak #{change}kb" 14 | end 15 | end 16 | 17 | def real_memory_in_kb 18 | # "=" after "rss" strips the header line. 19 | `ps -p #{Process.pid} -o rss=`.to_i 20 | end 21 | 22 | def change_to_real_memory_in_kb 23 | GC.start 24 | r = real_memory_in_kb 25 | @change_to_real_memory_in_kb__prev ||= r 26 | r - @change_to_real_memory_in_kb__prev 27 | ensure 28 | @change_to_real_memory_in_kb__prev = r 29 | end 30 | end 31 | -------------------------------------------------------------------------------- /test/test_brief_example.rb: -------------------------------------------------------------------------------- 1 | require File.expand_path('helper', File.dirname(__FILE__)) 2 | 3 | class TestBriefExample < Minitest::Test 4 | include Examples 5 | 6 | def test_brief_example 7 | p = brief_example 8 | cols = p.cols 9 | rows = p.rows 10 | 11 | z = p.obj.get 12 | x1 = cols[0].get_prim 13 | x2 = cols[1].get_prim 14 | x3 = cols[2].get_prim 15 | 16 | result = "z = %g; x1 = %g; x2 = %g; x3 = %g" % [z, x1, x2, x3] 17 | assert_equal "z = 733.333; x1 = 33.3333; x2 = 66.6667; x3 = 0", result 18 | assert_equal Rglpk::GLP_NU, rows[0].get_stat 19 | assert_equal 100, rows[0].get_prim 20 | assert_equal 3.333333333333333, rows[0].get_dual 21 | File.delete("test.lp") rescue Errno::ENOENT 22 | p.write_lp("test.lp") 23 | assert File.exists?("test.lp") 24 | end 25 | end 26 | -------------------------------------------------------------------------------- /ChangeLog.md: -------------------------------------------------------------------------------- 1 | # rglpk 0.2.6 2012-01-23 2 | 3 | * Fix memory leaks by adding finalizer to free GLPK problems. 4 | 5 | # rglpk 0.2.5 2011-06-23 6 | 7 | * Add Row#get_stat, Row#get_prim Row#get_dual. 8 | * Update tests to work with Ruby 1.9.2. 9 | 10 | # rglpk 0.2.4 2010-11-04 11 | 12 | * Add Rglpk#mip_status. 13 | 14 | # rglpk 0.2.3 2010-11-03 15 | 16 | * Allow range access of rows and columns. 17 | 18 | # rglpk 0.2.2 2010-10-25 19 | 20 | * Exclude RDoc generation since we don't yet have any. 21 | 22 | # rglpk 0.2.1 2010-10-13 23 | 24 | * Point readers to github in README. 25 | 26 | # rglpk 0.2.0 2010-10-07 27 | 28 | * Wrap glpk-4.44 using swig-2.0.0. 29 | * Make Rglpk::RowArray and Rglpk::ColArray into 0-indexed, Enumerable objects (no longer an Array subclass). 30 | * Switch Rakefile to using Jeweler (from Hoe). 31 | * Consolidate build steps in Rakefile. (No more explicit calls to autoconf, configure, or make required.) 32 | * Add explicit support for integer and binary structural variables. 33 | * Update README. 34 | * Add test cases. 35 | 36 | # rglpk 0.1.0 2007-10-24 37 | 38 | * First private release. 39 | -------------------------------------------------------------------------------- /swig/glpk.i: -------------------------------------------------------------------------------- 1 | /* 2 | * == Author 3 | * Nigel Galloway 4 | * 5 | * == Copyright 6 | *Copyright (C) 2007 Nigel Galloway 7 | * 8 | * Contributor(s): 9 | * Alex Gutteridge 10 | * 11 | *This library is free software; you can redistribute it and/or 12 | *modify it under the terms of the GNU Lesser General Public 13 | *License as published by the Free Software Foundation; either 14 | *version 2.1 of the License, or (at your option) any later version. 15 | * 16 | *This library is distributed in the hope that it will be useful, 17 | *but WITHOUT ANY WARRANTY; without even the implied warranty of 18 | *MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 19 | *Lesser General Public License for more details. 20 | * 21 | *You should have received a copy of the GNU Lesser General Public 22 | *License along with this library; if not, write to the Free Software 23 | *Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 24 | */ 25 | 26 | %module glpk_wrapper 27 | 28 | %{ 29 | #include "glpk.h" 30 | %} 31 | 32 | %include "carrays.i" 33 | 34 | %array_functions(int, intArray) 35 | %array_functions(double, doubleArray) 36 | 37 | %ignore glp_vprintf; 38 | %include "glpk.h" 39 | 40 | 41 | 42 | -------------------------------------------------------------------------------- /Gemfile.lock: -------------------------------------------------------------------------------- 1 | GEM 2 | remote: https://rubygems.org/ 3 | specs: 4 | addressable (2.3.7) 5 | builder (3.2.2) 6 | descendants_tracker (0.0.4) 7 | thread_safe (~> 0.3, >= 0.3.1) 8 | faraday (0.9.1) 9 | multipart-post (>= 1.2, < 3) 10 | git (1.2.9.1) 11 | github_api (0.12.3) 12 | addressable (~> 2.3) 13 | descendants_tracker (~> 0.0.4) 14 | faraday (~> 0.8, < 0.10) 15 | hashie (>= 3.3) 16 | multi_json (>= 1.7.5, < 2.0) 17 | nokogiri (~> 1.6.3) 18 | oauth2 19 | hashie (3.4.1) 20 | highline (1.6.21) 21 | jeweler (2.0.1) 22 | builder 23 | bundler (>= 1.0) 24 | git (>= 1.2.5) 25 | github_api 26 | highline (>= 1.6.15) 27 | nokogiri (>= 1.5.10) 28 | rake 29 | rdoc 30 | json (1.8.2) 31 | jwt (1.3.0) 32 | mini_portile (0.6.2) 33 | minitest (5.5.1) 34 | multi_json (1.11.0) 35 | multi_xml (0.5.5) 36 | multipart-post (2.0.0) 37 | nokogiri (1.6.6.2) 38 | mini_portile (~> 0.6.0) 39 | oauth2 (0.9.4) 40 | faraday (>= 0.8, < 0.10) 41 | jwt (~> 1.0) 42 | multi_json (~> 1.3) 43 | multi_xml (~> 0.5) 44 | rack (~> 1.2) 45 | rack (1.6.0) 46 | rake (10.4.2) 47 | rdoc (4.2.0) 48 | json (~> 1.4) 49 | thread_safe (0.3.5) 50 | 51 | PLATFORMS 52 | ruby 53 | 54 | DEPENDENCIES 55 | jeweler 56 | minitest 57 | rake 58 | -------------------------------------------------------------------------------- /test/helper.rb: -------------------------------------------------------------------------------- 1 | here = File.expand_path(File.dirname(__FILE__)) 2 | 3 | require 'minitest/autorun' 4 | $LOAD_PATH << './ext' 5 | require here+'/../lib/rglpk' 6 | 7 | module Examples 8 | def brief_example 9 | # The same Brief Example as found in section 1.3 of 10 | # glpk-4.44/doc/glpk.pdf. 11 | # 12 | # maximize 13 | # z = 10 * x1 + 6 * x2 + 4 * x3 14 | # 15 | # subject to 16 | # p: x1 + x2 + x3 <= 100 17 | # q: 10 * x1 + 4 * x2 + 5 * x3 <= 600 18 | # r: 2 * x1 + 2 * x2 + 6 * x3 <= 300 19 | # 20 | # where all variables are non-negative 21 | # x1 >= 0, x2 >= 0, x3 >= 0 22 | # 23 | p = Rglpk::Problem.new 24 | p.name = "sample" 25 | p.obj.dir = Rglpk::GLP_MAX 26 | 27 | rows = p.add_rows(3) 28 | rows[0].name = "p" 29 | rows[0].set_bounds(Rglpk::GLP_UP, 0, 100) 30 | rows[1].name = "q" 31 | rows[1].set_bounds(Rglpk::GLP_UP, 0, 600) 32 | rows[2].name = "r" 33 | rows[2].set_bounds(Rglpk::GLP_UP, 0, 300) 34 | 35 | cols = p.add_cols(3) 36 | cols[0].name = "x1" 37 | cols[0].set_bounds(Rglpk::GLP_LO, 0.0, 0.0) 38 | cols[1].name = "x2" 39 | cols[1].set_bounds(Rglpk::GLP_LO, 0.0, 0.0) 40 | cols[2].name = "x3" 41 | cols[2].set_bounds(Rglpk::GLP_LO, 0.0, 0.0) 42 | 43 | p.obj.coefs = [10, 6, 4] 44 | 45 | p.set_matrix([ 46 | 1, 1, 1, 47 | 10, 4, 5, 48 | 2, 2, 6 49 | ]) 50 | 51 | p.simplex 52 | p 53 | end 54 | end 55 | -------------------------------------------------------------------------------- /test/test_problem_kind.rb: -------------------------------------------------------------------------------- 1 | require File.expand_path('helper', File.dirname(__FILE__)) 2 | 3 | module TestProblemKind 4 | def setup 5 | @p = Rglpk::Problem.new 6 | @p.obj.dir = Rglpk::GLP_MAX 7 | 8 | cols = @p.add_cols(3) 9 | cols[0].set_bounds(Rglpk::GLP_LO, 0.0, 0.0) 10 | cols[1].set_bounds(Rglpk::GLP_LO, 0.0, 0.0) 11 | cols[2].set_bounds(Rglpk::GLP_LO, 0.0, 0.0) 12 | 13 | rows = @p.add_rows(3) 14 | 15 | rows[0].set_bounds(Rglpk::GLP_UP, 0, 4) 16 | rows[1].set_bounds(Rglpk::GLP_UP, 0, 5) 17 | rows[2].set_bounds(Rglpk::GLP_UP, 0, 6) 18 | 19 | @p.obj.coefs = [1, 1, 1] 20 | 21 | @p.set_matrix([ 22 | 1, 1, 0, 23 | 0, 1, 1, 24 | 1, 0, 1 25 | ]) 26 | 27 | @p.cols.each{|c| c.kind = column_kind} 28 | end 29 | 30 | def verify_results(*results) 31 | if column_kind == Rglpk::GLP_CV 32 | solution_method = :simplex 33 | status_method = :status 34 | value_method = :get_prim 35 | else 36 | solution_method = :mip 37 | status_method = :mip_status 38 | value_method = :mip_val 39 | end 40 | 41 | @p.send(solution_method, {:presolve => Rglpk::GLP_ON}) 42 | 43 | assert_equal Rglpk::GLP_OPT, @p.send(status_method) 44 | 45 | @p.cols.each_with_index do |col, index| 46 | assert_equal results[index], col.send(value_method) 47 | end 48 | 49 | @p.rows.each do |row| 50 | refute_nil row.send(value_method) 51 | end 52 | end 53 | end 54 | 55 | class BinaryVariables < Minitest::Test 56 | include TestProblemKind 57 | 58 | def column_kind 59 | Rglpk::GLP_BV 60 | end 61 | 62 | def test_results 63 | verify_results(1, 1, 1) 64 | end 65 | end 66 | 67 | class IntegerVariables < Minitest::Test 68 | include TestProblemKind 69 | 70 | def column_kind 71 | Rglpk::GLP_IV 72 | end 73 | 74 | def test_results 75 | verify_results(3, 1, 3) 76 | end 77 | end 78 | 79 | class ContinuousVariables < Minitest::Test 80 | include TestProblemKind 81 | 82 | def column_kind 83 | Rglpk::GLP_CV 84 | end 85 | 86 | def test_results 87 | verify_results(2.5, 1.5, 3.5) 88 | end 89 | end 90 | -------------------------------------------------------------------------------- /Rakefile: -------------------------------------------------------------------------------- 1 | require 'rake/clean' 2 | 3 | # Adapted from Hoe. 4 | def paragraphs_of(path, *paragraphs) 5 | File.read(path).split(/\n\n+/).values_at(*paragraphs).join("\n\n") 6 | end 7 | 8 | def in_dir(path) 9 | original_dir = Dir.pwd 10 | Dir.chdir(path) 11 | yield 12 | ensure 13 | Dir.chdir(original_dir) 14 | end 15 | 16 | begin 17 | require 'jeweler' 18 | Jeweler::Tasks.new do |gemspec| 19 | gemspec.name = "rglpk" 20 | gemspec.summary = paragraphs_of("README.md", 1) 21 | gemspec.description = paragraphs_of("README.md", 1..3) 22 | gemspec.homepage = "http://rglpk.rubyforge.org/" 23 | gemspec.rubyforge_project = "rglpk" 24 | 25 | gemspec.authors = ["Alex Gutteridge", "William Taysom"] 26 | gemspec.email = ["alexg@kuicr.kyoto-u.ac.jp", "wtaysom@gmail.com"] 27 | 28 | gemspec.extensions << 'ext/extconf.rb' 29 | gemspec.require_paths << 'ext' 30 | gemspec.rdoc_options << "--exclude" << "." 31 | end 32 | Jeweler::GemcutterTasks.new 33 | rescue LoadError 34 | puts "Jeweler not available. Install it with: gem install jeweler" 35 | end 36 | 37 | 38 | SHARED_LIBRARY_EXTENSION = RUBY_PLATFORM.include?("darwin") ? 'bundle' : 'so' 39 | EXTENSION = 'ext/glpk_wrapper.'+SHARED_LIBRARY_EXTENSION 40 | 41 | desc "Use extconf.rb and make to build the extension." 42 | task :build_extension => EXTENSION 43 | 44 | file EXTENSION => 'ext/glpk_wrapper.c' do 45 | puts "why am I here?" 46 | in_dir('ext') do 47 | system("ruby extconf.rb") 48 | system("make") 49 | end 50 | end 51 | 52 | CLEAN.include('ext/Makefile', 'ext/conftest.dSYM', 'ext/mkmf.log', 53 | 'ext/glpk_wrapper.bundle', 'ext/glpk_wrapper.o') 54 | 55 | file 'ext/glpk_wrapper.c' => 'swig/glpk.i' do 56 | in_dir('swig') do 57 | system("autoconf") 58 | system("configure") 59 | system("make wrap") 60 | end 61 | end 62 | 63 | CLEAN.include('swig/Makefile', 'swig/autom4te.cache', 'swig/config.log', 64 | 'swig/config.status', 'swig/configure', 'swig/glpk_wrapper.c') 65 | 66 | CLOBBER.include('ext/glpk_wrapper.c', 'rglpk.gemspec') 67 | 68 | desc "Run Test::Unit tests." 69 | task :test => :build_extension do 70 | system("ruby test/test_all.rb") 71 | end 72 | 73 | task :default => [:test] 74 | -------------------------------------------------------------------------------- /rglpk.gemspec: -------------------------------------------------------------------------------- 1 | # Generated by jeweler 2 | # DO NOT EDIT THIS FILE DIRECTLY 3 | # Instead, edit Jeweler::Tasks in Rakefile, and run 'rake gemspec' 4 | # -*- encoding: utf-8 -*- 5 | # stub: rglpk 0.4.0 ruby lib 6 | # stub: ext/extconf.rbext/extconf.rb 7 | 8 | Gem::Specification.new do |s| 9 | s.name = "rglpk" 10 | s.version = "0.4.0" 11 | 12 | s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version= 13 | s.require_paths = ["lib"] 14 | s.authors = ["Alex Gutteridge", "William Taysom"] 15 | s.date = "2015-05-17" 16 | s.description = "# Introduction\n\nRglpk is a package providing a Ruby wrapper to the [GNU GLPK](http://www.gnu.org/software/glpk/) library. The GLPK (GNU Linear Programming Kit) package is intended for solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems.\n\nRglpk (pronounced as \"wriggle-pick\") is currently in alpha status and the API should be considered subject to change. Rglpk uses [Swig](http://www.swig.org/) to initially wrap the C GLPK library (using a Swig wrapper originally developed by Nigel Galloway) and then a pure Ruby library to wrap the Swig code in a more friendly OO-style." 17 | s.email = ["alexg@kuicr.kyoto-u.ac.jp", "wtaysom@gmail.com"] 18 | s.extensions = ["ext/extconf.rb", "ext/extconf.rb"] 19 | s.extra_rdoc_files = [ 20 | "ChangeLog.md", 21 | "README.md" 22 | ] 23 | s.files = [ 24 | ".travis.yml", 25 | "ChangeLog.md", 26 | "Gemfile", 27 | "Gemfile.lock", 28 | "License.txt", 29 | "README.md", 30 | "Rakefile", 31 | "VERSION", 32 | "ext/extconf.rb", 33 | "ext/glpk_wrapper.c", 34 | "lib/rglpk.rb", 35 | "rglpk.gemspec", 36 | "swig/Makefile.in", 37 | "swig/configure.in", 38 | "swig/glpk.i", 39 | "test/helper.rb", 40 | "test/test_all.rb", 41 | "test/test_basic.rb", 42 | "test/test_brief_example.rb", 43 | "test/test_memory_leaks.rb", 44 | "test/test_problem_kind.rb" 45 | ] 46 | s.homepage = "http://rglpk.rubyforge.org/" 47 | s.rdoc_options = ["--exclude", "."] 48 | s.rubyforge_project = "rglpk" 49 | s.rubygems_version = "2.4.6" 50 | s.summary = "# Introduction" 51 | 52 | if s.respond_to? :specification_version then 53 | s.specification_version = 4 54 | 55 | if Gem::Version.new(Gem::VERSION) >= Gem::Version.new('1.2.0') then 56 | s.add_development_dependency(%q, [">= 0"]) 57 | s.add_development_dependency(%q, [">= 0"]) 58 | s.add_development_dependency(%q, [">= 0"]) 59 | else 60 | s.add_dependency(%q, [">= 0"]) 61 | s.add_dependency(%q, [">= 0"]) 62 | s.add_dependency(%q, [">= 0"]) 63 | end 64 | else 65 | s.add_dependency(%q, [">= 0"]) 66 | s.add_dependency(%q, [">= 0"]) 67 | s.add_dependency(%q, [">= 0"]) 68 | end 69 | end 70 | 71 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | [![Build Status](https://travis-ci.org/wtaysom/rglpk.svg)](https://travis-ci.org/wtaysom/rglpk) 2 | 3 | # Introduction 4 | 5 | Rglpk is a package providing a Ruby wrapper to the [GNU GLPK](http://www.gnu.org/software/glpk/) library. The GLPK (GNU Linear Programming Kit) package is intended for solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems. 6 | 7 | Rglpk (pronounced as "wriggle-pick") is currently in alpha status and the API should be considered subject to change. Rglpk uses [Swig](http://www.swig.org/) to initially wrap the C GLPK library (using a Swig wrapper originally developed by Nigel Galloway) and then a pure Ruby library to wrap the Swig code in a more friendly OO-style. 8 | 9 | See [github](http://github.com/wtaysom/rglpk) for installation instructions. All bug reports, feature requests and patches are welcome. Enjoy! 10 | 11 | # Installation 12 | 13 | A working GLPK library installation is required. Currently, Rglpk is tested with GLPK v4.44 ([direct download](http://ftp.gnu.org/gnu/glpk/glpk-4.44.tar.gz)). To install GLPK, follow standard procedure: 14 | 15 | > gzip -d glpk-X.Y.tar.gz 16 | > tar -x < glpk-X.Y.tar 17 | > cd glpk-X.Y 18 | > ./configure 19 | > make 20 | > make check 21 | > make install 22 | > ldconfig # creates the necessary links and cache to the most recent shared libraries 23 | 24 | Rglpk is only available as a gem: 25 | 26 | > gem install rglpk 27 | 28 | The underlying C library is wrapped using Swig. We keep an up-to-date copy of the generated glpk_wrapper.c file with the distribution, so you don't need to install Swig if you don't want to. 29 | 30 | # Documentation 31 | 32 | Rglpk provides two primary files: ext/glpk_wrapper.c which is a Swig generated wrapper and lib/rglpk.rb which provide a nicer OO-orientated interface. You should only ever need to call methods of the Rglpk class defined lib/rglpk.rb. 33 | 34 | An example: 35 | 36 | # The same Brief Example as found in section 1.3 of 37 | # glpk-4.44/doc/glpk.pdf. 38 | # 39 | # maximize 40 | # z = 10 * x1 + 6 * x2 + 4 * x3 41 | # 42 | # subject to 43 | # p: x1 + x2 + x3 <= 100 44 | # q: 10 * x1 + 4 * x2 + 5 * x3 <= 600 45 | # r: 2 * x1 + 2 * x2 + 6 * x3 <= 300 46 | # 47 | # where all variables are non-negative 48 | # x1 >= 0, x2 >= 0, x3 >= 0 49 | # 50 | p = Rglpk::Problem.new 51 | p.name = "sample" 52 | p.obj.dir = Rglpk::GLP_MAX 53 | 54 | rows = p.add_rows(3) 55 | rows[0].name = "p" 56 | rows[0].set_bounds(Rglpk::GLP_UP, 0, 100) 57 | rows[1].name = "q" 58 | rows[1].set_bounds(Rglpk::GLP_UP, 0, 600) 59 | rows[2].name = "r" 60 | rows[2].set_bounds(Rglpk::GLP_UP, 0, 300) 61 | 62 | cols = p.add_cols(3) 63 | cols[0].name = "x1" 64 | cols[0].set_bounds(Rglpk::GLP_LO, 0.0, 0.0) 65 | cols[1].name = "x2" 66 | cols[1].set_bounds(Rglpk::GLP_LO, 0.0, 0.0) 67 | cols[2].name = "x3" 68 | cols[2].set_bounds(Rglpk::GLP_LO, 0.0, 0.0) 69 | 70 | p.obj.coefs = [10, 6, 4] 71 | 72 | p.set_matrix([ 73 | 1, 1, 1, 74 | 10, 4, 5, 75 | 2, 2, 6 76 | ]) 77 | 78 | p.simplex 79 | z = p.obj.get 80 | x1 = cols[0].get_prim 81 | x2 = cols[1].get_prim 82 | x3 = cols[2].get_prim 83 | 84 | printf("z = %g; x1 = %g; x2 = %g; x3 = %g\n", z, x1, x2, x3) 85 | #=> z = 733.333; x1 = 33.3333; x2 = 66.6667; x3 = 0 86 | 87 | # Testing 88 | 89 | Test everything with: 90 | 91 | > rake test 92 | 93 | Test a specific test with: 94 | 95 | > ruby test/test_brief_example.rb # or what have you. 96 | 97 | # License 98 | 99 | Copyright (C) 2007 Alex Gutteridge 100 | 101 | This library is free software; you can redistribute it and/or 102 | modify it under the terms of the GNU Lesser General Public 103 | License as published by the Free Software Foundation; either 104 | version 2.1 of the License, or (at your option) any later version. 105 | 106 | This library is distributed in the hope that it will be useful, 107 | but WITHOUT ANY WARRANTY; without even the implied warranty of 108 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 109 | Lesser General Public License for more details. 110 | 111 | You should have received a copy of the GNU Lesser General Public 112 | License along with this library; if not, write to the Free Software 113 | Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 114 | -------------------------------------------------------------------------------- /test/test_basic.rb: -------------------------------------------------------------------------------- 1 | require File.expand_path('helper', File.dirname(__FILE__)) 2 | 3 | class TestRglpk < Minitest::Test 4 | 5 | def test_create 6 | assert_instance_of Rglpk::Problem, Rglpk::Problem.new 7 | end 8 | 9 | def test_name 10 | p = Rglpk::Problem.new 11 | p.name = 'test' 12 | assert_equal 'test', p.name 13 | end 14 | 15 | def test_obj_fun_name 16 | p = Rglpk::Problem.new 17 | p.obj.name = 'test' 18 | assert_equal 'test', p.obj.name 19 | end 20 | 21 | def test_obj_fun_dir 22 | p = Rglpk::Problem.new 23 | p.obj.dir = Rglpk::GLP_MIN 24 | assert_equal Rglpk::GLP_MIN, p.obj.dir 25 | p.obj.dir = Rglpk::GLP_MAX 26 | assert_equal Rglpk::GLP_MAX, p.obj.dir 27 | assert_raises(ArgumentError){p.obj.dir = 3} 28 | end 29 | 30 | def test_add_row 31 | p = Rglpk::Problem.new 32 | r = p.add_row 33 | assert_kind_of Rglpk::Row, r 34 | assert_equal 1, r.i 35 | assert_equal 1, p.rows.size 36 | r = p.add_row 37 | assert_equal 2, r.i 38 | assert_equal 2, p.rows.size 39 | end 40 | 41 | def test_add_rows 42 | p = Rglpk::Problem.new 43 | p.add_rows(2) 44 | assert_equal 2, p.rows.size 45 | p.add_rows(2) 46 | assert_equal 4, p.rows.size 47 | end 48 | 49 | def test_add_column 50 | p = Rglpk::Problem.new 51 | c = p.add_col 52 | assert_kind_of Rglpk::Column, c 53 | assert_equal 1, c.j 54 | assert_equal 1, p.cols.size 55 | c = p.add_col 56 | assert_equal 2, c.j 57 | assert_equal 2, p.cols.size 58 | end 59 | 60 | def test_add_cols 61 | p = Rglpk::Problem.new 62 | p.add_cols(2) 63 | assert_equal 2, p.cols.size 64 | p.add_cols(2) 65 | assert_equal 4, p.cols.size 66 | end 67 | 68 | def test_set_row_name 69 | p = Rglpk::Problem.new 70 | p.add_rows(10) 71 | p.rows[1].name = 'test' 72 | assert_equal 'test', p.rows[1].name 73 | assert_nil p.rows[2].name 74 | end 75 | 76 | def test_set_col_name 77 | p = Rglpk::Problem.new 78 | p.add_cols(2) 79 | p.cols[0].name = 'test' 80 | assert_equal 'test', p.cols[0].name 81 | assert_nil p.cols[1].name 82 | end 83 | 84 | def test_set_row_bounds 85 | p = Rglpk::Problem.new 86 | p.add_rows(2) 87 | p.rows[1].set_bounds(Rglpk::GLP_FR, nil, nil) 88 | assert_equal [Rglpk::GLP_FR, nil, nil], p.rows[1].bounds 89 | end 90 | 91 | def test_set_col_bounds 92 | p = Rglpk::Problem.new 93 | p.add_cols(2) 94 | p.cols[1].set_bounds(Rglpk::GLP_FR, nil, nil) 95 | assert_equal [Rglpk::GLP_FR, nil, nil], p.cols[1].bounds 96 | end 97 | 98 | def test_obj_coef 99 | p = Rglpk::Problem.new 100 | p.add_cols(2) 101 | p.obj.set_coef(1, 2) 102 | assert_equal [2, 0], p.obj.coefs 103 | p.obj.coefs = [1, 2] 104 | assert_equal [1, 2], p.obj.coefs 105 | end 106 | 107 | def test_set_row 108 | p = Rglpk::Problem.new 109 | p.add_rows(2) 110 | assert_raises(RuntimeError){p.rows[1].set([1, 2])} 111 | p.add_cols(2) 112 | p.rows[1].set([1, 2]) 113 | assert_equal [1, 2], p.rows[1].get 114 | end 115 | 116 | def test_set_col 117 | p = Rglpk::Problem.new 118 | p.add_cols(2) 119 | assert_raises(RuntimeError){p.cols[1].set([1, 2])} 120 | p.add_rows(2) 121 | p.cols[1].set([1, 2]) 122 | assert_equal [1, 2], p.cols[1].get 123 | end 124 | 125 | def test_set_mat 126 | p = Rglpk::Problem.new 127 | p.add_cols(2) 128 | p.add_rows(2) 129 | p.set_matrix([1, 2, 3, 4]) 130 | assert_equal [1, 2], p.rows[0].get 131 | assert_equal [3, 4], p.rows[1].get 132 | assert_equal [1, 3], p.cols[0].get 133 | assert_equal [2, 4], p.cols[1].get 134 | end 135 | 136 | def test_del_row 137 | p = Rglpk::Problem.new 138 | p.add_cols(2) 139 | p.add_rows(2) 140 | p.set_matrix([1, 2, 3, 4]) 141 | assert_equal [1, 2], p.rows[0].get 142 | p.del_rows([1]) 143 | assert_equal [3, 4], p.rows[0].get 144 | assert_equal [3], p.cols[0].get 145 | end 146 | 147 | def test_del_col 148 | p = Rglpk::Problem.new 149 | p.add_cols(2) 150 | p.add_rows(2) 151 | p.set_matrix([1, 2, 3, 4]) 152 | assert_equal [1, 3], p.cols[0].get 153 | p.del_cols([1]) 154 | assert_equal [2, 4], p.cols[0].get 155 | assert_equal [2], p.rows[0].get 156 | end 157 | 158 | def test_nz 159 | p = Rglpk::Problem.new 160 | p.add_cols(2) 161 | p.add_rows(2) 162 | p.set_matrix([1, 2, 3, 4]) 163 | assert_equal 4, p.nz 164 | end 165 | 166 | def test_row_get_by_name 167 | p = Rglpk::Problem.new 168 | assert_raises(RuntimeError){ p.rows['test'] } 169 | p.add_cols(2) 170 | p.add_rows(2) 171 | p.set_matrix([1, 2, 3, 4]) 172 | assert_raises(ArgumentError){ p.rows['test'] } 173 | p.rows[0].name = 'test' 174 | assert_equal [1, 2], p.rows['test'].get 175 | end 176 | 177 | def test_get_row_range 178 | p = Rglpk::Problem.new 179 | p.add_rows(5) 180 | assert_equal 2, p.rows[3..-1].size 181 | end 182 | 183 | def test_col_get_by_name 184 | p = Rglpk::Problem.new 185 | assert_raises(RuntimeError){ p.cols['test'] } 186 | p.add_cols(2) 187 | p.add_rows(2) 188 | p.set_matrix([1, 2, 3, 4]) 189 | assert_raises(ArgumentError){ p.cols['test'] } 190 | p.cols[0].name = 'test' 191 | assert_equal [1, 3], p.cols['test'].get 192 | end 193 | 194 | def test_solve 195 | p = Rglpk::Problem.new 196 | assert_raises(RuntimeError){ p.cols['test'] } 197 | p.add_cols(2) 198 | p.add_rows(2) 199 | p.set_matrix([1, 2, 3, 4]) 200 | p.simplex({:msg_lev => 1}) 201 | end 202 | 203 | def test_sparse_row 204 | p = Rglpk::Problem.new 205 | p.add_cols(7) 206 | rows = p.add_rows(3) 207 | rows[0].set [1], [5] 208 | rows[1].set [3, 6], [6, 7] 209 | rows[2].set [1, 2, 3], [4, 5, 7] 210 | assert_equal [0, 0, 0, 0, 1, 0, 0], rows[0].get 211 | assert_equal [0, 0, 0, 0, 0, 3, 6], rows[1].get 212 | assert_equal [0, 0, 0, 1, 2, 0, 3], rows[2].get 213 | end 214 | 215 | class D < Rglpk::Problem 216 | attr_accessor :species 217 | def initialize 218 | @species = [] 219 | super 220 | end 221 | end 222 | 223 | def test_derived 224 | D.new.add_rows(10) 225 | end 226 | end 227 | -------------------------------------------------------------------------------- /lib/rglpk.rb: -------------------------------------------------------------------------------- 1 | require 'glpk_wrapper' 2 | 3 | module Rglpk 4 | Glpk_wrapper.constants.each do |c| 5 | v = Glpk_wrapper.const_get(c) 6 | self.const_set(c, v) if v.kind_of? Numeric 7 | end 8 | TypeConstants = [GLP_FR, GLP_LO, GLP_UP, GLP_DB, GLP_FX] 9 | 10 | class RowColArray 11 | include Enumerable 12 | 13 | def initialize 14 | @array = [] 15 | end 16 | 17 | def size 18 | @array.size 19 | end 20 | 21 | def each(&block) 22 | @array.each(&block) 23 | self 24 | end 25 | 26 | def [](i) 27 | if i.kind_of?(String) 28 | raise RuntimeError, "no rows" if self[1].nil? 29 | idx = Glpk_wrapper.send(glp_find_method, self[1].p.lp, i) 30 | raise ArgumentError, "no row with name #{i.inspect}" if idx == 0 31 | @array[idx - 1] 32 | else 33 | @array[i] 34 | end 35 | end 36 | 37 | protected 38 | 39 | def push(rc) 40 | @array << rc 41 | end 42 | 43 | def delete_at(index) 44 | @array.delete_at(index) 45 | end 46 | end 47 | 48 | class RowArray < RowColArray 49 | protected 50 | def glp_find_method 51 | :glp_find_row 52 | end 53 | end 54 | 55 | class ColArray < RowColArray 56 | protected 57 | def glp_find_method 58 | :glp_find_col 59 | end 60 | end 61 | 62 | class Problem 63 | attr_accessor :rows, :cols, :obj, :lp 64 | 65 | def initialize 66 | @lp = Glpk_wrapper.glp_create_prob 67 | @obj = ObjectiveFunction.new(self) 68 | @rows = RowArray.new 69 | @cols = ColArray.new 70 | Glpk_wrapper.glp_create_index(@lp) 71 | 72 | ObjectSpace.define_finalizer(self, self.class.finalizer(@lp)) 73 | end 74 | 75 | def self.finalizer(lp) 76 | proc do 77 | Glpk_wrapper.glp_delete_index(lp) 78 | Glpk_wrapper.glp_delete_prob(lp) 79 | end 80 | end 81 | 82 | def name=(n) 83 | Glpk_wrapper.glp_set_prob_name(@lp, n) 84 | end 85 | 86 | def name 87 | Glpk_wrapper.glp_get_prob_name(@lp) 88 | end 89 | 90 | def nz 91 | Glpk_wrapper.glp_get_num_nz(@lp) 92 | end 93 | 94 | def add_row 95 | Glpk_wrapper.glp_add_rows(@lp, 1) 96 | new_row = Row.new(self, @rows.size + 1) 97 | @rows.send(:push, new_row) 98 | new_row 99 | end 100 | 101 | def add_rows(n) 102 | Glpk_wrapper.glp_add_rows(@lp, n) 103 | s = @rows.size 104 | n.times.map do |i| 105 | new_row = Row.new(self, s + i + 1) 106 | @rows.send(:push, new_row) 107 | new_row 108 | end 109 | end 110 | 111 | def add_col 112 | Glpk_wrapper.glp_add_cols(@lp, 1) 113 | new_column = Column.new(self, @cols.size + 1) 114 | @cols.send(:push, new_column) 115 | new_column 116 | end 117 | 118 | def add_cols(n) 119 | Glpk_wrapper.glp_add_cols(@lp, n) 120 | s = @cols.size 121 | n.times.map do |i| 122 | new_col = Column.new(self, s + i + 1) 123 | @cols.send(:push, new_col) 124 | new_col 125 | end 126 | end 127 | 128 | def del_rows(a) 129 | # Ensure the array of rows to delete is sorted and unique. 130 | a = a.sort.uniq 131 | 132 | r = Glpk_wrapper.new_intArray(a.size + 1) 133 | a.each_with_index{|n, i| Glpk_wrapper.intArray_setitem(r, i + 1, n)} 134 | Glpk_wrapper.glp_del_rows(@lp, a.size, r) 135 | Glpk_wrapper.delete_intArray(r) 136 | 137 | a.each do |n| 138 | @rows.send(:delete_at, n) 139 | a.each_with_index do |nn, i| 140 | a[i] -= 1 141 | end 142 | end 143 | @rows.each_with_index{|r, i| r.i = i + 1} 144 | a 145 | end 146 | 147 | def del_cols(a) 148 | # Ensure the array of rows to delete is sorted and unique. 149 | a = a.sort.uniq 150 | 151 | r = Glpk_wrapper.new_intArray(a.size + 1) 152 | a.each_with_index{|n, i| Glpk_wrapper.intArray_setitem(r, i + 1, n)} 153 | Glpk_wrapper.glp_del_cols(@lp, a.size, r) 154 | Glpk_wrapper.delete_intArray(r) 155 | 156 | a.each do |n| 157 | @cols.send(:delete_at, n) 158 | a.each_with_index do |nn, i| 159 | a[i] -= 1 160 | end 161 | end 162 | @cols.each_with_index{|c, i| c.j = i + 1} 163 | a 164 | end 165 | 166 | def set_matrix(v) 167 | nc = Glpk_wrapper.glp_get_num_cols(@lp) 168 | 169 | ia = Glpk_wrapper.new_intArray(v.size + 1) 170 | ja = Glpk_wrapper.new_intArray(v.size + 1) 171 | ar = Glpk_wrapper.new_doubleArray(v.size + 1) 172 | 173 | v.each_with_index do |x, y| 174 | rn = (y + nc) / nc 175 | cn = (y % nc) + 1 176 | 177 | Glpk_wrapper.intArray_setitem(ia, y + 1, rn) 178 | Glpk_wrapper.intArray_setitem(ja, y + 1, cn) 179 | Glpk_wrapper.doubleArray_setitem(ar, y + 1, x) 180 | end 181 | 182 | Glpk_wrapper.glp_load_matrix(@lp, v.size, ia, ja, ar) 183 | 184 | Glpk_wrapper.delete_intArray(ia) 185 | Glpk_wrapper.delete_intArray(ja) 186 | Glpk_wrapper.delete_doubleArray(ar) 187 | end 188 | 189 | private 190 | 191 | def apply_options_to_parm(options, parm) 192 | options.each do |k, v| 193 | begin 194 | parm.send("#{k}=".to_sym, v) 195 | rescue NoMethodError 196 | raise ArgumentError, "Unrecognised option: #{k}" 197 | end 198 | end 199 | end 200 | 201 | public 202 | 203 | def simplex(options = {}) 204 | parm = Glpk_wrapper::Glp_smcp.new 205 | Glpk_wrapper.glp_init_smcp(parm) 206 | 207 | # Default to errors only temrinal output. 208 | parm.msg_lev = GLP_MSG_ERR 209 | 210 | apply_options_to_parm(options, parm) 211 | Glpk_wrapper.glp_simplex(@lp, parm) 212 | end 213 | 214 | def status 215 | Glpk_wrapper.glp_get_status(@lp) 216 | end 217 | 218 | def mip(options = {}) 219 | parm = Glpk_wrapper::Glp_iocp.new 220 | Glpk_wrapper.glp_init_iocp(parm) 221 | 222 | # Default to errors only temrinal output. 223 | parm.msg_lev = GLP_MSG_ERR 224 | 225 | apply_options_to_parm(options, parm) 226 | Glpk_wrapper.glp_intopt(@lp, parm) 227 | end 228 | 229 | def mip_status 230 | Glpk_wrapper.glp_mip_status(@lp) 231 | end 232 | 233 | 234 | def write_lp(filename) 235 | Glpk_wrapper.glp_write_lp(@lp, nil, filename) 236 | end 237 | 238 | 239 | end 240 | 241 | class Row 242 | attr_accessor :i, :p 243 | 244 | def initialize(problem, i) 245 | @p = problem 246 | @i = i 247 | end 248 | 249 | def name=(n) 250 | Glpk_wrapper.glp_set_row_name(@p.lp, @i, n) 251 | end 252 | 253 | def name 254 | Glpk_wrapper.glp_get_row_name(@p.lp, @i) 255 | end 256 | 257 | def set_bounds(type, lb, ub) 258 | raise ArgumentError unless TypeConstants.include?(type) 259 | lb = 0.0 if lb.nil? 260 | ub = 0.0 if ub.nil? 261 | Glpk_wrapper.glp_set_row_bnds(@p.lp, @i, type, lb.to_f, ub.to_f) 262 | end 263 | 264 | def bounds 265 | t = Glpk_wrapper.glp_get_row_type(@p.lp, @i) 266 | lb = Glpk_wrapper.glp_get_row_lb(@p.lp, @i) 267 | ub = Glpk_wrapper.glp_get_row_ub(@p.lp, @i) 268 | 269 | lb = (t == GLP_FR or t == GLP_UP) ? nil : lb 270 | ub = (t == GLP_FR or t == GLP_LO) ? nil : ub 271 | 272 | [t, lb, ub] 273 | end 274 | 275 | def set(v, i = nil) 276 | raise RuntimeError unless v.size == @p.cols.size or (not i.nil? and i.size == v.size) 277 | ind = Glpk_wrapper.new_intArray(v.size + 1) 278 | val = Glpk_wrapper.new_doubleArray(v.size + 1) 279 | 280 | if i.nil? 281 | i = 1.upto(v.size) 282 | end 283 | 284 | i.each_with_index{|x, y| 285 | Glpk_wrapper.intArray_setitem(ind, y + 1, x)} 286 | v.each_with_index{|x, y| 287 | Glpk_wrapper.doubleArray_setitem(val, y + 1, x)} 288 | 289 | Glpk_wrapper.glp_set_mat_row(@p.lp, @i, v.size, ind, val) 290 | 291 | Glpk_wrapper.delete_intArray(ind) 292 | Glpk_wrapper.delete_doubleArray(val) 293 | end 294 | 295 | def get 296 | ind = Glpk_wrapper.new_intArray(@p.cols.size + 1) 297 | val = Glpk_wrapper.new_doubleArray(@p.cols.size + 1) 298 | len = Glpk_wrapper.glp_get_mat_row(@p.lp, @i, ind, val) 299 | row = Array.new(@p.cols.size, 0) 300 | len.times do |i| 301 | v = Glpk_wrapper.doubleArray_getitem(val, i + 1) 302 | j = Glpk_wrapper.intArray_getitem(ind, i + 1) 303 | row[j - 1] = v 304 | end 305 | Glpk_wrapper.delete_intArray(ind) 306 | Glpk_wrapper.delete_doubleArray(val) 307 | row 308 | end 309 | 310 | def get_stat 311 | Glpk_wrapper.glp_get_row_stat(@p.lp, @i) 312 | end 313 | 314 | def get_prim 315 | Glpk_wrapper.glp_get_row_prim(@p.lp, @i) 316 | end 317 | 318 | def mip_val 319 | Glpk_wrapper.glp_mip_row_val(@p.lp, @i) 320 | end 321 | 322 | def get_dual 323 | Glpk_wrapper.glp_get_row_dual(@p.lp, @i) 324 | end 325 | end 326 | 327 | class Column 328 | attr_accessor :j, :p 329 | 330 | def initialize(problem, i) 331 | @p = problem 332 | @j = i 333 | end 334 | 335 | def name=(n) 336 | Glpk_wrapper.glp_set_col_name(@p.lp, @j, n) 337 | end 338 | 339 | def name 340 | Glpk_wrapper.glp_get_col_name(@p.lp, @j) 341 | end 342 | 343 | def kind=(kind) 344 | Glpk_wrapper.glp_set_col_kind(@p.lp, j, kind) 345 | end 346 | 347 | def kind 348 | Glpk_wrapper.glp_get_col_kind(@p.lp, @j) 349 | end 350 | 351 | def set_bounds(type, lb, ub) 352 | raise ArgumentError unless TypeConstants.include?(type) 353 | lb = 0.0 if lb.nil? 354 | ub = 0.0 if ub.nil? 355 | Glpk_wrapper.glp_set_col_bnds(@p.lp, @j, type, lb, ub) 356 | end 357 | 358 | def bounds 359 | t = Glpk_wrapper.glp_get_col_type(@p.lp, @j) 360 | lb = Glpk_wrapper.glp_get_col_lb(@p.lp, @j) 361 | ub = Glpk_wrapper.glp_get_col_ub(@p.lp, @j) 362 | 363 | lb = (t == GLP_FR or t == GLP_UP) ? nil : lb 364 | ub = (t == GLP_FR or t == GLP_LO) ? nil : ub 365 | 366 | [t, lb, ub] 367 | end 368 | 369 | def set(v) 370 | raise RuntimeError unless v.size == @p.rows.size 371 | ind = Glpk_wrapper.new_intArray(v.size + 1) 372 | val = Glpk_wrapper.new_doubleArray(v.size + 1) 373 | 374 | 1.upto(v.size){|x| Glpk_wrapper.intArray_setitem(ind, x, x)} 375 | v.each_with_index{|x, y| 376 | Glpk_wrapper.doubleArray_setitem(val, y + 1, x)} 377 | 378 | Glpk_wrapper.glp_set_mat_col(@p.lp, @j, v.size, ind, val) 379 | 380 | Glpk_wrapper.delete_intArray(ind) 381 | Glpk_wrapper.delete_doubleArray(val) 382 | end 383 | 384 | def get 385 | ind = Glpk_wrapper.new_intArray(@p.rows.size + 1) 386 | val = Glpk_wrapper.new_doubleArray(@p.rows.size + 1) 387 | len = Glpk_wrapper.glp_get_mat_col(@p.lp, @j, ind, val) 388 | col = Array.new(@p.rows.size, 0) 389 | len.times do |i| 390 | v = Glpk_wrapper.doubleArray_getitem(val, i + 1) 391 | j = Glpk_wrapper.intArray_getitem(ind, i + 1) 392 | col[j - 1] = v 393 | end 394 | Glpk_wrapper.delete_intArray(ind) 395 | Glpk_wrapper.delete_doubleArray(val) 396 | col 397 | end 398 | 399 | def get_prim 400 | Glpk_wrapper.glp_get_col_prim(@p.lp, @j) 401 | end 402 | 403 | def mip_val 404 | Glpk_wrapper.glp_mip_col_val(@p.lp, @j) 405 | end 406 | end 407 | 408 | class ObjectiveFunction 409 | 410 | def initialize(problem) 411 | @p = problem 412 | end 413 | 414 | def name=(n) 415 | Glpk_wrapper.glp_set_obj_name(@p.lp, n) 416 | end 417 | 418 | def name 419 | Glpk_wrapper.glp_get_obj_name(@p.lp) 420 | end 421 | 422 | def dir=(d) 423 | raise ArgumentError if d != GLP_MIN and d != GLP_MAX 424 | Glpk_wrapper.glp_set_obj_dir(@p.lp, d) 425 | end 426 | 427 | def dir 428 | Glpk_wrapper.glp_get_obj_dir(@p.lp) 429 | end 430 | 431 | def set_coef(j, coef) 432 | Glpk_wrapper.glp_set_obj_coef(@p.lp, j, coef) 433 | end 434 | 435 | def coefs=(a) 436 | @p.cols.each{|c| Glpk_wrapper.glp_set_obj_coef(@p.lp, c.j, a[c.j - 1])} 437 | a 438 | end 439 | 440 | def coefs 441 | @p.cols.map{|c| Glpk_wrapper.glp_get_obj_coef(@p.lp, c.j)} 442 | end 443 | 444 | def get 445 | Glpk_wrapper.glp_get_obj_val(@p.lp) 446 | end 447 | 448 | def mip 449 | Glpk_wrapper.glp_mip_obj_val(@p.lp) 450 | end 451 | end 452 | end 453 | -------------------------------------------------------------------------------- /License.txt: -------------------------------------------------------------------------------- 1 | GNU LESSER GENERAL PUBLIC LICENSE 2 | Version 2.1, February 1999 3 | 4 | Copyright (C) 1991, 1999 Free Software Foundation, Inc. 5 | 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 6 | Everyone is permitted to copy and distribute verbatim copies 7 | of this license document, but changing it is not allowed. 8 | 9 | [This is the first released version of the Lesser GPL. It also counts 10 | as the successor of the GNU Library Public License, version 2, hence 11 | the version number 2.1.] 12 | 13 | Preamble 14 | 15 | The licenses for most software are designed to take away your 16 | freedom to share and change it. By contrast, the GNU General Public 17 | Licenses are intended to guarantee your freedom to share and change 18 | free software--to make sure the software is free for all its users. 19 | 20 | This license, the Lesser General Public License, applies to some 21 | specially designated software packages--typically libraries--of the 22 | Free Software Foundation and other authors who decide to use it. You 23 | can use it too, but we suggest you first think carefully about whether 24 | this license or the ordinary General Public License is the better 25 | strategy to use in any particular case, based on the explanations below. 26 | 27 | When we speak of free software, we are referring to freedom of use, 28 | not price. Our General Public Licenses are designed to make sure that 29 | you have the freedom to distribute copies of free software (and charge 30 | for this service if you wish); that you receive source code or can get 31 | it if you want it; that you can change the software and use pieces of 32 | it in new free programs; and that you are informed that you can do 33 | these things. 34 | 35 | To protect your rights, we need to make restrictions that forbid 36 | distributors to deny you these rights or to ask you to surrender these 37 | rights. These restrictions translate to certain responsibilities for 38 | you if you distribute copies of the library or if you modify it. 39 | 40 | For example, if you distribute copies of the library, whether gratis 41 | or for a fee, you must give the recipients all the rights that we gave 42 | you. You must make sure that they, too, receive or can get the source 43 | code. If you link other code with the library, you must provide 44 | complete object files to the recipients, so that they can relink them 45 | with the library after making changes to the library and recompiling 46 | it. And you must show them these terms so they know their rights. 47 | 48 | We protect your rights with a two-step method: (1) we copyright the 49 | library, and (2) we offer you this license, which gives you legal 50 | permission to copy, distribute and/or modify the library. 51 | 52 | To protect each distributor, we want to make it very clear that 53 | there is no warranty for the free library. Also, if the library is 54 | modified by someone else and passed on, the recipients should know 55 | that what they have is not the original version, so that the original 56 | author's reputation will not be affected by problems that might be 57 | introduced by others. 58 | 59 | Finally, software patents pose a constant threat to the existence of 60 | any free program. We wish to make sure that a company cannot 61 | effectively restrict the users of a free program by obtaining a 62 | restrictive license from a patent holder. Therefore, we insist that 63 | any patent license obtained for a version of the library must be 64 | consistent with the full freedom of use specified in this license. 65 | 66 | Most GNU software, including some libraries, is covered by the 67 | ordinary GNU General Public License. This license, the GNU Lesser 68 | General Public License, applies to certain designated libraries, and 69 | is quite different from the ordinary General Public License. We use 70 | this license for certain libraries in order to permit linking those 71 | libraries into non-free programs. 72 | 73 | When a program is linked with a library, whether statically or using 74 | a shared library, the combination of the two is legally speaking a 75 | combined work, a derivative of the original library. The ordinary 76 | General Public License therefore permits such linking only if the 77 | entire combination fits its criteria of freedom. The Lesser General 78 | Public License permits more lax criteria for linking other code with 79 | the library. 80 | 81 | We call this license the "Lesser" General Public License because it 82 | does Less to protect the user's freedom than the ordinary General 83 | Public License. It also provides other free software developers Less 84 | of an advantage over competing non-free programs. These disadvantages 85 | are the reason we use the ordinary General Public License for many 86 | libraries. However, the Lesser license provides advantages in certain 87 | special circumstances. 88 | 89 | For example, on rare occasions, there may be a special need to 90 | encourage the widest possible use of a certain library, so that it becomes 91 | a de-facto standard. To achieve this, non-free programs must be 92 | allowed to use the library. A more frequent case is that a free 93 | library does the same job as widely used non-free libraries. In this 94 | case, there is little to gain by limiting the free library to free 95 | software only, so we use the Lesser General Public License. 96 | 97 | In other cases, permission to use a particular library in non-free 98 | programs enables a greater number of people to use a large body of 99 | free software. For example, permission to use the GNU C Library in 100 | non-free programs enables many more people to use the whole GNU 101 | operating system, as well as its variant, the GNU/Linux operating 102 | system. 103 | 104 | Although the Lesser General Public License is Less protective of the 105 | users' freedom, it does ensure that the user of a program that is 106 | linked with the Library has the freedom and the wherewithal to run 107 | that program using a modified version of the Library. 108 | 109 | The precise terms and conditions for copying, distribution and 110 | modification follow. Pay close attention to the difference between a 111 | "work based on the library" and a "work that uses the library". The 112 | former contains code derived from the library, whereas the latter must 113 | be combined with the library in order to run. 114 | 115 | GNU LESSER GENERAL PUBLIC LICENSE 116 | TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 117 | 118 | 0. This License Agreement applies to any software library or other 119 | program which contains a notice placed by the copyright holder or 120 | other authorized party saying it may be distributed under the terms of 121 | this Lesser General Public License (also called "this License"). 122 | Each licensee is addressed as "you". 123 | 124 | A "library" means a collection of software functions and/or data 125 | prepared so as to be conveniently linked with application programs 126 | (which use some of those functions and data) to form executables. 127 | 128 | The "Library", below, refers to any such software library or work 129 | which has been distributed under these terms. A "work based on the 130 | Library" means either the Library or any derivative work under 131 | copyright law: that is to say, a work containing the Library or a 132 | portion of it, either verbatim or with modifications and/or translated 133 | straightforwardly into another language. (Hereinafter, translation is 134 | included without limitation in the term "modification".) 135 | 136 | "Source code" for a work means the preferred form of the work for 137 | making modifications to it. For a library, complete source code means 138 | all the source code for all modules it contains, plus any associated 139 | interface definition files, plus the scripts used to control compilation 140 | and installation of the library. 141 | 142 | Activities other than copying, distribution and modification are not 143 | covered by this License; they are outside its scope. The act of 144 | running a program using the Library is not restricted, and output from 145 | such a program is covered only if its contents constitute a work based 146 | on the Library (independent of the use of the Library in a tool for 147 | writing it). Whether that is true depends on what the Library does 148 | and what the program that uses the Library does. 149 | 150 | 1. You may copy and distribute verbatim copies of the Library's 151 | complete source code as you receive it, in any medium, provided that 152 | you conspicuously and appropriately publish on each copy an 153 | appropriate copyright notice and disclaimer of warranty; keep intact 154 | all the notices that refer to this License and to the absence of any 155 | warranty; and distribute a copy of this License along with the 156 | Library. 157 | 158 | You may charge a fee for the physical act of transferring a copy, 159 | and you may at your option offer warranty protection in exchange for a 160 | fee. 161 | 162 | 2. You may modify your copy or copies of the Library or any portion 163 | of it, thus forming a work based on the Library, and copy and 164 | distribute such modifications or work under the terms of Section 1 165 | above, provided that you also meet all of these conditions: 166 | 167 | a) The modified work must itself be a software library. 168 | 169 | b) You must cause the files modified to carry prominent notices 170 | stating that you changed the files and the date of any change. 171 | 172 | c) You must cause the whole of the work to be licensed at no 173 | charge to all third parties under the terms of this License. 174 | 175 | d) If a facility in the modified Library refers to a function or a 176 | table of data to be supplied by an application program that uses 177 | the facility, other than as an argument passed when the facility 178 | is invoked, then you must make a good faith effort to ensure that, 179 | in the event an application does not supply such function or 180 | table, the facility still operates, and performs whatever part of 181 | its purpose remains meaningful. 182 | 183 | (For example, a function in a library to compute square roots has 184 | a purpose that is entirely well-defined independent of the 185 | application. Therefore, Subsection 2d requires that any 186 | application-supplied function or table used by this function must 187 | be optional: if the application does not supply it, the square 188 | root function must still compute square roots.) 189 | 190 | These requirements apply to the modified work as a whole. If 191 | identifiable sections of that work are not derived from the Library, 192 | and can be reasonably considered independent and separate works in 193 | themselves, then this License, and its terms, do not apply to those 194 | sections when you distribute them as separate works. But when you 195 | distribute the same sections as part of a whole which is a work based 196 | on the Library, the distribution of the whole must be on the terms of 197 | this License, whose permissions for other licensees extend to the 198 | entire whole, and thus to each and every part regardless of who wrote 199 | it. 200 | 201 | Thus, it is not the intent of this section to claim rights or contest 202 | your rights to work written entirely by you; rather, the intent is to 203 | exercise the right to control the distribution of derivative or 204 | collective works based on the Library. 205 | 206 | In addition, mere aggregation of another work not based on the Library 207 | with the Library (or with a work based on the Library) on a volume of 208 | a storage or distribution medium does not bring the other work under 209 | the scope of this License. 210 | 211 | 3. You may opt to apply the terms of the ordinary GNU General Public 212 | License instead of this License to a given copy of the Library. To do 213 | this, you must alter all the notices that refer to this License, so 214 | that they refer to the ordinary GNU General Public License, version 2, 215 | instead of to this License. (If a newer version than version 2 of the 216 | ordinary GNU General Public License has appeared, then you can specify 217 | that version instead if you wish.) Do not make any other change in 218 | these notices. 219 | 220 | Once this change is made in a given copy, it is irreversible for 221 | that copy, so the ordinary GNU General Public License applies to all 222 | subsequent copies and derivative works made from that copy. 223 | 224 | This option is useful when you wish to copy part of the code of 225 | the Library into a program that is not a library. 226 | 227 | 4. You may copy and distribute the Library (or a portion or 228 | derivative of it, under Section 2) in object code or executable form 229 | under the terms of Sections 1 and 2 above provided that you accompany 230 | it with the complete corresponding machine-readable source code, which 231 | must be distributed under the terms of Sections 1 and 2 above on a 232 | medium customarily used for software interchange. 233 | 234 | If distribution of object code is made by offering access to copy 235 | from a designated place, then offering equivalent access to copy the 236 | source code from the same place satisfies the requirement to 237 | distribute the source code, even though third parties are not 238 | compelled to copy the source along with the object code. 239 | 240 | 5. A program that contains no derivative of any portion of the 241 | Library, but is designed to work with the Library by being compiled or 242 | linked with it, is called a "work that uses the Library". Such a 243 | work, in isolation, is not a derivative work of the Library, and 244 | therefore falls outside the scope of this License. 245 | 246 | However, linking a "work that uses the Library" with the Library 247 | creates an executable that is a derivative of the Library (because it 248 | contains portions of the Library), rather than a "work that uses the 249 | library". The executable is therefore covered by this License. 250 | Section 6 states terms for distribution of such executables. 251 | 252 | When a "work that uses the Library" uses material from a header file 253 | that is part of the Library, the object code for the work may be a 254 | derivative work of the Library even though the source code is not. 255 | Whether this is true is especially significant if the work can be 256 | linked without the Library, or if the work is itself a library. The 257 | threshold for this to be true is not precisely defined by law. 258 | 259 | If such an object file uses only numerical parameters, data 260 | structure layouts and accessors, and small macros and small inline 261 | functions (ten lines or less in length), then the use of the object 262 | file is unrestricted, regardless of whether it is legally a derivative 263 | work. (Executables containing this object code plus portions of the 264 | Library will still fall under Section 6.) 265 | 266 | Otherwise, if the work is a derivative of the Library, you may 267 | distribute the object code for the work under the terms of Section 6. 268 | Any executables containing that work also fall under Section 6, 269 | whether or not they are linked directly with the Library itself. 270 | 271 | 6. As an exception to the Sections above, you may also combine or 272 | link a "work that uses the Library" with the Library to produce a 273 | work containing portions of the Library, and distribute that work 274 | under terms of your choice, provided that the terms permit 275 | modification of the work for the customer's own use and reverse 276 | engineering for debugging such modifications. 277 | 278 | You must give prominent notice with each copy of the work that the 279 | Library is used in it and that the Library and its use are covered by 280 | this License. You must supply a copy of this License. If the work 281 | during execution displays copyright notices, you must include the 282 | copyright notice for the Library among them, as well as a reference 283 | directing the user to the copy of this License. Also, you must do one 284 | of these things: 285 | 286 | a) Accompany the work with the complete corresponding 287 | machine-readable source code for the Library including whatever 288 | changes were used in the work (which must be distributed under 289 | Sections 1 and 2 above); and, if the work is an executable linked 290 | with the Library, with the complete machine-readable "work that 291 | uses the Library", as object code and/or source code, so that the 292 | user can modify the Library and then relink to produce a modified 293 | executable containing the modified Library. (It is understood 294 | that the user who changes the contents of definitions files in the 295 | Library will not necessarily be able to recompile the application 296 | to use the modified definitions.) 297 | 298 | b) Use a suitable shared library mechanism for linking with the 299 | Library. A suitable mechanism is one that (1) uses at run time a 300 | copy of the library already present on the user's computer system, 301 | rather than copying library functions into the executable, and (2) 302 | will operate properly with a modified version of the library, if 303 | the user installs one, as long as the modified version is 304 | interface-compatible with the version that the work was made with. 305 | 306 | c) Accompany the work with a written offer, valid for at 307 | least three years, to give the same user the materials 308 | specified in Subsection 6a, above, for a charge no more 309 | than the cost of performing this distribution. 310 | 311 | d) If distribution of the work is made by offering access to copy 312 | from a designated place, offer equivalent access to copy the above 313 | specified materials from the same place. 314 | 315 | e) Verify that the user has already received a copy of these 316 | materials or that you have already sent this user a copy. 317 | 318 | For an executable, the required form of the "work that uses the 319 | Library" must include any data and utility programs needed for 320 | reproducing the executable from it. However, as a special exception, 321 | the materials to be distributed need not include anything that is 322 | normally distributed (in either source or binary form) with the major 323 | components (compiler, kernel, and so on) of the operating system on 324 | which the executable runs, unless that component itself accompanies 325 | the executable. 326 | 327 | It may happen that this requirement contradicts the license 328 | restrictions of other proprietary libraries that do not normally 329 | accompany the operating system. Such a contradiction means you cannot 330 | use both them and the Library together in an executable that you 331 | distribute. 332 | 333 | 7. You may place library facilities that are a work based on the 334 | Library side-by-side in a single library together with other library 335 | facilities not covered by this License, and distribute such a combined 336 | library, provided that the separate distribution of the work based on 337 | the Library and of the other library facilities is otherwise 338 | permitted, and provided that you do these two things: 339 | 340 | a) Accompany the combined library with a copy of the same work 341 | based on the Library, uncombined with any other library 342 | facilities. This must be distributed under the terms of the 343 | Sections above. 344 | 345 | b) Give prominent notice with the combined library of the fact 346 | that part of it is a work based on the Library, and explaining 347 | where to find the accompanying uncombined form of the same work. 348 | 349 | 8. You may not copy, modify, sublicense, link with, or distribute 350 | the Library except as expressly provided under this License. Any 351 | attempt otherwise to copy, modify, sublicense, link with, or 352 | distribute the Library is void, and will automatically terminate your 353 | rights under this License. However, parties who have received copies, 354 | or rights, from you under this License will not have their licenses 355 | terminated so long as such parties remain in full compliance. 356 | 357 | 9. You are not required to accept this License, since you have not 358 | signed it. However, nothing else grants you permission to modify or 359 | distribute the Library or its derivative works. These actions are 360 | prohibited by law if you do not accept this License. Therefore, by 361 | modifying or distributing the Library (or any work based on the 362 | Library), you indicate your acceptance of this License to do so, and 363 | all its terms and conditions for copying, distributing or modifying 364 | the Library or works based on it. 365 | 366 | 10. Each time you redistribute the Library (or any work based on the 367 | Library), the recipient automatically receives a license from the 368 | original licensor to copy, distribute, link with or modify the Library 369 | subject to these terms and conditions. You may not impose any further 370 | restrictions on the recipients' exercise of the rights granted herein. 371 | You are not responsible for enforcing compliance by third parties with 372 | this License. 373 | 374 | 11. If, as a consequence of a court judgment or allegation of patent 375 | infringement or for any other reason (not limited to patent issues), 376 | conditions are imposed on you (whether by court order, agreement or 377 | otherwise) that contradict the conditions of this License, they do not 378 | excuse you from the conditions of this License. If you cannot 379 | distribute so as to satisfy simultaneously your obligations under this 380 | License and any other pertinent obligations, then as a consequence you 381 | may not distribute the Library at all. For example, if a patent 382 | license would not permit royalty-free redistribution of the Library by 383 | all those who receive copies directly or indirectly through you, then 384 | the only way you could satisfy both it and this License would be to 385 | refrain entirely from distribution of the Library. 386 | 387 | If any portion of this section is held invalid or unenforceable under any 388 | particular circumstance, the balance of the section is intended to apply, 389 | and the section as a whole is intended to apply in other circumstances. 390 | 391 | It is not the purpose of this section to induce you to infringe any 392 | patents or other property right claims or to contest validity of any 393 | such claims; this section has the sole purpose of protecting the 394 | integrity of the free software distribution system which is 395 | implemented by public license practices. Many people have made 396 | generous contributions to the wide range of software distributed 397 | through that system in reliance on consistent application of that 398 | system; it is up to the author/donor to decide if he or she is willing 399 | to distribute software through any other system and a licensee cannot 400 | impose that choice. 401 | 402 | This section is intended to make thoroughly clear what is believed to 403 | be a consequence of the rest of this License. 404 | 405 | 12. If the distribution and/or use of the Library is restricted in 406 | certain countries either by patents or by copyrighted interfaces, the 407 | original copyright holder who places the Library under this License may add 408 | an explicit geographical distribution limitation excluding those countries, 409 | so that distribution is permitted only in or among countries not thus 410 | excluded. In such case, this License incorporates the limitation as if 411 | written in the body of this License. 412 | 413 | 13. The Free Software Foundation may publish revised and/or new 414 | versions of the Lesser General Public License from time to time. 415 | Such new versions will be similar in spirit to the present version, 416 | but may differ in detail to address new problems or concerns. 417 | 418 | Each version is given a distinguishing version number. If the Library 419 | specifies a version number of this License which applies to it and 420 | "any later version", you have the option of following the terms and 421 | conditions either of that version or of any later version published by 422 | the Free Software Foundation. If the Library does not specify a 423 | license version number, you may choose any version ever published by 424 | the Free Software Foundation. 425 | 426 | 14. If you wish to incorporate parts of the Library into other free 427 | programs whose distribution conditions are incompatible with these, 428 | write to the author to ask for permission. For software which is 429 | copyrighted by the Free Software Foundation, write to the Free 430 | Software Foundation; we sometimes make exceptions for this. Our 431 | decision will be guided by the two goals of preserving the free status 432 | of all derivatives of our free software and of promoting the sharing 433 | and reuse of software generally. 434 | 435 | NO WARRANTY 436 | 437 | 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO 438 | WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. 439 | EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR 440 | OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY 441 | KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE 442 | IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 443 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE 444 | LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME 445 | THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 446 | 447 | 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN 448 | WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY 449 | AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU 450 | FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR 451 | CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE 452 | LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING 453 | RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A 454 | FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF 455 | SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH 456 | DAMAGES. 457 | 458 | END OF TERMS AND CONDITIONS 459 | 460 | How to Apply These Terms to Your New Libraries 461 | 462 | If you develop a new library, and you want it to be of the greatest 463 | possible use to the public, we recommend making it free software that 464 | everyone can redistribute and change. You can do so by permitting 465 | redistribution under these terms (or, alternatively, under the terms of the 466 | ordinary General Public License). 467 | 468 | To apply these terms, attach the following notices to the library. It is 469 | safest to attach them to the start of each source file to most effectively 470 | convey the exclusion of warranty; and each file should have at least the 471 | "copyright" line and a pointer to where the full notice is found. 472 | 473 | 474 | Copyright (C) 475 | 476 | This library is free software; you can redistribute it and/or 477 | modify it under the terms of the GNU Lesser General Public 478 | License as published by the Free Software Foundation; either 479 | version 2.1 of the License, or (at your option) any later version. 480 | 481 | This library is distributed in the hope that it will be useful, 482 | but WITHOUT ANY WARRANTY; without even the implied warranty of 483 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 484 | Lesser General Public License for more details. 485 | 486 | You should have received a copy of the GNU Lesser General Public 487 | License along with this library; if not, write to the Free Software 488 | Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 489 | 490 | Also add information on how to contact you by electronic and paper mail. 491 | 492 | You should also get your employer (if you work as a programmer) or your 493 | school, if any, to sign a "copyright disclaimer" for the library, if 494 | necessary. Here is a sample; alter the names: 495 | 496 | Yoyodyne, Inc., hereby disclaims all copyright interest in the 497 | library `Frob' (a library for tweaking knobs) written by James Random Hacker. 498 | 499 | , 1 April 1990 500 | Ty Coon, President of Vice 501 | 502 | That's all there is to it! 503 | 504 | 505 | --------------------------------------------------------------------------------