A new technique for generating quadratic programming test problems


This paper describes a new technique for generating convex, strictly concave and indeenite (bilinear or not) quadratic programming problems. These problems have a number of properties that make them useful for test purposes. For example, strictly concave quadratic problems with their global maximum in the interior of the feasible domain and with an… (More)
DOI: 10.1007/BF01582148


  • Presentations referencing similar topics