How to interpret the following message from Branch and bound method of an optimization problem.

Hi,

I shall be thankful if anybody could make any suggestion on the given results of an optimization problem.

I doubt the solution is reliable, but how can i improve the results. I used the default parameters of the solver.

Inputs: optimization variables = 40;

linear equality constraints = 9;

linear inequality constraints = 17;

bounding condition constraints = 20.

Ans:

exitflag =

Exitflag enumeration

IntegerFeasible

output =

struct with fields:

relativegap: 258.2724

absolutegap: 1.8416e+04

numfeaspoints: 6

numnodes: 1227179

constrviolation: 2.4477e-11

message: 'Solver stopped prematurely. Integer feasible point found.↵↵Intlinprog stopped because it exceeded the time limit, options.MaxTime = 7200 (the default value). The intcon variables are integer within tolerance, options.IntegerTolerance = 1e-05 (the default value).'

solver: 'intlinprog'

[Walter Roberson]

I am not sure what the question is?

The program searched for 2 hours. In that time it found 6 points that satisfy all of the constraints.

The solution it returned was the best of the 6.

Is there a better solution available? Hard to say. 6 valid solutions in two hours indicates that your nonlinear constraints are difficult to meet. I do not see any inherent reason to believe that there will definitely be better solutions. There might be. You could run for longer, perhaps another half hour and see if it produces another point