×
Fülöp, J.

A semi-infinite programming method for approximating load duration curves by polynomials. (English) Zbl 0778.65014

Computing 49, No. 3, 201-212 (1992).
The author states that load duration curves play an important role in the planning practice of electric power systems. He considers the problem of approximating a load duration curve by a polynomial under monotonicity and some other constraints. He shows that semi-infinite programming techniques can be applied for solving this problem. A convergent inner- outer method and a finite \(\varepsilon\)-optimal algorithm is proposed.
Reviewer: J.L.Fernández Muñiz (La Habana)

MSC:

65D15 Algorithms for approximation of functions
90C25 Convex programming
90C90 Applications of mathematical programming

Keywords:

cutting plane method; epsilon-algorithm; load duration curves; electric power systems; semi-infinite programming; inner-outer method

Software:

WASP
PDF BibTeX XML Cite
\textit{J. Fülöp}, Computing 49, No. 3, 201--212 (1992; Zbl 0778.65014)
Full Text: DOI
  • logo of hbz
  • logo of WorldCat

References:

[1] Bernau, H.: An exact penalty function method for strictly convex quadratic programs. In: Guddat, J. et al. (eds.) Advances in mathematical optimization. Berlin: Akademie-Verlag 1988, pp. 35–43.
[2] Dörfner, P., Fülöp, J., Hoffer, J.: LDC Module, User’s Guide, Version 2.0. Budapest: Hungarian Electricity Board, Argonne: Argonne National Laboratory (March 1991).
[3] Energy and Power Evaluation Program (ENPEP), Documentation and Users Manual. Argonne: Argonne National Laboratory (August 1987).
[4] Expansion Planning for Electrical Generating Systems, A Guidebook. Technical Reports Series No. 241, International Atomic Energy Agency, Vienna (1984).
[5] Fülöp, J.: A semi-infinite programming method for approximating load duration curves by polynomials. Working Paper 92-2, Laboratory of Operations Research and Decision Systems, Computer and Automation Institute, Budapest (1992).
[6] Gustafson, S. A., Kortanek, K. O.: Numerical treatment of a class of semi-infinite programming problems. Naval Research Logistics Quarterly20, 477–504 (1973). · Zbl 0272.90073
[7] Hansen, P., Jaumard, B., Lu, S.-H.: Global minimization of univariate functions by sequential polynomial approximation. International Journal of Computer Mathematics28, 183–193 (1988). · Zbl 0676.65063
[8] Hettich, R., Zencke, P.: Numerische Methoden der Approximation und semi-infiniten Optimierung. Stuttgart: Teubner 1982. · Zbl 0481.65033
[9] Hettich, R.: A review of numerical methods for semi-infinite optimization. In: Fiacco, A. V., Kortanek, K. O. (eds.) Semi-infinite Programming and Applications. New York: Springer 1983, pp. 158–178. · Zbl 0519.49022
[10] Hettich, R.: An implementation of a discretization method for semi-infinite programming. Mathematical Programming34, 354–361 (1986). · Zbl 0592.90061
[11] Hettich, R., Gramlich, G.: A note on an implementation of a method for quadratic semi-infinite programming. Mathematical Programming46, 249–254 (1990). · Zbl 0699.90078
[12] Hu, H.: A one-phase algorithm for semi-infinite linear programming. Mathematical Programming46, 85–103 (1990). · Zbl 0696.90034
[13] Tichatschke, R., Nebeling, V.: A cutting plane method for quadratic semi-infinite programming problems. Optimization19, 803–817 (1988). · Zbl 0664.90073
[14] van der Waerden, B. L.: Algebra. Berlin: Springer 1966.
[15] WASP-III (Wien Automatic System Planning Package, a Computer Code for Power Generating System Expansion Planning), User’s Manual, International Atomic Energy Agency (IAEA), Vienna, Austria (1980).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.