메뉴 건너뛰기




Volumn 28, Issue 1, 1983, Pages 1-11

Optimal Short-Term Scheduling of Large-Scale Power Systems

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRIC POWER SYSTEMS;

EID: 0020498742     PISSN: 00189286     EISSN: 15582523     Source Type: Journal    
DOI: 10.1109/TAC.1983.1103136     Document Type: Article
Times cited : (149)

References (24)
  • 1
    • 0017490871 scopus 로고
    • An application of Lagrangian relaxation to scheduling in power-generation systems
    • J. A. Muckstadt and S. A. Koenig, “An application of Lagrangian relaxation to scheduling in power-generation systems,” Operations Res., vol. 25, pp. 387–403, 1977.
    • (1977) Operations Res , vol.25 , pp. 387-403
    • Muckstadt, J.A.1    Koenig, S.A.2
  • 3
    • 0002554041 scopus 로고
    • Lagrangian relaxation for integer programming
    • A. Geoffrion, “Lagrangian relaxation for integer programming,” Math. Programming Study, vol. 2, pp. 82–114, 1974.
    • (1974) Math. Programming Study , vol.2 , pp. 82-114
    • Geoffrion, A.1
  • 6
    • 49849127729 scopus 로고
    • Minimization of unsmooth functionals
    • B. T. Poljak, “Minimization of unsmooth functionals,” USSR Comput. Math. Math. Phys., vol. 9, pp. 14–29, 1969.
    • (1969) USSR Comput. Math. Math. Phys. , vol.9 , pp. 14-29
    • Poljak, B.T.1
  • 7
    • 0016025814 scopus 로고
    • Validation of subgradient optimization
    • M. Held, P. Wolfe, and H. Crowder, “Validation of subgradient optimization,” Math. Program., vol. 6, pp. 62–88, 1974.
    • (1974) Math. Program. , vol.6 , pp. 62-88
    • Held, M.1    Wolfe, P.2    Crowder, H.3
  • 8
    • 0016630722 scopus 로고
    • Nondifferentiable optimization via approximation
    • D. P. Bertsekas, “Nondifferentiable optimization via approximation,” Math. Programming Study, vol. 3, pp. 1–25, 1975.
    • (1975) Math. Programming Study , vol.3 , pp. 1-25
    • Bertsekas, D.P.1
  • 9
    • 0000665525 scopus 로고
    • Approximation procedures based on the method of multipliers
    • D. P. Bertsekas, “Approximation procedures based on the method of multipliers,” J. Optimiz. Theory Appl., vol. 23, pp. 487–510, 1977.
    • (1977) J. Optimiz. Theory Appl. , vol.23 , pp. 487-510
    • Bertsekas, D.P.1
  • 10
    • 21044435906 scopus 로고
    • A new penalty function method for constrained minimization
    • New Orleans, LA
    • B. W. Kort and D. P. Bertsekas, “A new penalty function method for constrained minimization,” in Proc. 1972 IEEE Conf. Decision Contr., New Orleans, LA, 1972, pp. 162–166.
    • (1972) Proc. 1972 IEEE Conf. Decision Contr. , pp. 162-166
    • Kort, B.W.1    Bertsekas, D.P.2
  • 11
    • 84939010087 scopus 로고
    • Projected Newton methods for optimization problems with simple constraints
    • M.I.T., Cambridge, MA, Rep. R-1025, Aug. see also SIAM J. Contr. Optimiz., vol. 20, no. 2, pp. 221–246, 1982
    • D. P. Bertsekas, “Projected Newton methods for optimization problems with simple constraints,” Lab. Inform. Decision Syst., M.I.T., Cambridge, MA, Rep. R-1025, Aug. 1980; see also SIAM J. Contr. Optimiz., vol. 20, no. 2, pp. 221–246, 1982.
    • (1980) Lab. Inform. Decision Syst.
    • Bertsekas, D.P.1
  • 14
    • 0018455554 scopus 로고
    • On the convergence rate of a penalty function method of exponential type
    • V. H. Nguyen and J. J. Strodiot, “On the convergence rate of a penalty function method of exponential type,” J. Optimiz. Theory Appl, vol. 27, pp. 495–508, 1979.
    • (1979) J. Optimiz. Theory Appl , vol.27 , pp. 495-508
    • Nguyen, V.H.1    Strodiot, J.J.2
  • 16
    • 0006565946 scopus 로고
    • A descent numerical method for optimization problems with nondifferentiable cost functionals
    • D. P. Bertsekas and S. K. Mitter, “A descent numerical method for optimization problems with nondifferentiable cost functionals,” SIAM J. Contr. Optimiz., vol. 11, pp. 637–652, 1973.
    • (1973) SIAM J. Contr. Optimiz. , vol.11 , pp. 637-652
    • Bertsekas, D.P.1    Mitter, S.K.2
  • 17
    • 0344362809 scopus 로고
    • An algorithm for minimizing convex functions
    • J. L. Rosenfeld, Ed. Amsterdam, The Netherlands: North-Holland
    • C. Lemarechal, “An algorithm for minimizing convex functions,” in Proc. IFIP Congr. 1974, J. L. Rosenfeld, Ed. Amsterdam, The Netherlands: North-Holland, 1974, pp. 552–557.
    • (1974) Proc. IFIP Congr. 1974 , pp. 552-557
    • Lemarechal, C.1
  • 18
    • 0016531957 scopus 로고
    • Convergence of a gradient method with space dilation in the direction of the difference between two successive gradients
    • N. Z. Shor, “Convergence of a gradient method with space dilation in the direction of the difference between two successive gradients,” Cybernetics, vol. 11, pp. 564–570, 1975.
    • (1975) Cybernetics , vol.11 , pp. 564-570
    • Shor, N.Z.1
  • 19
    • 0000009213 scopus 로고
    • An algorithm for constrained optimization with semismooth functions
    • R. Mifflin, “An algorithm for constrained optimization with semismooth functions,” Math. Operations Res., vol. 2. pp. 191–207, 1977.
    • (1977) Math. Operations Res. , vol.2 , pp. 191-207
    • Mifflin, R.1
  • 20
    • 0016621235 scopus 로고
    • A method of conjugate subgradients for minimizing nondifferentiable functions
    • P. Wolfe, “A method of conjugate subgradients for minimizing nondifferentiable functions,” Math. Programming Study, vol. 3, pp. 145–173, 1975.
    • (1975) Math. Programming Study , vol.3 , pp. 145-173
    • Wolfe, P.1
  • 21
    • 0011339337 scopus 로고
    • Optimization of Lipschitz continuous functions
    • A. A. Goldstein, “Optimization of Lipschitz continuous functions,” Math. Programming, vol. 13, pp. 14–22, 1977.
    • (1977) Math. Programming , vol.13 , pp. 14-22
    • Goldstein, A.A.1
  • 24
    • 0020265766 scopus 로고
    • Estimates of the duality gap for large scale separable integer programming problems
    • Miami Beach, FL, Dec.
    • D. P. Bertsekas and N. R. Sandell, Jr., “Estimates of the duality gap for large scale separable integer programming problems,” in Proc. 1982 IEEE Conf. Decision and Contr., Miami Beach, FL, Dec. 1982.
    • (1982) Proc. 1982 IEEE Conf. Decision and Contr.
    • Bertsekas, D.P.1    Sandell, N.R.2


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