Maximization of A convex quadratic function under linear constraints

This publication has 10 references indexed in Scilit:

• A cutting plane algorithm for solving bilinear programs
  Mathematical Programming, 1976
• Global Maximization of a Convex Function with Linear Inequality Constraints
  Operations Research, 1974
• Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
  Operations Research, 1973
• A linear max—min problem
  Mathematical Programming, 1973
• Computational aspects on the use of cutting planes in global optimization
  Published by Association for Computing Machinery (ACM) ,1971
• Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
  Operations Research, 1970
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
  Operations Research, 1969
• A method for solving maximum-problems with a nonconcave quadratic objective function
  Probability Theory and Related Fields, 1966
• The Maximization of a Quadratic Function of Variables Subject to Linear Inequalities
  Management Science, 1964
• Nonlinear Power of Adjacent Extreme Point Methods in Linear Programming
  Econometrica, 1957