Strathprints logo
Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

New variants of the criss-cross method for linearly constrained convex quadratic programming

Akkele, A.A. and Balogh, L. and Illes, T. (2004) New variants of the criss-cross method for linearly constrained convex quadratic programming. European Journal of Operational Research, 157 (1). pp. 74-86. ISSN 0377-2217

Full text not available in this repository. (Request a copy from the Strathclyde author)
Item type: Article
ID code: 9198
Keywords: linearly constrained convex quadratic optimization, linear complementarity problems, criss-cross type algorithms, Management. Industrial Management, Modelling and Simulation, Management Science and Operations Research, Information Systems and Management
Subjects: Social Sciences > Industries. Land use. Labor > Management. Industrial Management
Department: Strathclyde Business School > Management Science
Related URLs:
    Depositing user: Strathprints Administrator
    Date Deposited: 26 Mar 2010 14:55
    Last modified: 04 Sep 2014 19:38
    URI: http://strathprints.strath.ac.uk/id/eprint/9198

    Actions (login required)

    View Item