메뉴 건너뛰기




Volumn 29, Issue 2, 2004, Pages 191-224

A new successive partition algorithm for concave minimization based on cone decomposition and decomposition cuts

Author keywords

Concave minimization; Cone decomposition; Decomposition cut; Successive partition

Indexed keywords

ALGORITHMS; FUNCTIONS; ITERATIVE METHODS; LINEAR PROGRAMMING; QUADRATIC PROGRAMMING; SET THEORY;

EID: 4544341977     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:JOGO.0000042113.68493.da     Document Type: Article
Times cited : (2)

References (22)
  • 2
    • 0002148307 scopus 로고
    • Concave minimization: Theory, applications and algorithms
    • Horst, R. and Pardalos, P.M. (eds.), Kluwer, Dordrecht
    • Benson, H.P. (1995), Concave minimization: Theory, applications and algorithms, in Horst, R. and Pardalos, P.M. (eds.), Handbook of Global Optimization, Kluwer, Dordrecht, pp. 43-148.
    • (1995) Handbook of Global Optimization , pp. 43-148
    • Benson, H.P.1
  • 3
    • 0030242902 scopus 로고    scopus 로고
    • Deterministic algorithms for constrained concave minimization: A unified critical survey
    • Benson, H.P. (1996), Deterministic algorithms for constrained concave minimization: A unified critical survey, Naval Research Logistics, 43, 765-795.
    • (1996) Naval Research Logistics , vol.43 , pp. 765-795
    • Benson, H.P.1
  • 4
    • 0033246983 scopus 로고    scopus 로고
    • Generalized γ-valid cut procedure for concave minimization
    • Benson, H.P. (1999), Generalized γ-valid cut procedure for concave minimization, Journal of Optimization Theory and Applications, 102, 289-298.
    • (1999) Journal of Optimization Theory and Applications , vol.102 , pp. 289-298
    • Benson, H.P.1
  • 5
    • 0028484306 scopus 로고
    • A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
    • Bretthauer, K.M. and Cabot, V.A. (1994), A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, Computers and Operations Research, 21, 777-785.
    • (1994) Computers and Operations Research , vol.21 , pp. 777-785
    • Bretthauer, K.M.1    Cabot, V.A.2
  • 6
    • 0028410496 scopus 로고
    • An algorithm and new penalties for concave integer minimization over a polyhedron
    • Bretthauer, K.M., Cabot, V.A. and Venkataramanan, M.A. (1994), An algorithm and new penalties for concave integer minimization over a polyhedron, Naval Research Logistics, 41, 435-454.
    • (1994) Naval Research Logistics , vol.41 , pp. 435-454
    • Bretthauer, K.M.1    Cabot, V.A.2    Venkataramanan, M.A.3
  • 7
    • 0016071516 scopus 로고
    • Variations on a cutting plane method for solving concave minimization problems with linear constraints
    • Cabot, A.V. (1974), Variations on a cutting plane method for solving concave minimization problems with linear constraints, Naval Research Logistics Quarterly, 21, 265-274.
    • (1974) Naval Research Logistics Quarterly , vol.21 , pp. 265-274
    • Cabot, A.V.1
  • 8
    • 0001423319 scopus 로고
    • An algorithm for separable nonconvex programming problems
    • Falk, J.E. and Soland, R.M. (1969), An algorithm for separable nonconvex programming problems, Management Science, 15, 550-569.
    • (1969) Management Science , vol.15 , pp. 550-569
    • Falk, J.E.1    Soland, R.M.2
  • 9
    • 34250387491 scopus 로고
    • An algorithm for nonconvex problems
    • Horst, R. (1976), An algorithm for nonconvex problems, Mathematical Programming, 10, 312-321.
    • (1976) Mathematical Programming , vol.10 , pp. 312-321
    • Horst, R.1
  • 11
    • 0002601643 scopus 로고    scopus 로고
    • A simplified convergence proof for the cone partitioning algorithm
    • Jaumard, B. and Meyer, C. (1998), A simplified convergence proof for the cone partitioning algorithm, Journal of Global Optimization, 13, 407-416.
    • (1998) Journal of Global Optimization , vol.13 , pp. 407-416
    • Jaumard, B.1    Meyer, C.2
  • 12
    • 0022737772 scopus 로고
    • Quadratic functions with exponential number of local maxima
    • Kalantari, B. (1986), Quadratic functions with exponential number of local maxima, Operations Research Letters, 5, 47-49.
    • (1986) Operations Research Letters , vol.5 , pp. 47-49
    • Kalantari, B.1
  • 13
    • 0040226707 scopus 로고
    • A cutting plane algorithm for solving bilinear programs
    • Konno, H. (1976a), A cutting plane algorithm for solving bilinear programs, Mathematical Programming, 11, 14-27.
    • (1976) Mathematical Programming , vol.11 , pp. 14-27
    • Konno, H.1
  • 14
    • 34250388607 scopus 로고
    • Maximization of a convex quadratic function under linear constraints
    • Konno, H. (1976b), Maximization of a convex quadratic function under linear constraints, Mathematical Programming, 11, 117-127.
    • (1976) Mathematical Programming , vol.11 , pp. 117-127
    • Konno, H.1
  • 15
    • 0346111798 scopus 로고    scopus 로고
    • Finite exact branch-and-bound algorithms for concave minimization over polytopes
    • Locatelli, M. and Thoai, N.V. (2000), Finite exact branch-and-bound algorithms for concave minimization over polytopes, Journal of Global Optimization, 18, 107-128.
    • (2000) Journal of Global Optimization , vol.18 , pp. 107-128
    • Locatelli, M.1    Thoai, N.V.2
  • 17
    • 0023961375 scopus 로고
    • Checking local optimality in constrained quadratic programming is NP-hard
    • Pardalos, P.M. and Schnitger, G. (1988), Checking local optimality in constrained quadratic programming is NP-hard, Operations Research Letters, 7, 33-35.
    • (1988) Operations Research Letters , vol.7 , pp. 33-35
    • Pardalos, P.M.1    Schnitger, G.2
  • 18
    • 0346786580 scopus 로고    scopus 로고
    • How to extend the concept of convexity cuts to derive deeper cutting planes
    • Porembski, M. (1999), How to extend the concept of convexity cuts to derive deeper cutting planes, Journal of Global Optimization, 15, 371-404.
    • (1999) Journal of Global Optimization , vol.15 , pp. 371-404
    • Porembski, M.1
  • 19
    • 0001553298 scopus 로고
    • Concave programming under linear constraints
    • Tuy, H. (1964), Concave programming under linear constraints, Soviet Mathematics, 5, 1437-1440.
    • (1964) Soviet Mathematics , vol.5 , pp. 1437-1440
    • Tuy, H.1
  • 20
    • 0002407954 scopus 로고
    • Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
    • Tuy, H. (1991), Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms, Journal of Global Optimization, 1, 23-36.
    • (1991) Journal of Global Optimization , vol.1 , pp. 23-36
    • Tuy, H.1
  • 22
    • 0016060631 scopus 로고
    • Global maximization of a convex function with linear inequality constraints
    • Zwart, P.B. (1974), Global maximization of a convex function with linear inequality constraints, Operations Research, 22, 602-609.
    • (1974) Operations Research , vol.22 , pp. 602-609
    • Zwart, P.B.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.