메뉴 건너뛰기




Volumn 35, Issue 10, 1996, Pages 3519-3527

Synthesizing optimal waste blends

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BLENDING; CALCULATIONS; GLASS; HEURISTIC METHODS; NONLINEAR PROGRAMMING; PROBLEM SOLVING; PROCESSING; SIMULATED ANNEALING; STORAGE (MATERIALS); VITRIFICATION; WASTES;

EID: 0030258641     PISSN: 08885885     EISSN: None     Source Type: Journal    
DOI: 10.1021/ie960028c     Document Type: Article
Times cited : (29)

References (26)
  • 2
    • 9644308639 scopus 로고
    • Partitioning for solving mixed-variables programming problems
    • Benders, J. F. Partitioning for solving mixed-variables programming problems. Numer. Math. 1962, 4, 238.
    • (1962) Numer. Math. , vol.4 , pp. 238
    • Benders, J.F.1
  • 4
    • 0021855656 scopus 로고
    • Improved Infeasible Path Optimization for Sequential Modular Simulators. Part II
    • Biegler, L. T.; Cuthrell, J. E. Improved Infeasible Path Optimization for Sequential Modular Simulators. Part II. Comput. Chem. Eng. 1985, 9, 257.
    • (1985) Comput. Chem. Eng. , vol.9 , pp. 257
    • Biegler, L.T.1    Cuthrell, J.E.2
  • 7
    • 0026617139 scopus 로고
    • An MINLP process synthesizer for a sequential modular simulator
    • Diwekar, U. M.; Grossmann, I. E.; Rubin, E. S. An MINLP process synthesizer for a sequential modular simulator. Ind. Eng. Chem. Res. 1992, 31, 313.
    • (1992) Ind. Eng. Chem. Res. , vol.31 , pp. 313
    • Diwekar, U.M.1    Grossmann, I.E.2    Rubin, E.S.3
  • 8
    • 0022902024 scopus 로고
    • An outer-approximation algorithm for a class of Mixed-Integer Nonlinear Programs
    • Duran, M. A.; Grossmann, I. E. An outer-approximation algorithm for a class of Mixed-Integer Nonlinear Programs. Math. Program. 1986, 36, 307.
    • (1986) Math. Program. , vol.36 , pp. 307
    • Duran, M.A.1    Grossmann, I.E.2
  • 10
    • 0024754682 scopus 로고
    • A global optimum search for nonconvex NLP and MINLP problems
    • Floudas, C. S.; Aggrawal, A.; Ciric, A. R. A global optimum search for nonconvex NLP and MINLP problems. Comput. Chem. Eng. 1989, 13, 1117.
    • (1989) Comput. Chem. Eng. , vol.13 , pp. 1117
    • Floudas, C.S.1    Aggrawal, A.2    Ciric, A.R.3
  • 11
    • 0015419856 scopus 로고
    • Generalized Benders decomposition
    • Geoffrion, A. M. Generalized Benders decomposition. J. Optim. Theory Appl. 1972, 10, 237.
    • (1972) J. Optim. Theory Appl. , vol.10 , pp. 237
    • Geoffrion, A.M.1
  • 15
    • 0001886949 scopus 로고
    • Studies of the behavior of recursion for the pooling problem
    • Haverly, C. A. Studies of the behavior of recursion for the pooling problem. SIGMAP Bull. 1978, 25, 19.
    • (1978) SIGMAP Bull. , vol.25 , pp. 19
    • Haverly, C.A.1
  • 17
    • 0023418970 scopus 로고
    • Relaxation strategy for the structural optimization of process flowsheets
    • Kocis, G. R.; Grossmann, I. E. Relaxation strategy for the structural optimization of process flowsheets. Ind. Eng. Chem. Res. 1987, 26, 1869.
    • (1987) Ind. Eng. Chem. Res. , vol.26 , pp. 1869
    • Kocis, G.R.1    Grossmann, I.E.2
  • 26
    • 0025459923 scopus 로고
    • A combined penalty function and outer-approximation method for MINLP optimization
    • Viswanathan, J.; Grossmann, I. E. A combined penalty function and outer-approximation method for MINLP optimization. Comput. Chem. Eng. 1990, 14, 769.
    • (1990) Comput. Chem. Eng. , vol.14 , pp. 769
    • Viswanathan, J.1    Grossmann, I.E.2


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