Abstract
Low-rank problems are nothing but nonlinear minimization problems over polyhedrons where a linear transformation of the variables provides an objective function which actually depends on very few variables. These problems are often used in applications, for example, in concave quadratic minimization problems, multiobjective/bicriteria programs, location–allocation models, quantitative management science, data envelopment analysis, efficiency analysis and performance measurement. The aim of this paper is to deepen on the study of a solution method for a class of rank-two nonconvex problems having a polyhedral feasible region expressed by means of inequality/box constraints and an objective function of the kind \(\phi (c^Tx+c_0,d^Tx+d_0)\). The rank-two structure of the problem allows to determine various localization conditions and underestimation functions. The stated theoretical conditions allow to determine a solution algorithm for the considered class of rank-two problems whose performance is witnessed by means of a deep computational test.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bajalinov, E.B.: Linear-Fractional Programming Theory, Methods, Applications and Software. Applied Optimization, vol. 84. Springer, New York (2003). https://doi.org/10.1007/978-1-4419-9174-4
Barros, A.I.: Discrete and Fractional Programming Techniques for Location Models. Combinatorial Optimization, vol. 3. Kluwer Academic Publishers, Dordrecht (1998). https://doi.org/10.1007/978-1-4615-4072-4
Bomze, I.M., Csendes, T., Horst, R. (eds.): Developments in Global Optimization. Nonconvex Optimization and Its Applications, vol. 18. Kluwer Academic Publishers, Dordrecht (1997). https://doi.org/10.1007/978-1-4757-2600-8
Cambini, A., Martein, L.: Generalized Convexity and Optimization: Theory and Applications. Lecture Notes in Economics and Mathematical Systems, vol. 616. Springer, Berlin (2009). https://doi.org/10.1007/978-3-540-70876-6
Cambini, R., Sodini, C.: A finite algorithm for a particular d.c. quadratic programming problem. Ann. Oper. Res. 117, 33–49 (2002). https://doi.org/10.1023/A:1021509220392
Cambini, R., Sodini, C.: A finite algorithm for a class of nonlinear multiplicative programs. J. Global Optim. 26, 279–296 (2003). https://doi.org/10.1023/A:1023279306921
Cambini, R., Sodini, C.: A sequential method for a class of box constrained quadratic programming problems. Math. Methods Oper. Res. 67(2), 223–243 (2008). https://doi.org/10.1007/s00186-007-0173-x
Cambini, R., Sodini, C.: Global optimization of a rank-two nonconvex program. Math. Methods Oper. Res. 71(1), 165–180 (2010). https://doi.org/10.1007/s00186-009-0289-2
Cambini, R., Sodini, C.: On the minimization of a class of generalized linear functions on a flow polytope. Optimization 63(10), 1449–1464 (2014). https://doi.org/10.1080/02331934.2013.852548
Cambini, R., Venturi, I.: An algorithmic approach for a class of large dimension rank-two nonconvex programs. IMA J. Manag. Math. (2020). https://doi.org/10.1093/imaman/dpaa001
Charnes, A., Cooper, W.W., Rhodes, E.: Measuring the efficiency of decision making units. Eur. J. Oper. Res. 2(6), 429–444 (1978). https://doi.org/10.1016/0377-2217(78)90138-8
Cooper, W.W., Seiford, L.M., Zhu, J. (eds.): Handbook on Data Envelopment Analysis. International Series in Operations Research and Management Science, vol. 71. Kluwer Academic Publishers, Boston (2004). https://doi.org/10.1007/b105307
Frenk, J.B.G., Schaible, S.: Fractional programming. In: Handbook of Generalized Convexity and Generalized Monotonicity, Nonconvex Optimization and Its Applications, vol. 76, pp. 335–386. Springer, New York. https://doi.org/10.1007/b101428. (2005)
Horst, R., Pardalos, P.M. (eds.): Handbook of Global Optimization. Nonconvex Optimization and Its Applications, vol. 2. Kluwer Academic Publishers, Dordrecht (1995). https://doi.org/10.1007/978-1-4615-2025-2
Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches, 3rd edn. Springer, Berlin (1996). https://doi.org/10.1007/978-3-662-03199-5
Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization. Nonconvex Optimization and Its Applications, vol. 48, 2nd edn. Kluwer Academic Publishers, Dordrecht (2001)
Konno, H., Kuno, T.: Multiplicative programming problems. In: Horst, R., Pardalos, P.M. (eds.) Nonconvex Optimization and Its Applications. Handbook of Global Optimization, vol. 2, pp. 369–405. Kluwer Academic Publishers, Dordrecht (1995). https://doi.org/10.1007/978-1-4615-2025-2
Konno, H., Yajima, Y., Matsui, T.: Parametric simplex algorithms for solving a special class of nonconvex minimization problems. J. Global Optim. 1, 65–82 (1991). https://doi.org/10.1007/BF00120666
Konno, H., Thach, P.T., Tuy, H.: Optimization on Low Rank Nonconvex Structures. Nonconvex Optimization and Its Applications, vol. 15. Kluwer Academic Publishers, Dordrecht (1997). https://doi.org/10.1007/978-1-4615-4098-4
Kuno, T.: A practical algorithm for minimizing a rank-two saddle function on a polytope. J. Oper. Res. Soc. Jpn. 39, 63–76 (1996)
Mjelde, K.M.: Methods of the Allocation of Limited Resources. Wiley, New York (1983)
Ryoo, H.-S., Sahinidis, N.V.: Global optimization of multiplicative programs. J. Global Optim. 26, 387–418 (2003). https://doi.org/10.1023/A:1024700901538
Schaible, S.: Fractional programming. In: Horst, R., Pardalos, P.M. (eds.) Nonconvex Optimization and Its Applications. Handbook of Global Optimization, vol. 2, pp. 495–608. Kluwer Academic Publishers, Dordrecht (1995). https://doi.org/10.1007/978-1-4615-2025-2_10
Tuy, H.: Convex Analysis and Global Optimization, vol. 110, 2nd edn. Springer, New York (2016). https://doi.org/10.1007/978-3-319-31484-6
Acknowledgements
Careful reviews by the anonymous referees are gratefully acknowledged.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Cambini, R. Underestimation functions for a rank-two partitioning method. Decisions Econ Finan 43, 465–489 (2020). https://doi.org/10.1007/s10203-020-00288-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10203-020-00288-6
Keywords
- Nonlinear programming
- Low-rank structures
- Optimal level solutions
- Global optimization
- Large dimension problems