I see two fields of applications for threading in GLPK.
ILOG describes that many MIPs can be solved = 1.7 times
faster using multiple threads and shared memory.
http://www.ilog.com/optimization/the-right-hand-side/1/TA_Parallel_CPLEX_Dong.html
)
INTEGER OPTIMAL SOLUTION FOUND
Time used: 0.1 secs
Memory used: 1.3 Mb (1410167 bytes)
Andrew Makhorin
___
Help-glpk mailing list
Help-glpk@gnu.org
http://lists.gnu.org/mailman/listinfo/help-glpk
Hi i'm trying to solve a binary problem using glpk and i got this:
http://www.nabble.com/file/p24439157/glpk.jpg
i don't undestand why i'm getting that error. Can somebody help me please?
LP relaxation of your model is primal infeasible. Try to check
constraints and model data.
Is it possible to use GLPK so solve a minimization problem with INTEGER
variables, using the Lagrangian Relaxation!?
Yes, it is. However, this feature is not implemented in glpk.
___
Help-glpk mailing list
Help-glpk@gnu.org
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
GLPK 4.39 -- Release Information
Release date: Jul 26, 2009
GLPK (GNU Linear Programming Kit) is intended for solving large-scale
linear programming (LP), mixed integer linear programming (MIP), and
other related
GLPK 4.39 provides the possibility to model networks and solve maximum
network flow problems.
Function glp_maxflow_lp() is provided to convert the network flow problem to
a LP which can
be solved using the simplex algorithm.
After the problem is solved it is necessary to map the column
I'm using Flux Variability Analysis to understand how a metabolic
network may change under different conditions. I'm using glpk, and
for all of the reactions, I am able to get an objective value. For
some of the reactions, glpk reports that the primal solution is
unbounded because the dual
That's funny, I specifically issued the statement
control_params.presolve = GLP_ON;
before calling glp_intopt(). My understanding from the documentation
is that this would tell it to do the simplex pre-solve on its own.
Furthermore, the trace it showed on the screen indicated that it had in
is the best way to avoid this?
If the current basic solution is optimal and you free some previously
fixed variables, the solution cannot become primal infeasible; it may
become only non-optimal (dual infeasible). Or I misunderstand something?
Andrew Makhorin
If the current basic solution is optimal and you free some previously
fixed variables, the solution cannot become primal infeasible; it may
become only non-optimal (dual infeasible). Or I misunderstand
something?
In my experience the solution becomes primal infeasible.
Let's think to an
Is there any chance in GLPK MathProg to convert a symbolic expression
to an integer?
Such conversion is performed automatically.
See the example 'cal.mod' included in the glpk distribution.
___
Help-glpk mailing list
Help-glpk@gnu.org
It's possible to restrict the values of a variable to a specific set?. I
wish to do something like this:
set S;
set I;
var x{i in I} in S;
But doesn't work. Currently I'm simulating this behaviour using binary
varibles but maybe there is a more direct way to do it.
In mip there is no way
I have some questions about GLPK through the API.
I have a variable like this : 2=x=5 ,through API, I write it
like this:
glp_add_cols(lp,1);
glp_set_col_name(lp,1,x);
glp_set_col_bnds(lp,1,GLP_LO,2.0,0.0);
glp_set_col_bnds(lp,1,GLP_UP,0.0,5.0);
or like this:
glp_add_cols(lp,2);
I've started to use glpk api in c++. And i cannot figure out how to
get the solution from the solver after calling glp_simplex. I've found
some functions to print the solution but it prints a lot of other
unnecessary in my case information - I need just array of points and
the value of the
Which is the option that finds the first feasible solution?
Try '--mipgap 100' .
___
Help-glpk mailing list
Help-glpk@gnu.org
http://lists.gnu.org/mailman/listinfo/help-glpk
in more details? Thanks.
Andrew Makhorin
___
Help-glpk mailing list
Help-glpk@gnu.org
http://lists.gnu.org/mailman/listinfo/help-glpk
Extending the subject, is it possible with GLPK to redirect this output to a
file instead of stdout?
glpsol file.txt
It is possible to hardcopy the terminal output to a text file as
follows:
glpsol --log foo.txt
___
Help-glpk mailing
I've got a question about LP initial basis.
I create a problem, then optimize it, and save status for variables and
constraints, and delete the problem.
I create a new problem, early the same as the first one : I only remove
some variables (and so modify/remove some constraints).
Is there a
I am using GLPK in PYTHON via CVXOPT (which has an option to select
solver as GLPK). I am using it to solve an LP. I'd like to print out
the values of the variables in the problem as simplex progresses. In
other words, I am interested in feasible but suboptimal intermediate
solutions.
I've a problem that is almost infeasible, its a large one, but the KKT
conditions that glpsol gives me is:
KKT.PE: max.abs.err = 1.48e-12 on row 1
max.rel.err = 1.17e-16 on row 10
High quality
KKT.PB: max.abs.err = 6.01e-07 on column 1052
max.rel.err = 6.01e-07 on
So I was reading about how we have these parameters that are not
normally set through the use of the control parameter structure, such
as GLP_K_ROUND (default: 0) and GLP_K_RELAX (default: 0.07) I was
wondering how these parameters can be accessed to show their default
values or even to
I would appreciate deprecated elements in glpk.h to be clearly marked, to
avoid future confusion.
In glpk.h all definitions starting from the line:
#define LPX glp_prob
are deprecated and kept only for backward compatibility. (Probably there
must be an explicit comment in the header file.)
I'm trying to solve this simple problem:
\* Problem: Unknown *\
Maximize
obj: + 0.8 Z.1 + 0.2 Z.2
Subject To
r.1: - Z.1 + U.1 = 0.1
r.2: - Z.1 + U.1 = -0.1
r.3: + Z.1 + U.1 = 1
r.4: + Z.1 + U.1 = 0.7
r.5: - Z.2 + U.1 = 0.5
r.6: - Z.2 + U.1 = 0.125
r.7: + Z.2 + U.1 =
Now I #39;d like to be able to model conditional non-binary
variables. Does anybody know how to formulate this in mathprog?
--Begin Description ---
*) a,b are binary
*) c,d,e is continuous.
*) I #39;d like c to be
- 0 if a=b=0
- d if a=0,b=1
- e if
I would like to know if it is possible to implement more than one objective
function at the same time.
I've revised the manual that is on the web, and I've found that the simplex
method uses LU factorization to solve optimization problems working out with
an
objective function.
Do you
There #39;s a couple of features documented in 4.34 in the
stand-alone solver section (Appendix D):
(Options specifi c to simplex method)
--bas fi lename read initial basis from filename in MPS format
--wbas fi lename write nal basis to fi lename in MPS format
Both are missing from the
When I removed
redundant_constraint:
sum{i in TRUCKS} capacity[i] * y[i] = sum{j in PACKAGES} size[j];
[...]
Is it this 40 % saving you are refering to?
Interestingly when MIR cuts are enabled AND the redundant constraint is
removed
GLPK gets really slow.
[...]
With --first
I only would like to
draw an attention that reformulation of mip may essentially reduce the
solution time (though this is well known).
Not only the reformulations that tighten the feasible region
(like cutting planes), but even redundant constraints may significantly
affect the solution
Hi guys, I am new in GLPK use and I would like to ask you about some
solution that I get: Basically I define an LP problem where the
variable x10, x11 and x12 take values bw. 0 and 1 and the sum of
x10+x11+x12 = 1, according to that and for 18 structural variables I
get the following answer:
1) How can I use data for 3 or 4 dimension, for example:
Now I'm using a data with 2 dimension, this data
represents the productivity that one machine (Transportation
equipment) will have when operating with another machine.
param Prod_Trans: CAT365 CAT345
Below here are glpk 4.40 benchmarks for MIPLIB 2.0. All instances
(except three hard ones) were solved to optimality with the hybrid
pseudocost branching.
Solver: GLPSOL 4.40 (options used: --pcost)
Computer: Intel Pentium 4, 3.0 GHz
Platform: Cygwin 1.5.25
Compiler: GCC 3.4.4 (options used:
I have been searching around for a program to find solutions to little
problems like this: An item of meat costs 160. An item of fish costs 30.
An item of milk costs 15. Someone spent 700 and bought at most 6 items.
What did he buy?
What I want is to just input some constraints:
k * 160 +
Below here are glpk 4.40 benchmarks for MIPLIB 3.0. All instances
(except hard ones) were solved to optimality.
Solver: GLPSOL 4.40
Computer: Intel Pentium 4, 3.0 GHz
Platform: Cygwin 1.5.25
Compiler: GCC 3.4.4 (options used: -O3)
Test set: MIPLIB 3.0 http://miplib.zib.de/miplib3/miplib.html
. Thanks.
Andrew Makhorin
___
Help-glpk mailing list
Help-glpk@gnu.org
http://lists.gnu.org/mailman/listinfo/help-glpk
Is it possible to make changes in the sql table driver in order to
concatenate some arguments (marked in some way) to construct the
resulting sql statement?
Something like this, where a trailing backslash (or any other
appropriate character) in the symbolic value means concatenation:
table
, so they will appear in
the next release.
Andrew Makhorin
___
Help-glpk mailing list
Help-glpk@gnu.org
http://lists.gnu.org/mailman/listinfo/help-glpk
Hi Nigel,
Attached is xyacfs.mod which extends yacfs.mod to permit
investigation of data which may have errors in x (XonY) or y
(YonX).
Thank you for your example. I included it (the recent version) in the
glpk examples subdirectory.
Andrew Makhorin
I downloaded glpk 4-39, to resove linear programs using simplex
method, and I ru n the program using glpsol but there aren't
iterations in the output. How can I see them?
Probably you mean the solution, not iterations? You can specify the
option '-o filename', in which case glpsol prints the
I can see the solution in the output, but I am interested in looking
at iteratio ns in order to show different behaviours of simplex method
in several problems,
You can see the simplex iteration count on the terminal:
0: obj = 6.5e+02 infeas = 3.788e+03 (0)
* 2: obj =
the matrix, and would prefer to not have to rework the
original application.
I can implement this routine.
Andrew Makhorin
___
Help-glpk mailing list
Help-glpk@gnu.org
http://lists.gnu.org/mailman/listinfo/help-glpk
In my case, I need show in C with GLPK solver (called by glpk.h).
Do there exists any parameter to it?
Your question is still unclear.
You can use glpk in two ways. The first way is to use glpsol, the
stand-alone lp/mip solver. In this case you should provide problem
data either in mps or
Below here are glpk 4.40 benchmarks for Netlib LP collection.
Solver: GLPSOL 4.40 (default options used)
Computer: Intel Pentium 4, 3.0 GHz
Platform: Cygwin 1.5.25
Compiler: GCC 3.4.4 (options used: -O3)
Test set: Netlib LP collection ftp://ftp.netlib.org/lp/data/
ProblemRows Cols
I am currently using glpk. Thank you for the good documentation, the
Brief example in section 1.3.1 really helped me to start using the
library quickly. I have a question however. I would like to find both
the minimum and the maximum objective value for the same objective
function,
I am trying to parallelise the Qt/C++ code of multi agent model
representing farmers.
For the time being I #39;m using only 1 thread as I got from this
list that glpk is, at the present time, not re-entrant.
The funny(!) side is that when I use the new code (see down), even
if it use
I have an Integer Program and I run the GLPK to solve it. I noticed
that the GLPK automatically turns ON the Linear Programming Relaxation
without me specifying it. I have 4 questions:
1) Can I turned OFF the Linear Programming Relaxation? Because I want
to let the GLPK run without the
What does actually 2-approximation 3-approximation or
6-approximation means?
See:
http://en.wikipedia.org/wiki/Approximation_algorithm
___
Help-glpk mailing list
Help-glpk@gnu.org
http://lists.gnu.org/mailman/listinfo/help-glpk
I've build glpsol.exe with MSYS and cygwin.
Besides it's useful, the binary file has more than double sized and the
solver looks like quite slower.
Under cygwin gcc is run with default options '-g' (that includes
debugging info into the executable) and '-O2'. On my 32-bit windows
machine I
Under cygwin gcc is run with default options '-g' (that includes
debugging info into the executable) and '-O2'. On my 32-bit windows
machine I build glpk using 'make CFLAGS=-O3', and the code is about
30% faster than the one built with MSVS 2010 'cl -O3'.
I've experienced some issues
Just to clarify on Linear Programming Relaxation.
I am attempting to solve the NP-hard problem of Optimizing Reliability
Subject to a Bandwidth Constraint using Linear Programming Relaxation
and I have created 2 LP files for the problem.
Test 1: (using Binary structural variables)
However, I was pondering for the last 2 days about your response. It
seems to me that the global bound is not much use for my problem.
Because the global will give an *upper bound* for the reliability and
bandwidth which is of no use. A *lower bound* will be more useful. So
In case of
What I am trying to obtain is that though using LPR, the solution
is bounded, but the solution does not satisfy what I need which is
x1+x2=1 which means that x1 and x2 cannot co-exist together in
a solution.
In mathematics x1+x2=1 does not mean that x1 and x2 cannot co-exist
together in a
What I am trying to obtain is that though using LPR, the solution
is bounded, but the solution does not satisfy what I need which is
x1+x2=1 which means that x1 and x2 cannot co-exist together in
a solution.
In mathematics x1+x2=1 does not mean that x1 and x2 cannot co-exist
together in a
Hello, I created a test case where I apply a loop over a SINGLE
working thread that solves the LP example and I still have the issue.
Please see an example of re-enterable implementation of TLS module
for 32-bit Windows DLL (glplib02.c) and a test program (mtsamp.c) that
works. Both files are
Helloe evryone,
This is my first email and cry for help.
However, I have been playing around with Glpk for a while.
Let me jump right into my problem.
I recently hit a particular instance of my problem, that seems like a
bug, but I am not sure what #39;s going on, since glpk does not
just a simple (and perhaps dummy!) question I cound #39;t find the
answer on GLPK documentation: supose I have a glp_prob and solve it
with glp_simplex. Now, if I add a new column does glpk solve the new
problem from scratch?
If the LP presolver is disabled (it is disabled by default),
Within GMPL (i.e., MathProg) , is there a simple way to set the
seed for psuedo-random number generation? I #39;d like to be able
to randomize the starting point to stress test an example I #39;m
developing.
Currently the seed function is not implemented. However, you may
skip some
It would be nice to have a seed function :=)
I think it would be better to have a seed parameter passed to the
translator rather than the seed statement built into the language.
On the command-line level this could look like 'glpsol --seed 314159'.
Please see an example model attached. It demonstrates a technique
to reduce coefficients for 0-1 knapsack inequality.
Original 0-1 knapsack inequality:
65 x1 + 64 x2 + 41 x3 + 22 x4 + 13 x5 + 12 x6 + 8 x7 + 2 x8 = 80
Minimized equivalent inequality:
4 x1 + 4 x2 + 2 x3 + 2 x4 + 1 x5 + 1 x6 + 1 x7
What would happen if i add cols in a callback when the reason for
calling the calback is GLP_IROWGEN, it would start adding columns to
the global problem?.
To represent subproblems, i.e. nodes of the search tree, the glpk mip
solver uses the original problem object (glp_prob) passed to it from
Thanks, another question, can you get the final branch and bound tree
after the mip is solved?, i could add columns in each node and then
add to the initial relaxation and re-optimize.
The glpk mip solver does not keep fathomed nodes, so if the mip is
solved (to optimality), the final tree is
see example below. Unfortunately sorted output requires O(n^3) time.
Below here is a simplified Xypron's version. It works if all a[i]'s
are different.
set I;
param a{I} := Uniform01();
printf{k in 1..card(I), i in I:
sum{j in I} (if a[i] = a[j] then 1) == k}
%-10s %f8.6\n, i, a[i];
require evaluation of setof{} every time the condition
is checked. It is impossible to implement this efficiently.
Andrew Makhorin
___
Help-glpk mailing list
Help-glpk@gnu.org
http://lists.gnu.org/mailman/listinfo/help-glpk
Now,I #39;m using GUSEK to solve my problem and it works so well.But
the problem is I want to get the value of each node from the very
first step until we get the optimal solution which is the last step (I
want to get visualization output with value so I will be able to
know how it works step
and helpful. Would you like to contribute some of your models to glpk?
Best regards,
Andrew Makhorin
___
Help-glpk mailing list
Help-glpk@gnu.org
http://lists.gnu.org/mailman/listinfo/help-glpk
I #39;m attempting to write a portfolio optimization model in GMPL,
and would like to read return data from a .cvs file. The file would
include a variable number of columns with the column header containing
a short string for the stock ticker symbol.
I #39;m having trouble figuring out how
As I pointed out in the earlier thread, when I use -r, glpsol does not
solve, it just reads the solution.
May be I am missing something, please let me know,
No, you don't. The -r option just reads the solution.
Currently to construct initial lp basis glpsol has options --std, --adv
(default),
these need new data before including
in glpk.
Is there any way to fix this issue? I think your models are very useful
to be included in glpk as examples. Thanks.
Andrew Makhorin
___
Help-glpk mailing list
Help-glpk@gnu.org
http://lists.gnu.org/mailman
Karl Berry karl at freefriends.org
Thu Dec 3 17:30:39 EST 2009
The FSF is again approaching the end of the membership year, so is
hoping to encourage new folks to join. Of course, the more members,
the more support for GNU infrastructure and free software campaigns.
The direct url to join is
I think it would be better to implement basic bar and line graphs
similar to GNU Plot syntax or better in GLPK/MathProg.
In mathprog models one can redirect printf output to a file (i.e.
printf foo filename, where filename is a symbolic expression).
This allows writing GNU plot data to files
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
GLPK 4.41 -- Release Information
Release date: Dec 21, 2009
GLPK (GNU Linear Programming Kit) is intended for solving large-scale
linear programming (LP), mixed integer linear programming (MIP), and
other related
A question about read in a csv file that contains large constraint
matrix. In the table document (/glpk/doc/table.pdf), it says that for
a csv input file, each row is considered as a record and each column
is a field. To read each field, each of the field name has to be
specified, like in the
I wonder if there is a simply way to print a sensitivity analysis
table below with an LP in glpk?
Look at the routine lpx_print_sens_bnds (file glpk/src/glplpx03.c).
It implements the glpsol option --bounds.
___
Help-glpk mailing list
I was wondering about if LPX_OPT == GLP_OPT
when checking the solution status?
No, LPX_OPT != GLP_OPT. (LPX_OPT macro is deprecated and should not
be used.)
It seems
pyglpk used GLP_OPT while the routine
lpx_print_sens_bnds(...)
used LPX_OPT, and I got wrong outputs.
Thanks for that information. I checked the source code, and wonder if
there is a way to have the output go to the standard output. Currently
I only saw a possibility that requires a little change to the source
code:
The prototype is:
int lpx_print_sens_bnds(LPX *lp, const char *fname)
I tried it on my mac os x and /dev/stdout also corresponds to the
standard output (since it is a unix variant).
The problem is, of course, the out-dated LPX_OPT. Even after glpsol
found the optimal solution, I still got the output saying:
...
Size of triangular part = 1
0: obj =
This is a scaling/tolerance issue, i.e. glp_simplex reports that
the status is optimal, but glp_warm_up does not agree with that.
Please replace line 70, file glplpx03.c:
lpx_warm_up(lp);
by the following line:
glp_factorize(lp);
This must help.
(I will try to
Saturday, December 26, 2009, 11:02:20 AM, you wrote:
I tried it on my mac os x and /dev/stdout also corresponds to the
standard output (since it is a unix variant).
The problem is, of course, the out-dated LPX_OPT. Even after glpsol
found the optimal solution, I still got the output saying:
It might be even better if the API has routines to
calculate the max increase and max decrease of the
bounds, for example:
/**sensitivity bounds for coeficient in the objective*/
glp_coef_sensit_bounds(GLP* lp, int var_idx,
double* max_dec, double* max_inc);,
/**sensitiviy bounds for
I am trying to solve a simple integer linear program
with the following constraints
x1 + x2 +x3 +x4 = 1
10.00x1 + (-1.00)x2 5.00
1.00x2 and +(-2.00)x3 5.00
2.00x3 + (-0.50)x4 5.00
I have no objective function to optimise.
I am expecting output as x1 = 0 x2 = 1 x3 = 0 and x4 = 0
I run your code with a call to glp_write_lp added.
Below here is your instance passed to glp_simplex in cplex format:
\* Problem: sample *\
Maximize
obj: 0 x1
Subject To
p: + x4 + x3 + x2 + x1 = 5
q: - x2 + 10 x1 = 5
r: - 2 x3 + x2 = 5
o: - 0.5 x4 + 2 x3 = 1
Bounds
0 = x1 = 1
convenient format, which would
include row/column names. A DIMACS-like format seems to me most
suitable, because it allows easily using standard text utilities like
sed, gawk, etc. Using XML seems to me much more tricky and much less
convenient for processing out of glpk.
Andrew Makhorin
Sorry for the botchup. I did some code juggling and posted incorrect
code. I have posted the modified code at the end. I have upgraded to
glpk 4.41. I actually want x1, x2 ,x3 ,x4 to take only binary values 0
and 1. I have used glp_set_col_kind function to set the column kind to
GLP_IV
Run-Time Check Failure #1 - A cast to a smaller data type has
caused a loss of data. If this was intentional, you should mask
the source of the cast with the appropriate bitmask. For
example:
char c = (i 0xFF);
This advice is helpful for quiche eaters only :)
Because MSVS 2008 would
These codes are replaced with
unsigned short c = (unsigned short)( i USHRT_MAX);
The modified codes can produce 13.75 for vpm2.mps of MIPLIB 2003.
I am not sure why you are changing the code. Doesn't the original
version work for you? The glpk code is highly portable, and there is
no need
I wonder if it is possible for the API to support printing
the sensitivity info for just one particular
variable/constraint? This is useful when one is only
interested in some of the sensitivity bounds.
It might be even better if the API has routines to
calculate the max increase and max
The statement:
unsigned short c = (unsigned short)( i USHRT_MAX);
is absolutely equivalent to:
unsigned short c = (unsigned short)i;
Actually it's not.
The result of the latter statement can be determined
from the value of i and the value of USHRT_MAX.
If i is negative, the result
. Thanks.
Andrew Makhorin
LP/MIP problem data in DIMACS-like format
*
Comment line
c arbitrary text
Problem descriptor line
---
p lp ROWS COLS NONZ LP problem
p mip ROWS COLS NONZ MIP problem
ROWS
Would it be possible to have a simple example on this new dimacs like
data format? I presumed that this new format only applies to GLPK, not
on MathProg. An example will be easy to visualise the new data format,
in my case.
This is an example model in cplex lp format:
\* Problem: transp *\
In my optimization model, I read data from several .csv-files. This
looks as follows:
table loaddata IN CSV Exp.csv:L-[LType, App,Time]
table costdata IN CSV disc_data.csv:C-[Provider,Function, Type]
table ressourcedata IN CSV ress_data.csv:R-[Provider, Server, Size]
now I would like
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
GLPK 4.42 -- Release Information
Release date: Jan 13, 2010
GLPK (GNU Linear Programming Kit) is intended for solving large-scale
linear programming (LP), mixed integer linear programming (MIP), and
other related
Thanks, quickly looked at the reference manual and it looks really
good. The sensitivity report preamble message has been turned off,
which is nice. But I'm not sure what would happen if you give
glp_analyze_coef a none-basic variable?
This is a trivial case which needs no analysis. For
But I'm not sure what would happen if you give
glp_analyze_coef a none-basic variable? Similarly, what would happen
if you give glp_analyze_bound a basic variable? The reference manual
does not mention this, it seems to me.
Of course, glp_print_ranges prints the complete analysis report,
I downloaded and try to run the new GLPK format. How do you run the
new GLPK format? Andrew did not suggest what should be file extension
of this glpk format. Right now, I just put .glpk for the new format
(eg. transp.glpk (please see the model below)
Probably '.glp' would be appropriate.
Friday, January 15, 2010, 5:51:14 AM, you wrote:
Sorry, It's under work now =)
I can add this file format to Gusek, but I'm unsure about the code
syntax highlight. Andrew, can I assume that graphs.pdf, pages 16, 41 and
54, fully describes this GLPK (.glp) format?
Complete description of
I could not see any documentation of this new format in the pdfs. It
is only used as an example for creating a program using glpk api with
the new format glp (glpk.pdf page 14).
Complete description of the glpk lp/mip format is given in the
reference manual (glpk.pdf), Subsection glp_read_prob
Sure, both cases are trivial, I am only not sure what the call
would result? Would there be some bad consequences of you call that
way?
Primal values (activities) of rows and columns can be obtained with
routines glp_get_row_prim/glp_get_col_prim, and the dual values
(reduced costs) can be
Hi all, I #39;m new in GLPK. I download glpk-4.42 and I follow the
installation guide (./configure, make ect ect). When I finish this,
what I must do to run a GLPK model file?
Just run the glpsol utility from the command-line as follows:
$ glpsol -m foo.mod -d foo.dat
If you did 'make
I do make install but in /usr/local/bin I haven #39;t glpsol,
instead there is in example dir.
But if I do glpsol -m prod.mod, the shell return this message:
examples guess$ glpsol -m prod.mod
-bash: glpsol: command not found
I use MacOS X on Intel.
By default, `make install' will install
is this done?
By default the glpk solvers send some information about the solution
progress to the terminal and optionally to the log file. This output can
be either disabled or redirected.
Best regards,
Andrew Makhorin
___
Help-glpk mailing list
Help-glpk
Thanks a lot for all this nice information on doing sensitivity
analysis, I think I am learning a lot on GLPK API from your email. Now
I have a more complicated situation: what if more than one parameters
( coeff. or rhs, or some thing in the matrix) change simultaneously,
say as a function
601 - 700 of 1851 matches
Mail list logo
