메뉴 건너뛰기




Volumn 15, Issue 4, 1999, Pages 433-447

Heuristic Methods for Linear Multiplicative Programming

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0003686229     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008308913266     Document Type: Article
Times cited : (51)

References (21)
  • 2
    • 0031504280 scopus 로고    scopus 로고
    • Multiplicative programming problems: Analysis and efficient point search heuristic
    • H.P. Benson and G.M. Boger (1997), Multiplicative programming problems: analysis and efficient point search heuristic, Journal of Optimization Theory and Applications 94: 487-510.
    • (1997) Journal of Optimization Theory and Applications , vol.94 , pp. 487-510
    • Benson, H.P.1    Boger, G.M.2
  • 3
    • 0347069389 scopus 로고
    • The solution of special quadratic programming problem
    • in Hungarian
    • F. Forgo (1975), The solution of special quadratic programming problem, SZIGMA 8: 53-59 (in Hungarian).
    • (1975) SZIGMA , vol.8 , pp. 53-59
    • Forgo, F.1
  • 4
    • 0004136270 scopus 로고
    • Budapest, Hungary: Akademiai Kiado
    • F. Forgo (1988), Nonconvex Programming, Budapest, Hungary: Akademiai Kiado.
    • (1988) Nonconvex Programming
    • Forgo, F.1
  • 5
    • 0003609703 scopus 로고
    • Parametric simplex algorithm for a class of NP-complete problems whose average number of steps is polynomial
    • H. Konno, T. Kuno and Y. Yajima (1992), Parametric simplex algorithm for a class of NP-complete problems whose average number of steps is polynomial, Computational Optimization and Applications 1: 227-239.
    • (1992) Computational Optimization and Applications , vol.1 , pp. 227-239
    • Konno, H.1    Kuno, T.2    Yajima, Y.3
  • 6
    • 0027110856 scopus 로고
    • Linear mutliplicative programming
    • H. Konno and T. Kuno (1992), Linear mutliplicative programming, Mathematical Programming 56: 51-64.
    • (1992) Mathematical Programming , vol.56 , pp. 51-64
    • Konno, H.1    Kuno, T.2
  • 7
    • 0002574382 scopus 로고
    • Multiplicative programming
    • R. Horst and P.M. Pardalos (eds.), Dordrecht, Boston/London: Kluwer Academic Publishers
    • H. Konno and T. Kuno (1995), Multiplicative programming, in: R. Horst and P.M. Pardalos (eds.), Handbook of Global Optimization (pp. 369-405) Dordrecht, Boston/London: Kluwer Academic Publishers.
    • (1995) Handbook of Global Optimization , pp. 369-405
    • Konno, H.1    Kuno, T.2
  • 9
    • 0003677197 scopus 로고
    • An outer approximation method for minimizing the product of several convex functions on a convex set
    • T. Kuno, Y. Yajima and H. Konno (1993), An outer approximation method for minimizing the product of several convex functions on a convex set, Journal of Global Optimization 3: 325-335.
    • (1993) Journal of Global Optimization , vol.3 , pp. 325-335
    • Kuno, T.1    Yajima, Y.2    Konno, H.3
  • 10
    • 0000108196 scopus 로고    scopus 로고
    • NP-hardness of linear multiplicative programming and related problems
    • T. Matsui (1996), NP-hardness of linear multiplicative programming and related problems, Journal of Global Optimization 9: 113-119.
    • (1996) Journal of Global Optimization , vol.9 , pp. 113-119
    • Matsui, T.1
  • 11
    • 0001874070 scopus 로고
    • Quadratic progamming with one negative eigenvalue is NP-hard
    • P.M. Pardalos and S.A. Vavasis (1991), Quadratic progamming with one negative eigenvalue is NP-hard, Journal of Global Optimization 1: 15-22.
    • (1991) Journal of Global Optimization , vol.1 , pp. 15-22
    • Pardalos, P.M.1    Vavasis, S.A.2
  • 13
    • 0000635160 scopus 로고    scopus 로고
    • A branch-and-reduce approach to global optimization
    • H.S. Ryoo and N.V. Sahinidis (1996), A branch-and-reduce approach to global optimization, Journal of Global Optimization 8: 107-138.
    • (1996) Journal of Global Optimization , vol.8 , pp. 107-138
    • Ryoo, H.S.1    Sahinidis, N.V.2
  • 15
    • 0028526191 scopus 로고
    • Random problem generation and the computation of efficient extreme points in multiple objective linear programming
    • R.E. Steuer (1994), Random problem generation and the computation of efficient extreme points in multiple objective linear programming, Computational Optimization and Applications 3: 333-347.
    • (1994) Computational Optimization and Applications , vol.3 , pp. 333-347
    • Steuer, R.E.1
  • 17
    • 0003720725 scopus 로고
    • Programming with indefinite quadratic function with linear constraints
    • K. Swarup (1966a), Programming with indefinite quadratic function with linear constraints, Cahiers du Centre d'Études de Recherche Opérationnelle 8: 132-136.
    • (1966) Cahiers du Centre d'Études de Recherche Opérationnelle , vol.8 , pp. 132-136
    • Swarup, K.1
  • 20
    • 28844482146 scopus 로고
    • A global optimization approach for solving the convex multiplicative programming problem
    • N.V. Thoai (1991), A global optimization approach for solving the convex multiplicative programming problem, Journal of Global Optimization 1: 341-357.
    • (1991) Journal of Global Optimization , vol.1 , pp. 341-357
    • Thoai, N.V.1
  • 21
    • 1842801959 scopus 로고
    • Polyhedral annexation, dualization and dimension reduction technique in global optimization
    • H. Tuy (1991), Polyhedral annexation, dualization and dimension reduction technique in global optimization, Journal of Global Optimization 1: 229-244.
    • (1991) Journal of Global Optimization , vol.1 , pp. 229-244
    • Tuy, H.1


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