Summary
A branch and bound method is proposed for solving a very general class of global multiextremal decision problems where the objective is the sum of a convex and a concave function and the feasible set is the intersection of a convex set with the complement of a convex set.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avriel M, Williams AC (1971) An extension of geometric programming with applications in engineering optimization. J Eng Math 5:187–194
Bansal PP, Jacobsen SE (1975) Characterization of local solutions for a class of noncon-vex programs. J Optim Theory and Appl 15:549–564
Bansal PP, Jacobsen SE (1975) An algorithm for optimization network flow capacity under economies-of-scale. J Optim Theory and Appl 15:565–586
Hillestad RJ (1975) Optimization problems subject to budget-constraint with economies of scale. Oper Res 23:1091–1098
Hillestad RJ, Jacobsen SE (1980) Reverse convex programming. Appl Math Optim 6:63–78
Horst R (1976) An algorithm for nonconvex programming problems. Math Programming 10:312–321
Horst R (1984) On the global minimization of concave functions. OR Spektrum 6:195–206
Horst R (1986) A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization. J Optim Theory and Appl 51:271–291
Horst R, Tuy H (1987) On the convergence of global methods in multiextremal optimization. J Optim Theory and Appl 54:253–272
Rockafellar R (1970) Convex Analysis. Princeton University Press, Princeton
Tuy H (1986) Global minimization of a difference of two convex functions. Preprint, Institute of Mathematics, Hanoi
Tuy H, Horst R (1986) Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c.-optimization problems. Preprint, Universität Oldenburg, submitted
Tuy H, Khatchaturov V, Utkin S (1986) A class of exhaustive cone splitting procedures in conical algorithms for concave minimization. Preprint 11, July 86, Institute for Mathematics, Hanoi
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Horst, R., Van Dien, L. (1987). A Solution Concept for a Very General Class of Decision Problems. In: Opitz, O., Rauhut, B. (eds) Ökonomie und Mathematik. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-72672-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-72672-9_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-72673-6
Online ISBN: 978-3-642-72672-9
eBook Packages: Springer Book Archive