search

coin-or / Dip

DIP is a decomposition-based solver framework for mixed integer linear programs.
https://github.com/coin-or/Dip/wiki
Eclipse Public License 1.0
17 stars 7 forks source link

Solving master problems using interior point method #62

Open svigerske opened 5 years ago

svigerske commented 5 years ago

Issue created by migration from Trac.

Original creator: jchristoffer

Original creation time: 2011-01-05 12:44:44

Version: 0.8.7

CC: @mgalati13

In DecompAlgo.cpp I tried to set DO_INTERIOR. I managed to get it to run, but it terminates with an assertion failure – saying that Barrier limit on dual objective exceeded.

I guess the barrier algorithm doesn’t find a feasible solution (within the set limit), and the infeasible state is not set properly (as stated in the comments of the code). Is this the case?

I have attached the log, source code, and data for my problem.

PS. To get it to compile I modified DecompAlgo.cpp so that 

 int cpxStat=0, cpxMethod=0;

is initialised outside the switch clause in DecompAlgo::solutionUpdate

svigerske commented 5 years ago

Attachment SILCEP-src.zip by jchristoffer created at 2011-01-05 12:49:21

source code for the problem

svigerske commented 5 years ago

Attachment silcep3node.dat by jchristoffer created at 2011-01-05 12:50:17

sample data

svigerske commented 5 years ago

Attachment silcep.parm by jchristoffer created at 2011-01-05 12:52:23

parameter file

svigerske commented 5 years ago

Attachment log.txt by jchristoffer created at 2011-01-05 12:53:05

log output