We consider a problem of minimization of a concave function subject to affine constraints. By using sign reversion techniques we show that the initial problem can be transformed into a family of concave maximization problems. This property enables us to suggest certain algorithms based on the parametric dual optimization problem. © 2010 Springer-Verlag
AbstractThis article presents a new algorithm for solving the problem of globally minimizing a conca...
© Published under licence by IOP Publishing Ltd.The article describes the algorithm for branch and b...
© Published under licence by IOP Publishing Ltd.The article describes the algorithm for branch and b...
We consider a problem of minimization of a concave function subject to affine constraints. By using ...
A sufficient optimality criterion for linearly-constrained concave minimization problems is given in...
A sufficient optimality criterion for linearly-constrained concave minimization problems is given in...
A sufficient optimality criterion for linearly-constrained concave minimization problems is given in...
A sufficient optimality criterion for linearly-constrained concave minimization problems is given in...
Abstract. In this paper, we develop two algorithms for globally optimizing a special class of linear...
Abstract. In this paper, we develop two algorithms for globally optimizing a special class of linear...
. We introduce a new method for maximizing a concave quadratic function with bounds on the variables...
In this paper, we develop a kind of branch-and-bound algorithm for solving con-cave minimization pro...
In this paper, we develop a kind of branch-and-bound algorithm for solving con-cave minimization pro...
© Published under licence by IOP Publishing Ltd.The article describes the algorithm for branch and b...
Methodology is described for the global solution to problems of the form minimize f(x) subject to x[...
AbstractThis article presents a new algorithm for solving the problem of globally minimizing a conca...
© Published under licence by IOP Publishing Ltd.The article describes the algorithm for branch and b...
© Published under licence by IOP Publishing Ltd.The article describes the algorithm for branch and b...
We consider a problem of minimization of a concave function subject to affine constraints. By using ...
A sufficient optimality criterion for linearly-constrained concave minimization problems is given in...
A sufficient optimality criterion for linearly-constrained concave minimization problems is given in...
A sufficient optimality criterion for linearly-constrained concave minimization problems is given in...
A sufficient optimality criterion for linearly-constrained concave minimization problems is given in...
Abstract. In this paper, we develop two algorithms for globally optimizing a special class of linear...
Abstract. In this paper, we develop two algorithms for globally optimizing a special class of linear...
. We introduce a new method for maximizing a concave quadratic function with bounds on the variables...
In this paper, we develop a kind of branch-and-bound algorithm for solving con-cave minimization pro...
In this paper, we develop a kind of branch-and-bound algorithm for solving con-cave minimization pro...
© Published under licence by IOP Publishing Ltd.The article describes the algorithm for branch and b...
Methodology is described for the global solution to problems of the form minimize f(x) subject to x[...
AbstractThis article presents a new algorithm for solving the problem of globally minimizing a conca...
© Published under licence by IOP Publishing Ltd.The article describes the algorithm for branch and b...
© Published under licence by IOP Publishing Ltd.The article describes the algorithm for branch and b...