article

Free access

Algorithm 431: A computer routine for quadratic and linear programming problems [H]

Author:

Arunachalam RavindranAuthors Info & Claims

Communications of the ACM, Volume 15, Issue 9

Pages 818 - 820

https://doi.org/10.1145/361573.1015087

Published: 01 September 1972 Publication History

PDF eReader

References

[1]

1. Dantzig, G. B. Linear Programming and Extensions. Princeton U. Press. Princeton, N.J. 1963.

Google Scholar

[2]

2. Lemke, C.E. Bimatrix equilibrium points and mathematical programming. Management Sci. II (1965). 681-689.

Digital Library

Google Scholar

[3]

3. Ravindran, A. Computational aspects of Lemke's coniplementary algorithm applied to linear programs. Opsearch 7 (1970). 241-262.

Google Scholar

[4]

4. Ravindran, A. A comparison of the primal-simplex and complementary pivot methods for linear programming. Rep. No. 70-9 (July 1970), School of Industrial Engineering, Purdue U., Lafayette, Ind.

Google Scholar

Cited By

View all

Babb A(2022)A brief genealogy of the Thrifty Food PlanFood, Culture & Society10.1080/15528014.2022.207207327:1(174-201)Online publication date: 20-May-2022
https://doi.org/10.1080/15528014.2022.2072073
Babb A(2019)America’s “Thrifty Food Plan”: Hunger, Mathematics, and the Valuation of Nutrition AssistanceAnnals of the American Association of Geographers10.1080/24694452.2019.1664889110:4(983-1004)Online publication date: 22-Oct-2019
https://doi.org/10.1080/24694452.2019.1664889
Ghose AOtt GHudkins R(2016)Technically Extended MultiParameter Optimization (TEMPO): An Advanced Robust Scoring Scheme To Calculate Central Nervous System Druggability and Monitor Lead OptimizationACS Chemical Neuroscience10.1021/acschemneuro.6b002738:1(147-154)Online publication date: 26-Oct-2016
https://doi.org/10.1021/acschemneuro.6b00273
Show More Cited By

Recommendations

Quadratic programming problems and related linear complementarity problems

This paper investigates the general quadratic programming problem, i.e., the problem of finding the minimum of a quadratic function subject to linear constraints. In the case where, over the set of feasible points, the objective function is bounded from ...
A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs

This paper develops a linear-programming-based branch-and-bound algorithm for mixed-integer conic quadratic programs. The algorithm is based on a known higher-dimensional or lifted polyhedral relaxation of conic quadratic constraints. The algorithm is ...
Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm

In this paper, we present an original method to solve convex bilevel programming problems in an optimistic approach. Both upper and lower level objective functions are convex and the feasible region is a polyhedron. The enumeration sequential linear ...

Comments

Information & Contributors

Information

Published In

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1972

Published in CACM Volume 15, Issue 9

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

50
Total Citations
View Citations
583
Total Downloads

Downloads (Last 12 months)86
Downloads (Last 6 weeks)18

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Babb A(2022)A brief genealogy of the Thrifty Food PlanFood, Culture & Society10.1080/15528014.2022.207207327:1(174-201)Online publication date: 20-May-2022
https://doi.org/10.1080/15528014.2022.2072073
Babb A(2019)America’s “Thrifty Food Plan”: Hunger, Mathematics, and the Valuation of Nutrition AssistanceAnnals of the American Association of Geographers10.1080/24694452.2019.1664889110:4(983-1004)Online publication date: 22-Oct-2019
https://doi.org/10.1080/24694452.2019.1664889
Ghose AOtt GHudkins R(2016)Technically Extended MultiParameter Optimization (TEMPO): An Advanced Robust Scoring Scheme To Calculate Central Nervous System Druggability and Monitor Lead OptimizationACS Chemical Neuroscience10.1021/acschemneuro.6b002738:1(147-154)Online publication date: 26-Oct-2016
https://doi.org/10.1021/acschemneuro.6b00273
McClure MHorne RMcClure MHorne R(2013)ResultsDiscrete Fracture Network Modeling of Hydraulic Stimulation10.1007/978-3-319-00383-2_3(49-72)Online publication date: 15-Jun-2013
https://doi.org/10.1007/978-3-319-00383-2_3
Ritz EPollard D(2012)Stick, slip, and opening of wavy frictional faults: A numerical approach in two dimensionsJournal of Geophysical Research: Solid Earth10.1029/2011JB008624117:B3Online publication date: 10-Mar-2012
https://doi.org/10.1029/2011JB008624
Ritz EMutlu OPollard D(2012)Integrating complementarity into the 2D displacement discontinuity boundary element method to model faults and fractures with frictional contact propertiesComputers & Geosciences10.1016/j.cageo.2011.11.01745(304-312)Online publication date: 1-Aug-2012
https://dl.acm.org/doi/10.1016/j.cageo.2011.11.017
Nanda S(2011)Variational Inequality and Complementarity ProblemTopics in Nonconvex Optimization10.1007/978-1-4419-9640-4_4(63-78)Online publication date: 21-May-2011
https://doi.org/10.1007/978-1-4419-9640-4_4
Mutlu OPollard D(2008)On the patterns of wing cracks along an outcrop scale flaw: A numerical modeling approach using complementarityJournal of Geophysical Research: Solid Earth10.1029/2007JB005284113:B6Online publication date: 14-Jun-2008
https://doi.org/10.1029/2007JB005284
Kostreva M(2008)Lemke MethodEncyclopedia of Optimization10.1007/978-0-387-74759-0_331(1868-1870)Online publication date: 2008
https://doi.org/10.1007/978-0-387-74759-0_331
Crump JSeinfeld J(2007)Further Results on Inversion of Aerosol Size Distribution Data: Higher-Order Sobolev Spaces and ConstraintsAerosol Science and Technology10.1080/027868282089586011:4(363-369)Online publication date: 5-Jun-2007
https://doi.org/10.1080/02786828208958601
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Recommendations

Quadratic programming problems and related linear complementarity problems

A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs

Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations