bnb

BNB20 solves mixed integer nonlinear optimization problems

Description

BNB20 solves mixed integer nonlinear optimization problems. It is a branch-and-bound type algorithm.

• Required Products: Optimization Toolbox
• MATLAB release: MATLAB 5.3 (R11)

Other Files

BNB20.m,
BNBGUI.m,
BNBGUICB.m,
BNBHELP.txt,
Example.zip,
font/crld.ttf,
optim/nlconst.m,
optim/qpsub.m,
private/guierr.m,
private/guierr.mat,
private/guifun.m,
private/guifun.mat,
private/guimain.m,
private/guimain.mat,
private/guiset.m,
private/guiset.mat,
private/guiupd.m,
private/guiupd.mat,
readme.txt

[George Pau]

Very good basic implementation of branch and bound.

[H hasper]

 

[Nguyen Quoc Vo]

 

[Atanas Chervenkov]

 

[Andrew Odjo]

 

[vinod kumar]

please provide pdf help files and pseudo codes and comments on each step.

[Bakhtiyar Tokpayev]

 

[Pradeep Shrinivas]

Dear sir,
           Your work is excellent, we are using your work for our project.

              Regards,
          Pradeep &Shrinivas
        ( BE (CSE)Final Year)
         BCET Bangalore-560081

[shrinivas pradeep]

sir,
can you please send the manual for bnb.m (matlab) file.

[kinky leung]

Thanks!But is it free?

[Bess Bai]

Thanks! is there the manual for bnb.m (matlab) file?

[Puthut Wibowo]

Hmmm......

[Naresh Nandola]

 

[Dingyu Xue]

Further suggestions
1) better to allow function handles
2) fine-tuning of the argument and results for integer variables:
2a. in the starting part of the function, give xlb(xstat)=ceil(xlb(xstat)); xub(xstat)=floor(xub(xstat))
2b. at the end of the function, X(xstat)=round(X(xstat))

[asd sad]

 

[Mojtaba Hajihasani]

Your proposed method suffers from big problem, beacuse in sub-problem you have brought the problem into continues domain.

[wang lingli]

study

[jacky LI]

the example is not good enough!

[mark elec]

Does the algorithm support for non-convex problem ???

[Yubin Bao]

easy to use

[Sun Qiyue]

I can not work it out? the example is not so good and I always get the error: fun caused error

[Guo Xiaoyu]

Thank you very mucn

[Luo chengjin]

I think it's good!

[liu bingbing]

very good!

[Bartosz]

I have a problem with this algorithm I start it like that
[errmsg,Z,X,t,c,fail] = BNB20(fun,para',[0 0 1 1 1 1]',[150 125 3 2 11 1]',ub',[],[],[],[],'problemconstraints',[],options,dmodel,SampMin,weight,constraints)
yet one of the parameters is assigned a negative value during the operation of the algorithm

[mhihn]

I'm trying to run a mixed integer nonlinear programming (MINLP) problem using BNB20. However, irrespective of the complexity of my algorithm, I'm always getting the following results. It would be great if anyone can explain this result.

*** searched 0 % of tree
*** Z : Inf
*** t : 0.0 secs
*** c : 0 cycles
*** fail : 0 cycles
Optimization terminated: first-order optimality measure less
 than options.TolFun and maximum constraint violation is less
 than options.TolCon.
Active inequalities (to within options.TolCon = 1e-006):
  lower upper ineqlin ineqnonlin
                    11 31
                    12 32
                    13 33
                    34
                    35
                    36
                    37
                    38
                    39
                    40
                    41
                    42
                    43
                    44
                    45
??? Error using ==> lt
Matrix dimensions must agree.

Error in ==> BNB20 at 247
elseif all(abs(round(x(K))-x(K))<errx) & convflag>0