> - Original Message -
> From: "Andrew Makhorin"
> To: "Nigel Galloway"
> Subject: Re: [Bug-glpk] Variables defined more than once
> Date: Thu, 7 Dec 2006 19:42:36 +0300
>
>
> > Perhaps not a bug, but the following constatnts are define
easily. If you need any help there fine, if you use Windows
let me know how it goes.
Regards,
Nigel Galloway
> - Original Message -
> From: "Andrzej Urbanowicz" <[EMAIL PROTECTED]>
> To: help-glpk@gnu.org
> Subject: [Help-glpk] XML Result Output from glpsol
in0511I After Postsolve, objective 0, infeasibilities - dual 0 (0), primal 0
(0)
Clp0006I 0 Obj 0
Clp0006I 0 Obj 0
ClpI Optimal - objective value 0
Solving took (seconds): 0.02
Writing output file: gplk_test.xml_out.xml
which I won't reproduce as it's the same.
Regards,
Nigel Gal
There are several number problems which rely on certain blocks of
cells on a board having one, or more, of the following properties:
➢they sum to a certain value;
➢each cell is unique within the block;
➢the sum of one block equals the sum of the other;
➢the sum of one block is less than the sum o
I have put the document at:
http://www.geocities.com/nigel_galloway/KuKu.Examples.pdf
Regards,
Nigel Galloway
- Original Message -
From: "Andrew Makhorin" <[EMAIL PROTECTED]>
To: "Nigel Galloway" <[EMAIL PROTECTED]>
Subject: Re: [Help-glpk] Kakuro, Fut
SWIG is a software development tool that simplifies the task of interfacing
different languages to C and C++ programs. In a nutshell, SWIG is a compiler
that takes C
declarations and creates the wrappers needed to access those declarations from
other languages including including Perl, Python, T
Entering the following search into Google produced 77 results.
filetype:mod mathprog
> - Original Message -
> From: [EMAIL PROTECTED]
> To: help-glpk@gnu.org
> Subject: [Help-glpk] Andrew - Please help me find MathProg for use with GLPK
> Date: Tue, 29 May 2007 15:12:40 -0500
>
>
>
NigelzGLPK.swg is the file in the pdf document in the section "The SWIG
Interface File". I've attached a copy.
Also I've attached a bug report I made to make it work. You will probably need
to make the same change.
Good Luck
Nigel Galloway
> - Original Message -
You might find these posts interesting. I've compiled Java interfaces
upto 4.20 with no problem.
1. [Help-glpk] Re: GLPK and Java using SWIG (score: 36)
Date: Fri, 1 Jun 2007 11:46:00 +0100
NigelzGLPK.swg is the file in the pdf document in the section "The
SWIG Interface File".
The attached file finds the best fit (least squares wise) for the data in the
examples cf12a and cf12b, because I think it looks rather neat expressed in
mathprog.
I am happy for it to be released under GPL if you want another the curve
fitting example.
--
__
Alex,
I have no objection and hope that many people find it useful.
The file rglpk.c that you have included is in fact generated against a
particular version of GLPK and perhaps you should record which. Obviously SWIG
can be used to generate a new rglpk.c against a later version when needed, an
Consider the following mathprog:
param a ,integer;
param b ,integer;
var x integer;
var y integer;
st1: a*x + b*y >= 1;
minimize m: a*x + b*y;
solve;
end;
This has only 2 unknowns, Euclid demonstrated that there is always feasible set
for any combination of a and b. When the feasible set incl
The attached C# program uses GLPK to find the least positve linear combination
of any 2 positive integers, see below for an example output using 2424 and 772.
If you want an example of using C# with GLPK you may add this to GLPK's
examples. C# was developed, in part, to make interworking with le
Having looked at a problem with two columns that glpk finds
difficult here is one with over a million that it solves
suprisingly well.
To set e to 21 should be possible with 4GB memory. Interesting to
see if a 64-bit OS is required. 22 or more will probably need a
professional computer.
Bench
If you require security better not to use MySQL. Use a dtatabase where the
access rights are based on the operating systems user accounts. If you supply
the password on the command line it is available system wide to any user who
types in 'ps' on unix a utility which lists all running commands,
You may find the following examples interesting.
A 'small' problem with two variables:
http://lists.gnu.org/archive/html/help-glpk/2008-02/msg00052.html
A large problem:
http://lists.gnu.org/archive/html/help-glpk/2008-03/msg00056.html
- Original Message -
From: "RC Loh"
To: "Ali
True, I could use some method to determine smallest multiple of
the largest common divisor, say Euclids Algorithm, but that is
rather what I want GLPK to do.
Note that if I want to do that then I just need to replace
a*x + b*y >= 1; with a*x + b*y = the gcd; The minimize is
then optional, and
I know I can probably produce a better analysis of the uniformity of glpk's
random number generator with a sample size smaller than 1.75 million integers,
but what would be the point of that?
More interestingly is why does mathprog require a 1000 bytes per integer?
/*Arithmetic Mean of a large
Attached is an earlier posting. The example is in glpk's examples directory,
called t1.cs, it could probably be better named in future releases
- Original Message -
From: "Nigel Galloway" <[EMAIL PROTECTED]>
To: help-glpk@gnu.org
Subject: [Help-glpk] C#, GLPK
The attached file glpk_vfs.rb demonstrates using a Virtual File System to
produce input files for GLPK without the files being physically present on
disk. This approach has been used for frontending SQL databases and obtaing
data from the internet. Of course at the moment I'm more interested in
ee me to the end of
the month.
Thanks again,
Nigel
> - Original Message -
> From: "Andrew Makhorin" <[EMAIL PROTECTED]>
> To: "Nigel Galloway" <[EMAIL PROTECTED]>
> Subject: Re: [Help-glpk] Maximum number of integer variables -- is 1.75
>
for this unannounced list as I am probably quite
interested in reading it.
Thanks,
Nigel
> - Original Message -
> From: "Andrew Makhorin" <[EMAIL PROTECTED]>
> To: "Nigel Galloway" <[EMAIL PROTECTED]>
> Subject: Re: [Help-glpk] Using glp
Or you could use a Virtual File System, see previous postings. Trust me once
you've used one with a legacy system like glpk you won't know how you did
without it. You can use any scripting language, or C, to pull together data
from disk, database, website, or make it up to create any mathprog o
I think the example uses only .NET 1.0 features so should work with
Visual Studio 2003. Generics were clearly sponsored by the manufacturers
of Asprin and Paracetamol, but Iterators are useful so you should catch
up a bit anyway.
The example was developed under Linux. The .so file is the Linux
equ
Or join the 21st. century and use XPS. This is the native print form (replacing
Enhanced Metafile Format ) for Windows Vista (and XP with the service update).
XPS is produced simply by selecting the virtual printer on the print form. It
is a zipped archive of pages with formatting information in
Using Fedora 9 the TeX can be converted into a searchable pdf using texi2pdf
once.
I tried xdvi which used to be the way to read dvi files only to find some
pseudo-modernist has stolen it. It has been replaced by evince, which displays
the dvi file and can save it as a pdf.
> - Original M
be device independant but actually is very dependant on the fonts
installed on the X-server
> - Original Message -
> From: "Andrew Makhorin" <[EMAIL PROTECTED]>
> To: "Nigel Galloway" <[EMAIL PROTECTED]>
> Cc: help-glpk@gnu.org, "Robbie
Interestingly God's plan for man to arrange his time revealed through the head
of his church on earth Gregory is such that it repeats every 400 years. The
100s not being a leap year unless they are a 400. This being the revealed word
of God, spoken by Gregory, I would consider it blasphomous to
compiled against the .Lib file, which will be a lot smaller
than 800K. and a .dll file which is the shared library for Windows which
is needed for .Net applications.
- Original Message -
From: "bo liu"
To: "Nigel Galloway"
Subject: Re: Hello,Nigel, I have some
}
This code was not exercised in 4.32 (compiled without db support).
> - Original Message -
> From: "glpk xypron" <[EMAIL PROTECTED]>
> To: "Nigel Galloway" <[EMAIL PROTECTED]>, [EMAIL PROTECTED]
> Cc: Help-glpk@gnu.org
> Subject: Re:
25 * 1 + 20
25 = 20 * 1 + 5
20 = 5 * 4 + 0
therefore the answer is 5.
So we beat the Theorem of Division by two steps, and not an alpha in sight. I
look forward to reviewing a general solution using Parametric Analysis (by
Christmas?).
> - Original Message -
> From: "
The example t1.cs was posted in February see:
http://lists.gnu.org/archive/html/help-glpk/2008-02/msg00065.html
when the call to glp_delete_prob in the destrutor worked fine. Maybe glpk has
changed since 4.23 so that it is no longer needed, if you are confident that
glpk always deletes it now.
Thank you for this new feature. Is it documented?
I have tried it. Is it possible to spread a table over 2 data files, obviously
with different tuple ID's.
If not can the feature be extended to do this?
--
___
Surf the Web in a faster, safer and easi
I can't agree with either position here. The concept of well ordered sets is
fundamental to arithmatic. examples/t1.cs depends on the mathmatical proof that
any subset (however complex the derivation) of a well ordered set is a well
ordered set. There is a proof that the square root of two must
Andrew,
Yet Another (and the best!) Curve Fitting Solution:
YACFS.mod produces the same result as examples/cflsq.mod;
Qfit.mod find a plausable fit of the form a + bx + bx^2
It reduces the size of the triangular part from 38 to 1 which I
assume is good;
It is independant of the sample siz
Swig can read any file and action can be taken to overcome all(?) problems.
However apart from the multiple defines, now resolved, in glpk_4.35 'in' and
'out' are used as names, which they were not before. Note that 'in' and 'out'
are reserved words in C#. Swig is able to work around this but in
I have placed an example at http://www.geocities.com/nigel_galloway/t1.zip:
t1 - compiles an example of using C# with glpk and swig.
1. Obtain the source release of glpk_4.35. Compile using
w32\Build_GLPK_with_VC9_DLL.bat.
2. Decompress t1.zip.
3. Open t1\t1.sln with Visual Studio 2008.
Using glpk.i with the addition of %remove (or something similar) to
overcome the 'in out' problem.
nigelzGLPK.dll is the dll produced by compiling the c wrapper.
glpkSWIG.dll is the equivalent of the jar file produced by the java swig.
Obviously using csc to compile the cs files where presumably
The files described below can be found at:
www.geocities.com/nigel_galloway/IAJAAR.zip
1)iajaar.h is intended for use when wrapping GLPK with SWIG. A suggested
swig input file is something like:
%module nigelzGLPK
%{
#include "iajaar.h"
#include "glpk.h"
%}
%include
Attached is sample.py which impliments the example from glpk.pdf in Python
using Swig's array functions, running it produces:
ni...@darkstar:~/myGLPK$ python sample.py
* 0: obj = 0.0e+00 infeas = 0.000e+00 (0)
* 2: obj = 7.3e+02 infeas = 0.000e+00 (0)
OPTIMAL SOLUT
Xyperon,
Do you intend to release Python bindings 4 windows?
___
Help-glpk mailing list
Help-glpk@gnu.org
http://lists.gnu.org/mailman/listinfo/help-glpk
Is this a bug I see before me, or the mere manifestation of a new feature?
Running a variation on my favorite mathprog:
param a, integer;
param b, integer;
param guess, integer;
var x, integer;
var y, integer;
s1: 1 <= a*x+b*y <= guess;
solve;
printf "x= %i y= %i a*x+b*y= %i\n",x,y,a*x+b*y;
I decided to try netBeans Early Access release of their Python IDE, using of
course IAJAAR for the test. If you want to use IAJAAR with Python 3.0.1 using
netBeans on Windows the following URL contains binaries of everything you need,
and an example project.
http://www.geocities.com/nigel_gall
glpk examples/t1.cs is an example of using .NET. In C# but very similar in
VB2008, if you believe what it says on the packet.
Can I use some GLPK functionality from .NET apps? Is there any API?
Tx!
--
Aleksandar Pesic
MS, MCAD
Software Architect
_
Look at qfit.mod in the glpk examples.
When you have your table called Sample with i,j,and x defined
set Sample;
param i {z in Sample};
param j {z in Sample};
param x {z in Sample};
then somthing like:
test{z in Sample}: varcost[i[z],j[z]] * x[i[z],j[z]] >= 0;
> - Original Message -
You might find this helpful:
http://www.netmba.com/operations/project/time-cost/
Which leads to:
Normal-Time to produce a model 6-weeks;
Crash-Time to produce a model 3-weeks;
Client's expectation 2-days.
> - Original Message -
> From: "Andrew Makhorin"
> To: "Michael Hennebry"
Code is re-enterant if it may be executed by itself, or by another routine, by
interupting the present execution.
The 'by itself' bit is usually known as recursion. Code applying a lock and
then calling itself is usually fatal.
The lock is really used to stop another routine executing a non-re
Congratulations with glpk, A thouroughly deserved position. Even though the
paper omitted 2 of glpk's best features:
1) It's implementation of AMPL realized in Mathprog.
2) This feture is included at no extra cost.
Again, well done - keep up the good work,
Nigel Galloway
> -
> - Original Message -
You may find that it helps to seperate finding the best fit from finding the
points which define the line. When I was looking at this earlier in the year I
came up with yacfs.mod (see glpk examples). BigMing that produces good results
for test data which actually rep
The example has no error checking. Most likely is: it does not check the
command line parameters you are supplying. You are supplying two positive
integers, say 35 and 7? Ahh, you are not supplying any parameters. I hope
the problem is a simple as that. Regards, Nigel Galloway
- Original
to an option you are passing to the compiler, and not the particular make
tool. Cygwin is far too complicated and your code will have dependencies.
Any timings may depend on how you've built Cygwin. Good Luck, Nigel
- Original Message -
From: "Luiz M. M. Bettoni"
To: &quo
It is not necessary to rely on glpk for all your printing needs. You
could pipe the output through gawk. Linux and DOS both provide sort
utilities.
- Original Message -
From: "Jeffrey Kantor"
To: xypron
Cc: Help-glpk@gnu.org
Subject: Re: [Help-glpk] Mathprog question
Date: Sat,
When your model is quick to execute then this would be a convinience. If your
model takes several mins to run and you decide a different format is required
for your graph to be clear then it could be annoying having to run the model
again. Saving your result and pasting them into an Excel sprea
Or (more sensibly?) XML can be converted to formatted text for those who
require it.
The following may be interesting(Displaying Linear Programs and Their Solutions
With XML and SVG):
http://portal.acm.org/citation.cfm?id=1082118
> - Original Message -
> From: "Robbie Morrison"
> To:
produce good results.
> - Original Message -
> From: "Robert Fourer" <4...@northwestern.edu>
> To: help-glpk@gnu.org
> Cc: "'Nigel Galloway'"
> Subject: RE: [Help-glpk] A new text-based data format for GLPK
> Date: Sun, 3 Jan 2010 1
No, but if youi pass it using a void pointer or name it a widely used reserved
word in Java; C++; or another language, then thats not too friendly.
> - Original Message -
> From: "Andrew Makhorin"
> To: "Yingjie Lan"
> Cc: help-glpk@gnu.org
> Subject: [Help-glpk] Re: API friendliness R
Xypron,
The glpk_java distribution provides a Java interface to most of the glpk API. I
think some improvements are needed to access glp_main and hence write glpsol in
Java.
Attched is glpsol.java, the comments indicate the changes needed to swig.i to
enable it to function.
If you are willing
I have submitted a plugin for glpk mathprog to jEdit called glpkIDEplugin.
jEdit is an IDE written in Java.
The inital release can be obtained from:
https://sourceforge.net/tracker/?func=detail&aid=2969336&group_id=588&atid=625093
It provides facilities to edit and run mathprog scripts. The mat
13.
>
> Best regards
>
> Xypron
>
> Nigel Galloway wrote:
> >
> > Xypron,
> >
> > The glpk_java distribution provides a Java interface to most of the glpk
> > API. I think some improvements are needed to access glp_main and hence
> >
lpk.h avaialble.
If you get it to work let me know and I'll include the instructions with the
above.
- Original Message -
From: "Jeffrey Kantor"
To: "Nigel Galloway"
Subject: Re: [Help-glpk] Cross Platform IDE for mathprog development.
Date: M
I might have mentioned the benefits of XML before. It has been helpfully
pointed out that a program may be written in grep to convert csv to XML.
Careful research has revealed that Excel can read csv and save it as XML.
How then to include the useful comments.
It would be possible to include th
I might have mentioned the benefits of XML before. You have helpfully pointed
out that a program can be written in grep to convert csv to XML. After careful
research I found that Excel can read csv and save it in XML.
How then may your useful comments be added?
One solution is to add the commen
The benefits (and drawbacks of SWIG) have been widely discussed. Using the swig
interface files discussed it is possible to produce wrappers for all glpk api
in R, and add a few usful features.
> - Original Message -
> From: "Eagle, Ken"
> To: "glpk xypron" , help-glpk@gnu.org
> Subjec
using a rich variety of modern tools to produce many formats including csv.
> - Original Message -
> From: Tor Myklebust
> To: Nigel Galloway
> Subject: Re: [Help-glpk] comments in csv data files
> Date: Mon, 17 May 2010 20:32:43 -0400 (EDT)
>
>
> On Mon, 17 M
tions.
> - Original Message -
> From: Chris Wolf
> To: help-glpk@gnu.org, Nigel Galloway
> Subject: Re: [Help-glpk] comments in csv data files
> Date: Mon, 17 May 2010 11:29:00 -0400
>
>
> As Andrew points out, there is not standard way to embed comments
> in the CSV
Also note that part of the reason d'etre of C# is that it is a .NET language
and does not require bindings to interface to C++, see t1.cs in the glpk
examples.
Also note that swig produces C# bindings to any version of glpk, if you want
them anyway.
> - Original Message -
> From: Noli
age -
> From: "Meketon, Marc"
> To: "Nigel Galloway"
> Cc: help-glpk@gnu.org, "Noli Sicad"
> Subject: RE: [Help-glpk] C# binding
> Date: Wed, 9 Jun 2010 10:06:59 -0400
>
>
> Thanks Nigel. I did not realize that t1.cs existed in the samples.
>
Last time this came up you rejected Excel due to having too much data for a
spreadsheet. I have since created an Excel spreadsheet with two 1.5 million
datasets and plotted them in various combinations and graph types. Changing the
graph took about 7.5 secs. It is essential to use keybord comma
ml
> says:
>
> Currently the following features are not implemented or broken:
> * Garbage collection of created objects
> * C Array wrappings
>
> Some sort of array wrapping is needed for using GLPK.
>
> Best regards
>
> Xypron
>
> Nigel Galloway wrote:
>
b)? I do the latter. I don't recall
> > ever noticing R's garbage collector.
> >
> > So don't use carrays. I use iajaar or sparse matrix from coin. See:
> > http://www.mail-archive.com/help-glpk@gnu.org/msg02581.html
> >
> > I always think that writin
Andrew,
Please do me a favour and look at glp_ios_del_row.
When I attempt to compile test.cpp the linker generates the following error:
Error: Unresolved external '_glp_ios_del_row' referenced from
C:\NIGEL\R\BUILD\TEST.OBJ
I think glp_ios_del_row is the only procedure I have a problem with.
*/
Thanks,
Nigel
> - Original Message -
> From: Andrew Makhorin
> To: Andrew Makhorin
> Cc: Nigel Galloway , bug-g...@gnu.org,
> help-glpk@gnu.org
> Subject: Re: [Help-glpk] glp_ios_del_row
> Date: Sat, 26 Jun 2010 05:15:56 +0400
>
>
> >> Please do me
You might find the following useful:
http://www.mail-archive.com/help-glpk@gnu.org/msg03346.html
> - Original Message -
> From: Wendel Alexandre Xavier de Melo
> To: help-glpk@gnu.org
> Subject: [Help-glpk] glpk bat script for mingw
> Date: Sun, 4 Jul 2010 01:04:39 -0300
>
>
> Hi peop
I am not saying that Euclid did a bad job, but The Division Theorem is very
old. It is time for a new one. In order to demonstrate wrapping GLPK for R
using SWIG and IAJAAR.H I present The Division Theorem as Euclid might have
done it had he known about GLPK.
The examples morph GLPK's examples
Have you compiled glpk using mingw?
When you do that successfully you will have two files glpk4_44.dll and
libglpk4_44.a
When you have these copy them both into the same directory as sample.c and use
-lglpk4_44
When this works move the dll and the archive to a safe_place and try
-Lsafe_place
I have added another fire to IAJAAR.H:
https://sourceforge.net/projects/iajaarh/files/IAJAAR.H_C-C%2B%2B.dev.20100806.7z/download
It expands the origional by including the library needed to compile the C++
example igst10yo.cpp. I also added sample.c to demonstrate using it with C and
could not
unless you would
> like to do this.
>
> http://en.wikibooks.org/wiki/GLPK
>
> just curious
> Robbie
>
> > ----
> > To: help-glpk@gnu.org
> > Subject: [Help-glpk] IAJAAR.H_C-C++.dev.7z
> > Fr
e -
> From: "Robbie Morrison"
> To: "GLPK help list"
> Cc: "Nigel Galloway"
> Subject: re: [Help-glpk] IAJAAR.H_C-C++.dev.7z
> Date: Mon, 16 Aug 2010 04:40:43 +1200 (NZST)
>
>
>
> Hello Nigel
>
> Unfortunately I could not open t
Any Visual Studio edition will have a Terminal (Command Line) application. If
you run the compile script from this application (or run this application with
the script as a parameter) it will set the environment variables suitable for
the sysytem, without the script calling vcvars or anything e
I would support using cmake because of it's cross platform capabilities. In
order to make GLPKIDE for jEdit buildfiles using Ant are required (I have some
if anyone wants them). Note that
http://code.google.com/p/cmakeant/
promises a tool that:
Provides a simple ant task to integrate cmake pr
A GLPK Visual Studio project can be built very easily. The only annoying bits
are:
1) that you have to remember to add glpk.h which has its own directory in the
distribution;
2) the source directory has two subdirectories 'colamd' and 'amd' which you
need to include.
If it still doesn't wo
There are three possibilities to compile GLPK using Visual Studio. GLPK
is designed as a library of routines which can be used in another program
to solve systems of linear inequalities. These programs written by you
produce the .exe. The glpk examples directory contains a number of such
programs.
Attached is a VS2010 project which will compile glpk as a dll. Simply
unzip it in the top of an unzipped glpk 4 45 source distribution. It will
create a subdirectory called glpk. Double click on the .sln in this
directory and VSC++2010 should start. Click build. The dll will appear in
glpk\glpk\Re
Perhaps, but to me OptimJ looks like a compiler. Would you object to non open
source compilers or debuggers which also have to link with GLPK?
> - Original Message -
> From: Andrew Makhorin
> To: maxcach...@gmail.com
> Cc: help-glpk@gnu.org
> Subject: [Help-glpk] Re: ANNOUNCEMENT: Optim
OptimJ does not link to glpk. To use glpk you download an examples set which
includes a directory 'OptimJ samples - GLPK Binaries' which contains a compiled
glpk 4.36 dll and a java jar file. The source to produce the java jar file is
included in 'OptimJ 1.3.10 samples - GLPK\OptimJ samples - G
Andrew,
Thanks for the link, CMPL is a useful addition to GLPK. Attached is
kenken903.gen and kenken.rules. If you wish to have an example of
using glpk with cmpl (which is difficult to do in mathprog) please
feel free to include them in the glpk examples.
The attached solve the following prob
Kevin,
You may wish to try building the bindings using SWIG, see:
http://lists.gnu.org/archive/html/help-glpk/2007-05/msg00076.html
and
http://lists.gnu.org/archive/html/help-glpk/2009-03/msg00023.html
SWIG is well documented and included with most recent linux distributions. It
is the techno
Attached are the rules and data for Sudoku 25x25. You are free to use them, and
the KenKen example, in your manual.
> - Original Message -
> From: "Prof. Dr. Mike Steglich"
> To: Nigel Galloway
> Cc: Andrew Makhorin , Thomas Schleiff
> Subject: Re: [Help-glpk
The joy continues. Is there anything one can not do with CMPL and GLPK.
We must get from 1 to 42 passing through the fixed cells in sequence.
-1 indicates that the cell is not used:
x, x,11,12,42, x, x
8, 6, x, x,16,17, x
7, x, x,-1, x, x,38
3, x,-1,-1,-1, x,20
x, 1,-1,-1,-1, x,36
28,26, x,
Who so beset me round with dismal stories.
The Python and Java examples described below can be compiled using the swig
input file:
http://master.dl.sourceforge.net/project/iajaarh/Callback_examples/IAJAAR_H.swg.xps
test.py
http://master.dl.sourceforge.net/project/iajaarh/Callback_examples/test
art:
http://p2p.wrox.com/javascript/17313-how-call-dll-method-javascritp-urgent.html
My executive summary would be: don't.
--
Nigel Galloway
nigel_gallo...@operamail.com
On Tue, 22 Mar 2011 09:09 +1100, "Noli Sicad" wrote:
> Hi Xypron,
>
> This project might n
, and
display the result page.
Good Luck,
--
Nigel Galloway
nigel_gallo...@operamail.com
On Mon, 28 Mar 2011 12:06 +1100, "Noli Sicad" wrote:
> > If one wants to do something looking for a tool is OK, but better is to
> > understand what you want to do. The following dysle
xport all the
functionallity of IAJAAR to JavaScript, then possibly write something
like:
http://master.dl.sourceforge.net/project/iajaarh/Callback_examples/test.py.xps
in JavaScript.
--
Nigel Galloway
nigel_gallo...@operamail.com
On Wed, 30 Mar 2011 06:04 +1100, "Noli Sicad" w
study.
--
Nigel Galloway
nigel_gallo...@operamail.com
--
http://www.fastmail.fm - Send your email first class
___
Help-glpk mailing list
Help-glpk@gnu.org
http://lists.gnu.org/mailman/listinfo/help-glpk
so.
Perhaps in this railway case you could be modern and politcally
correct by factoring in an environmental cost and selecting the
route with the lowest carbon footprint.
--
Nigel Galloway
[1]nigel_gallo...@operamail.com
On Tue, 12 Apr 2011 14:49 -0500, "Meketon, Marc"
wrote:
S
COIN, the Sparse
Matrix class is seperate code which compiles and functions
independantlly of COIN.
--
Nigel Galloway
[1]nigel_gallo...@operamail.com
On Fri, 22 Apr 2011 19:49 +0200, "Pierre Parent"
wrote:
Thank you for answering.
I do agree that we could think of a lot of ways to
See t1.cs in the examples directory
--
Nigel Galloway
[1]nigel_gallo...@operamail.com
On Mon, 25 Apr 2011 07:33 -0400, "Kelly, Jeff (ON0F)"
wrote:
All;
I am wondering if anybody calls GLPK
iteratively/successively/recursively to solve nonlinear problems
similar to a sequent
a way to provide the
rules.
--
Nigel Galloway
[1]nigel_gallo...@operamail.com
On Tue, 26 Apr 2011 09:42 -0400, "Kelly, Jeff (ON0F)"
wrote:
Nigel – thanks.
Is there anyway to save the basis so that from major iteration to
major iteration it can use a “warm-start” when solving with t
ution.
--
Nigel Galloway
nigel_gallo...@operamail.com
--
http://www.fastmail.fm - Faster than the air-speed velocity of an
unladen european swallow
___
Help-glpk mailing list
Help-glpk@gnu.org
https://lists.gnu.org/ma
utput
to the console.
Let x and the bit-bucket have the sleepless nights worrying about
inequality monsters hiding under the bed.
--
Nigel Galloway
nigel_gallo...@operamail.com
On Thu, 12 May 2011 17:04 +0400, "Andrew Makhorin" wrote:
> Forwarded Message
> Fro
1 - 100 of 161 matches
Mail list logo
