search

moustakas / archetypes

Algorithms and documentation for generating spectral archetypes. Useful for redshift fitting, spectral classification, developing target selection algorithms, and a myriad other applications.
MIT License
0 stars 0 forks source link

get CPLEX licenses / downloads #2

Open davidwhogg opened 8 years ago

davidwhogg commented 8 years ago

Hogg is working on it.

moustakas commented 8 years ago

I was able to download something from https://www-01.ibm.com/isc/esd/dswdown/dswdown.wss/web/searchDescription and typing in the search bar IBM ILOG CPLEX Optimization Studio

I downloaded version 12.6.1 for Mac OS X, installed it (after making the .bin file executable), and it seems to be working!

davidwhogg commented 8 years ago

that's promising. Can you make a hello-world program and run it?

moustakas commented 8 years ago

I've got something working but I'm not sure if I'm selecting the right "file type".

prometheus:archetypes% cplex

Welcome to IBM(R) ILOG(R) CPLEX(R) Interactive Optimizer 12.6.1.0
  with Simplex, Mixed Integer & Barrier Optimizers
5725-A06 5725-A29 5724-Y48 5724-Y49 5724-Y54 5724-Y55 5655-Y21
Copyright IBM Corp. 1988, 2014.  All Rights Reserved.

Type 'help' for a list of available commands.
Type 'help' followed by a command name for more
information on commands.

CPLEX> read elg-1000.0.output

File type options:

bas          INSERT format basis file
flt          Solution pool filters
lp           LP format problem file
min          DIMACS min-cost network-flow format file
mps          MPS format problem file
mst          MIP start file
net          CPLEX network-flow format file
ord          Integer priority order file
prm          Non-default parameter file
sav          Binary matrix and basis file
sol          Solution file
vmc          Virtual Machine Configuration

File type: lp
Problem 'elg-1000.0.output' read.
Read time = 0.01 sec. (0.00 ticks)
CPLEX> optimize
Found incumbent of value 40.000000 after 0.01 sec. (0.00 ticks)
Tried aggregator 1 time.
MIP Presolve eliminated 40 rows and 40 columns.
All rows and columns eliminated.
Presolve time = 0.01 sec. (0.02 ticks)

Root node processing (before b&c):
  Real time             =    0.01 sec. (0.03 ticks)
Parallel b&c, 8 threads:
  Real time             =    0.00 sec. (0.00 ticks)
  Sync time (average)   =    0.00 sec.
  Wait time (average)   =    0.00 sec.
                          ------------
Total (root+branch&cut) =    0.01 sec. (0.03 ticks)

Solution pool: 2 solutions saved.

MIP - Integer optimal solution:  Objective =  3.5000000000e+01
Solution time =    0.02 sec.  Iterations = 0  Nodes = 0
Deterministic time = 0.03 ticks  (1.37 ticks/sec)