- Benson, H.P.: ‘Concave minimization: Theory, applications and algorithms’, in R. Horst, and P.M. Pardalos (eds.): Handbook global optimization, Kluwer Acad. Publ., 1995, pp. 43–148.Google Scholar
- Benson, H.P.: ‘Deterministic algorithms for constrained concave minimization: A unified critical survey’, Naval Res. Logist.73 (1996), 765–795.MathSciNetGoogle Scholar
- Benson, H.P., and Boger, G.M.: ‘Multiplicative programming problems: Analysis and efficient point search heuristic’, J. Optim. Th. Appl.94 (1997), 487–510.MathSciNetzbMATHGoogle Scholar
- Garfinkel, R.S., and Nemhauser, G.L.: Integer programming, Wiley, 1972.Google Scholar
- Giannessi, F., and Niccolucci, F.: ‘Connections between nonlinear and integer programming problems’, Symp. Mat. Inst. Naz. di Alta Mat.19 (1976), 161–176.MathSciNetGoogle Scholar
- Horst, R., Pardalos, P.M., and Thoai, N.V.: Introduction to global optimization, Kluwer Acad. Publ., 1995.Google Scholar
- Horst, R., and Tuy, H.: Global optimization: Deterministic approaches, second revised ed., Springer, 1993.Google Scholar
- Kalantari, B.: ‘Quadratic functions with exponential number of local maxima’, Oper. Res. Lett.5 (1986), 47–49.MathSciNetzbMATHGoogle Scholar
- Kalantari, B., and Rosen, J.B.: ‘Penalty for zero-one integer equivalent problems’, Math. Program.24 (1982), 229–232.MathSciNetzbMATHGoogle Scholar
- Konno, H., and Kuno, T.: ‘Multiplicative programming problems’, in R. Horst, and P.M. Pardalos (eds.): Handbook Global Optim., Kluwer Acad. Publ., 1995, pp. 369–405.Google Scholar
- Pardalos, P.M.: ‘On the passage from local to global in optimization’, in J.R. Birge, and K.G. Murty (eds.): Mathematical Programming: State of the Art, Braun-Brumfield, 1994, pp. 220–247.Google Scholar
- Pardalos, P.M., and Rosen, J.B.: Constrained global optimization: Algorithms and applications, Springer, 1987.Google Scholar
- Pardalos, P.M., and Schnitger, G.: ‘Checking local optimality in constrained quadratic programming is NP-hard’, Oper. Res. Lett.7 (1988), 33–35.MathSciNetzbMATHGoogle Scholar
- Rockafellar, R.T.: Convex analysis, Princeton Univ. Press, 1970.Google Scholar
- Benson HP (1995) Concave minimization: Theory, applications and algorithms. In: Horst R, Pardalos PM (eds) Handbook global optimization. Kluwer, Dordrecht, pp 43–148Google Scholar
- Benson HP (1996) Deterministic algorithms for constrained concave minimization: A unified critical survey. Naval Res Logist 73:765–795MathSciNet3.0.CO%3B2-2'>CrossRefGoogle Scholar
- Benson HP, Boger GM (1997) Multiplicative programming problems: Analysis and efficient point search heuristic. J Optim Th Appl 94:487–510zbMATHMathSciNetCrossRefGoogle Scholar
- Garfinkel RS, Nemhauser GL (1972) Integer programming. Wiley, New YorkzbMATHGoogle Scholar
- Giannessi F, Niccolucci F (1976) Connections between nonlinear and integer programming problems. Symp Mat Inst Naz di Alta Mat 19:161–176MathSciNetGoogle Scholar
- Horst R, Pardalos PM, Thoai NV (1995) Introduction to global optimization. Kluwer, DordrechtzbMATHGoogle Scholar
- Horst R, Tuy H (1993) Global optimization: Deterministic approaches, 2nd revised edn. Springer, BerlinGoogle Scholar
- Kalantari B (1986) Quadratic functions with exponential number of local maxima. Oper Res Lett 5:47–49zbMATHMathSciNetCrossRefGoogle Scholar
- Kalantari B, Rosen JB (1982) Penalty for zero-one integer equivalent problems. Math Program 24:229–232zbMATHMathSciNetCrossRefGoogle Scholar
- Konno H, Kuno T (1995) Multiplicative programming problems. In: Horst R, Pardalos PM (eds) Handbook Global Optim. Kluwer, Dordrecht, pp 369–405Google Scholar
- Pardalos PM (1994) On the passage from local to global in optimization. In: Birge JR, Murty KG (eds) Mathematical Programming: State of the Art. Braun-Brumfield, Ann Arbor, MI, pp 220–247Google Scholar
- Pardalos PM, Rosen JB (1987) Constrained global optimization: Algorithms and applications. Springer, BerlinzbMATHGoogle Scholar
- Pardalos PM, Schnitger G (1988) Checking local optimality in constrained quadratic programming is NP-hard. Oper Res Lett 7:33–35zbMATHMathSciNetCrossRefGoogle Scholar
- Rockafellar RT (1970) Convex analysis. Princeton Univ. Press, PrincetonzbMATHGoogle Scholar
Several theorems concerning the concave programming problem are formulated and proved. On the basis of the theorems a combinatorial algorithm for. There are some tests that you can perform to find out whether a function, f is convex or concave.