A computational analysis of LCP methods for bilinear and concave quadratic programming
- 1 January 1991
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 18 (8) , 645-654
- https://doi.org/10.1016/0305-0548(91)90002-9
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A note on the solution of bilinear programming problems by reduction to concave minimizationMathematical Programming, 1988
- A parallel algorithm for constrained concave quadratic global minimizationMathematical Programming, 1988
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methodsJournal of Optimization Theory and Applications, 1988
- Constrained Global Optimization: Algorithms and ApplicationsPublished by Springer Nature ,1987
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cutsMathematical Programming, 1980
- Bilinear programming: An exact algorithmMathematical Programming, 1977
- A cutting plane algorithm for the bilinear programming problemNaval Research Logistics Quarterly, 1977
- Maximization of A convex quadratic function under linear constraintsMathematical Programming, 1976
- A cutting plane algorithm for solving bilinear programsMathematical Programming, 1976