scholarly journals A new branch and bound approach for concave minimization problems

1976 ◽  
pp. 330-336 ◽  
Author(s):  
Reiner Horst
Keyword(s):  
Branch And Bound ◽  
Concave Minimization ◽  
Minimization Problems

scholarly journals A Branch-and-bound algorithm for concave minimization problem with upper bounded variables

2018 ◽  
Vol 7 (2.12) ◽  
pp. 333
Author(s):  
Se Ho Oh
Keyword(s):  
Branch And Bound ◽  
Branching Process ◽  
Optimal Solution ◽  
Concave Minimization ◽  
Branch And Bound Algorithm ◽  
Local Optimum ◽  
Minimization Problems ◽  
Minimal Points ◽  
Bounded Variables ◽  
Concave Minimization Problem

This paper presents a branch-and-bound algorithm for solving the concave minimization problems with upper bounded variables. The algorithm uses simplex to construct the branching and the bounding procedure. The linear convex envelope (the objective function of the subproblem) is uniquely determined on the candidate simplex which contains the subset of the local minimal points. The optimal solution of the subproblem is a local optimum of the original concave problem and used in reducing the list of active subproblems. The branching process splits the candidate simplex into two subsimplices by fixing the selected branching variable at value 0 or upper bound. Then the subsimplices are one less dimensional than the candidate. It means that the size of the subproblems gradually decreases. Further research needs to be focused on the efficient determination method of the simplex. The algorithm of this paper can be applied to solving the concave minimization problems under knapsack type constraints. 

Sign in / Sign up

Export Citation Format

Share Document