[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Bug-glpk] feasible LP declared infeasible by GLPK

From: Mritunjay Singh
Subject: [Bug-glpk] feasible LP declared infeasible by GLPK
Date: Thu, 19 Jun 2003 11:40:46 -0700 (PDT)

I have a MPS file containing a MIP. It solves fine using either of the two NEOS 
available on the web: FORTMP and Xpress-MP in less than a tenth of a second.
When I try to solve it using GLPK, it tells me that it has no feasible 
solution. This is
while trying to solve the LP relaxation using simplex. 

This is what it outputs:
load_mps: reading LP data from `bigun-out.mps'...
load_mps: name `Unnamed'
load_mps: 223 rows
load_mps: 428 columns
load_mps: 1384 non-zeros
load_mps: 1 right-hand side vector(s)
load_mps: 0 range vector(s)
load_mps: 1 bound vector(s)
load_mps: 1180 cards were read
      0:   objval =  0.000000000e+000   infeas =  1.000000000e+000 (214)
      1:   objval =  0.000000000e+000   infeas =  1.000000000e+000 (213)
      2:   objval =  0.000000000e+000   infeas =  1.000000000e+000 (213)
      3:   objval =  0.000000000e+000   infeas =  1.000000000e+000 (212)
lpx_print_sol: writing LP problem solution to `result.txt'...

The MPS file is attached. 
For future reference, should I be posting such reports to this list? 

Do you Yahoo!?
SBC Yahoo! DSL - Now only $29.95 per month!

Attachment: bigun-out.mps
Description: bigun-out.mps

reply via email to

[Prev in Thread] Current Thread [Next in Thread]