Abstract
An optimization problem is described, that arises in telecommunications and is associated with multiple cross-sections of a single power cable used to supply remote telecom equipments. The problem consists of minimizing the volume of copper material used in the cables and consequently the total cable cost. Two main formulations for the problem are introduced and some properties of the functions and constraints involved are presented. In particular it is shown that the optimization problems are convex and have a unique optimal solution. A Projected Gradient algorithm is proposed for finding the global minimum of the optimization problem, taking advantage of the particular structure of the second formulation. An analysis of the performance of the algorithm for given real-life problems is also presented.
Similar content being viewed by others
References
Anunciada V (2003) Cost minimization of a multiple section energy cable supplying remote telecom equipments. Technical report, Instituto de Telecomunicações, Portugal
Bazaraa M, Sherali H, Shetty C (1993) Nonlinear programming: theory and algorithms. Wiley, New York
Bertsekas D (1999) Nonlinear programming. Athena Scientific, Massachusetts
Bertsekas DP (1976) On the Goldstein–Levitin–Polyak gradient projection method. IEEE Trans Autom Control 21:174–184
Birgin EG, Martinez JM, Raydan M (2000) Nonmonotone spectral projected gradient methods on convex sets. SIAM J Optim 10:1196–1211
Cottle RW, Pang JS, Stone RE (1992) The linear complementarity problem. Academic Press, New York
DeCarlo R (2001) Linear circuit analysis, 2nd edn. Pen-Lin Min, Oxford
Dennis JE, Schnabel RB (1996) Numerical methods for unconstrained optimization and nonlinear equations. SIAM, Philadelphia
Dussault JP, Ferland JA, Lemaire B (1986) Convex quadratic programming with one constraint and bounded variables. Math Program 36:90–104
Feynman RP, Leighton RB, Sands M (1963) The Feynman lectures on physics. Addison-Wesley, New York
Hehl ME (1987) Linguagem de programação estruturada FORTRAN 77. McGraw-Hill, São Paulo
Júdice JJ, Pires FM (1992) Solution of large-scale separable strictly convex quadratic programs on the simplex. Linear Algebra Appl 170:214–220
Martos B (1975) Nonlinear programming: theory and methods. North-Holland, New York
Murtagh BA, Saunders MA (1987) MINOS 5.1 user guide. Technical report, Department of Operations Research, Stanford University
Pardalos PM, Kovoor N (1990) An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds. Math Program 46:321–328
Author information
Authors and Affiliations
Corresponding author
Additional information
V. Anunciada passed away on September 29, 2007.
Rights and permissions
About this article
Cite this article
Júdice, J.J., Anunciada, V. & Baptista, C.P. Cost minimization of a multiple section power cable supplying several remote telecom equipment. Optim Eng 9, 273–290 (2008). https://doi.org/10.1007/s11081-007-9034-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11081-007-9034-y