ALBERT — All Library Books, journals and Electronic Records Telegrafenberg

Hits per page

hit 1 - 1 | 1 hit

Select All Export

Electronic Resource

Branch-and-bound decomposition approach for solving quasiconvex-concave programs (1994)

Horst, R. ; Muu, L. D. ; Nast, M.

Springer

Journal of optimization theory and applications 82 (1994), S. 267-293

add to mindlist on the mindlist

Details

ISSN: 1573-2878

Keywords: Global optimization ; convex-concave programming ; branch-and-bound methods ; optimization of differences of convex functions ; fractional multiplicative programming

Source: Springer Online Journal Archives 1860-2000

Topics: Mathematics

Notes: Abstract A class of branch-and-bound methods is proposed for minimizing a quasiconvex-concave function subject to convex and quasiconvex-concave inequality constraints. Several important special cases where the subproblems involved by the bounding-and-branching operations can be solved quite effectively include certain d.c. programming problems, indefinite quadratic programming with one negative eigenvalue, affine multiplicative problems, and fractional multiplicative optimization.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1007/BF02191854

	Location	Call Number	Expected	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

hit 1 - 1 | 1 hit