Crossref journal-article
Springer Science and Business Media LLC
Operations-Research-Spektrum (297)
Authors 1
  1. R. Horst (first)
References 51 Referenced 58
  1. Al-Khayyal F, Falk I (1983) Jointly constrained biconvex programming. Math Oper Res 8:273–286 (10.1287/moor.8.2.273) / Math Oper Res by F Al-Khayyal (1983)
  2. Altman M (1968) Bilinear programming. Bull Acad Polon Sci Ser Sci Math Astronom Phys 16:741–746 / Bull Acad Polon Sci Ser Sci Math Astronom Phys by M Altman (1968)
  3. Balas E (1975) Nonconvex quadratic programming problems via generalized polars. SIAM J Appl Math 28:335–349 (10.1137/0128029) / SIAM J Appl Math by E Balas (1975)
  4. Balas E, Burdet CA (1973) Maximizing a convex quadratic function subject to linear constraints. Management Sci. Report No. 299, GSIA, Carnegie-Medon University, Pittsburgh, P / Management Sci. Report No. 299 by E Balas (1973)
  5. Bali S (1973) Minimization of a concave function on a bounded convex polyhedron. PhD Dissertation, University of California, Los Angeles / PhD Dissertation by S Bali (1973)
  6. Ban VT (1982) A finite algorithm for minimizing a concave function under linear constraints and its applications. Preprint, Institute of Mathematics, Hanoi / A finite algorithm for minimizing a concave function under linear constraints and its applications by VT Ban (1982)
  7. Benson H (1984) A finite algorithm for concave minimization over a polyhedron, Paper presented at the TIMS/ORSA meeting. San Francisco 1984
  8. Cabot AV (1974) Variations on a cutting plane method for solving concave minimization problems with linear constraints. Naval Res Logist Qu 21:265–274 (10.1002/nav.3800210206) / Naval Res Logist Qu by AV Cabot (1974)
  9. Cabot AV, Francis RL (1970) Solving certain nonconvex quadratic minimization problems by ranking the extreme points. Oper Res 18:82–86 (10.1287/opre.18.1.82) / Oper Res by AV Cabot (1970)
  10. Carillo MI (1977) A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron. Math Programming 13:69–80 (10.1007/BF01584324) / Math Programming by MI Carillo (1977)
  11. Falk I, Hoffmann KL (1976) A successive underestimation method for concave minimization problems. Math Oper Res 1:251–259 (10.1287/moor.1.3.251) / Math Oper Res by I Falk (1976)
  12. Falk I, Hoffmann KL (1982) Concave minimization via collapsing polytopes. Preprint T-438, The George Washington University, Washington, DC / Preprint T-438 by I Falk (1982)
  13. Falk I, Soland RM (1969) An algorithm for separable nonconvex programming problems. Manag Sci 15:550–569 (10.1287/mnsc.15.9.550) / Manag Sci by I Falk (1969)
  14. Gallo G, Ulkucu A (1977) Bilinear programming: an exact algorithm. Math Programming 12:173–194 (10.1007/BF01593787) / Math Programming by G Gallo (1977)
  15. Glover F (1973) Concave programming applied to a special class of 0–1 integer programs. Oper Res 21:135–140 (10.1287/opre.21.1.135) / Oper Res by F Glover (1973)
  16. Gould FJ, Tolle JW (1983) Complementary pivoting on a pseudomanifold structure with applications in the decision scienes. Heldermann, Berlin / Complementary pivoting on a pseudomanifold structure with applications in the decision scienes by FJ Gould (1983)
  17. Hoffmann KL (1975) A successive underestimating method for concave minimization problems. PhD Dissertation, The George Washington University, Washington, DC / PhD Dissertation by KL Hoffmann (1975)
  18. Hoffmann KL (1981) A method for globally minimizing concave functions over convex sets. Math Programming 20:22–32 (10.1007/BF01589330) / Math Programming by KL Hoffmann (1981)
  19. Horst R (1976) Zur Charakterisierung affin-linearer Hüllfunktionale. ZAMM 56:T347-T348 (10.1002/zamm.19765613161) / ZAMM by R Horst (1976)
  20. Horst R (1976) A new branch-and-bound approach for concave minimization problems. Lecture Notes in Computer Sciences 41:330–337 (10.1007/3-540-07623-9_296) / Lecture Notes in Computer Sciences by R Horst (1976)
  21. Horst R (1976) An algorithm for nonconvex programming problems. Math Programming 10:312–321 (10.1007/BF01580678) / Math Programming by R Horst (1976)
  22. Horst R (1979) Nichtlineare Optimierung. Carl Hanser, München / Nichtlineare Optimierung by R Horst (1979)
  23. Horst R (1980) A note on the convergence of an algorithm for nonconvex programming problems. Math Programming 19:237–238 (10.1007/BF01581645) / Math Programming by R Horst (1980)
  24. Horst R (1982) Konkave Minimierungsprobleme in Operations Research. OR-Proceeding 1981:580–591 / OR-Proceeding by R Horst (1982)
  25. Horst R (1984) On the convexification of nonlinear programming problems: An applications-oriented survey. Eur J Oper Res 15:382–392 (10.1016/0377-2217(84)90107-3) / Eur J Oper Res by R Horst (1984)
  26. Jacobsen SE (1981) Convergence of a Tuy-Type-Algorithm for concave minimization subject to linear inequality constraints. Appl Math Optim 7:1–9 (10.1007/BF01442106) / Appl Math Optim by SE Jacobsen (1981)
  27. Kelly JE (1960) The cutting plane method for solving convex programs. SIAM J Appl Math 8:703–712 (10.1137/0108053) / SIAM J Appl Math by JE Kelly (1960)
  28. Koehler G, Whinston AB, Wright GP (1975) Optimization over Leontiev substitution systems. North Holland, Amsterdam / Optimization over Leontiev substitution systems by G Koehler (1975)
  29. Kough PF (1979) The indefinite quadratic programming problem. Oper Res 27:516–533 (10.1287/opre.27.3.516) / Oper Res by PF Kough (1979)
  30. Konno H (1976) A cutting plane algorithm for solving bilinear programs. Math Programming 11:14–27 (10.1007/BF01580367) / Math Programming by H Konno (1976)
  31. Konno H (1976) Maximization of a convex quadratic function subject to linear constraints. Math Programming 11:117–127 (10.1007/BF01580380) / Math Programming by H Konno (1976)
  32. Majthai A, Whinston A (1974) Quasiconcave minimization subject to linear constraints. Discrete Math 9:35–59 (10.1016/0012-365X(74)90070-3) / Discrete Math by A Majthai (1974)
  33. Mangassarian OL (1978) Characterization of linear complementarity problems as linear programs. Math Programming Study 7:74–88 (10.1007/BFb0120783) / Math Programming Study by OL Mangassarian (1978)
  34. Meyer PA (1966) Probabilité et potentiels. Herman, Paris / Probabilité et potentiels by PA Meyer (1966)
  35. Ragavachari M (1969) On connections between zero-one integer programming and concave programming under linear constraints. Oper Res 17:680–684 (10.1287/opre.17.4.680) / Oper Res by M Ragavachari (1969)
  36. Rockafellar RT (1970) Convex Analysis. Princeton University Press, Princeton (10.1515/9781400873173) / Convex Analysis by RT Rockafellar (1970)
  37. Rosen JB (1983) Global minimization of a linearly constrained concave function by partition of the feasible domain. Math Oper Res 8:215–230 (10.1287/moor.8.2.215) / Math Oper Res by JB Rosen (1983)
  38. Sheraly HD, Shetty CM (1980) A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts. Math Programming 19:14–31 (10.1007/BF01581626) / Math Programming by HD Sheraly (1980)
  39. Taha H (1973) Concave minimization over a convex polyhedron. Naval Res Logist Qu 20:533–548 (10.1002/nav.3800200313) / Naval Res Logist Qu by H Taha (1973)
  40. Thieu TV (1978) Relationship between bilinear programming and concave minimization under linear constraints. Acta Math Vietnamica 5:106–113 / Acta Math Vietnamica by TV Thieu (1978)
  41. Thoai NV, Tuy H (1980) Convergent algorithms for minimizing a concave function. Math Oper Res 5:556–566 (10.1287/moor.5.4.556) / Math Oper Res by NV Thoai (1980)
  42. Tuy H (1964) Concave programming under linear constraints. Dokl Adad Nauk SSSR 159:32–35 (Translated (1964): Soviet Math 5:1437-1440) / Dokl Adad Nauk SSSR by H Tuy (1964)
  43. Tuy H (1982) Global maximization of a convex function over a closed, convex, not necessarily bounded set. Cahiers de Mathématiques de la Décision No 8223, Université Paris-Dauphine
  44. Tuy H (1983) Global minimization of a difference of two convex functions. Preprint, Institute of Mathematics, Hanoi / Global minimization of a difference of two convex functions by H Tuy (1983)
  45. Tuy H (1983) On outer approximation methods for solving concave minimization problems. Report Nr. 108, Forschungsschwerpunkt Dynamische Systeme, Universität Bremen
  46. Veinott AF (1967) The supporting hyperplane method for unimodal programming. Oper Res 15:147–152 (10.1287/opre.15.1.147) / Oper Res by AF Veinott (1967)
  47. Veinott AF (1969) Minimum concave-cost solution of Leontief substitution models of multi-facility inventory systems. Oper Res 17:262–291 (10.1287/opre.17.2.262) / Oper Res by AF Veinott (1969)
  48. Zangwill WI (1966) A deterministic multi-product multifacility production and inventory model. Oper Res 14: 486–507 (10.1287/opre.14.3.486) / Oper Res by WI Zangwill (1966)
  49. Zhang XS, Rosen JB (1983) Global concave minimization. Discussion paper, Computer Science development, University of Minnesota
  50. Zwart PB (1973) Nonlinear programming: counterexamples to two global optimization algorithms. Oper Res 21:1260–1266 (10.1287/opre.21.6.1260) / Oper Res by PB Zwart (1973)
  51. Zwart PB (1974) Global maximization of a convex function with linear inequality constraints. Oper Res 22:602–609 (10.1287/opre.22.3.602) / Oper Res by PB Zwart (1974)
Dates
Type When
Created 20 years, 2 months ago (June 12, 2005, 4:45 a.m.)
Deposited 5 years, 4 months ago (April 7, 2020, 1:42 p.m.)
Indexed 1 month ago (July 28, 2025, 2:31 a.m.)
Issued 40 years, 9 months ago (Dec. 1, 1984)
Published 40 years, 9 months ago (Dec. 1, 1984)
Published Online 40 years, 9 months ago (Dec. 1, 1984)
Published Print 40 years, 9 months ago (Dec. 1, 1984)
Funders 0

None

@article{Horst_1984, title={On the global minimization of concave functions: Introduction and survey}, volume={6}, ISSN={1436-6304}, url={http://dx.doi.org/10.1007/bf01720068}, DOI={10.1007/bf01720068}, number={4}, journal={Operations-Research-Spektrum}, publisher={Springer Science and Business Media LLC}, author={Horst, R.}, year={1984}, month=dec, pages={195–205} }