article

Free access

A Mathematical Program Generator MPGENR

Editor: John R. Rice Authors:

William M. Michaels,

Richard P. O'NeillAuthors Info & Claims

ACM Transactions on Mathematical Software (TOMS), Volume 6, Issue 1

Pages 31 - 44

https://doi.org/10.1145/355873.355876

Published: 01 March 1980 Publication History

PDF eReader

References

[1]

CHARNES, A., RAIKE, W.M., STUTZ, J.D., AND WALTERS, A.S. On generation of test problems for linear programming codes. Comm. ACM 17, 10 (Oct. 1974), 583-586.

Crossref

Google Scholar

[2]

COLEVILLE, A R. A comparative study in nonlinear codes. Rep. No. 320-2949, IBM New York Scientific Center, June 1968.

Google Scholar

[3]

DEMBO, R.S., AND MULVEY, J M. On analysis and comparison of mathematical programming algorithms and software, in Computers and Mathematical Programming, W.W. White, Ed., National Bureau of Standards, 1978.

Google Scholar

[4]

FLETCHER, R. A new approach to variable metric algorithms. The Computer J. 13 (Aug. 1970), 317-322.

Google Scholar

[5]

GRAYBILL, F.A. Introductwn to Matrices w~th Applications in Stat~stws. Wadsworth Publishing Company, Belmont, Calif., 1969.

Google Scholar

[6]

GREENBERG, H.J. A course in LP systems. SIGMAP Newsletter (ACM) 14 (May 1973), 35.

Google Scholar

[7]

~.LINGMAN, D., NAPIER, A., AND STUTZ, J. NETGEN, a program for generating large scale capacitated assignment transportation, and minimum cost flow problems. Manage. Sci 5 (Jan. 1974), 814-821.

Google Scholar

[8]

KUHN, H.W., AND TUCKER, A W. Nonlinear programming. Proc. Second Berkeley Syrup. on Mathematical Statmtics and Probability, Berkeley, Calif., 1950, pp. 481-492.

Google Scholar

[9]

LASDON, L.S. Optimization Theory for Large Scale Systems. Macmillan, New York, 1972, pp. 73-77.

Google Scholar

[10]

MICHAELS, W.M., AND O'NEILL, R.P. LPGENR User's Guwle. Dept. Comptr. Sci., Louisiana State U., Baton Rouge, La., March 1978.

Google Scholar

[11]

MICHAELS, W.M., AND O'NEILL, R.P MPGENR User's Guwle. Dept. Comptr Sci., Lomsiana State U., Baton Rouge, La., March 1978.

Google Scholar

[12]

MICHAELS, W M., AND O'NEILL, R.P. NLPGNR User's Guide. Dept. Comptr. Sci., Louisiana State U., Baton Rouge, La., March 1978.

Google Scholar

[13]

ORCHARD-HAYS, W. Advanced L~near Programming Computing Techn~iues. McGraw-Hill, New York, 1968.

Google Scholar

[14]

ROSEN, J.B., AND SUZUKI, S. Construction of nonlinear programming test problems. Comm. ACM 8, 2 (Feb. 1965), 113.

Crossref

Google Scholar

[15]

System 360 Scientific Subroutine Package, Version III Programmer's Manual. IBM, 360A-CM- 03X, White Plains, N.Y., 1968

Google Scholar

[16]

TOMLIN, J.A. Computahonal standards for the mathematical programming society. SIGMAP Newsletter (ACM) 15 (Nov. 1973), 22-24.

Google Scholar

[17]

WAGNER, H. Principles of Operations Research. Prentice-Hall, Englewood Clefs, N.J., 1969.

Google Scholar

[18]

WHITEq W W. A status report on computing algorithms for mathematical programming. Comptg. Surveys 5 (Sept. 1973), 137-166.

Crossref

Google Scholar

[19]

WOLFE, P., AND CUTLER, L. Experiments in linear programming. In Recent Advances tn Mathemat~cal Programming, McGraw-HiU, New York, 1963.

Google Scholar

[20]

STAHA, R.L. Documentation for program comet, a constrained optimization code. Dept. Chem. Eng., U of Texas at Austin, Austin, Tex.

Google Scholar

Cited By

View all

Eiselt HSandblom CBarnsley C(1997)A computational investigation into shapes of polyhedraComputers and Industrial Engineering10.1016/S0360-8352(96)00057-532:1(19-28)Online publication date: 1-Jan-1997
https://dl.acm.org/doi/10.1016/S0360-8352%2896%2900057-5
Arthur JFrendewey J(1993)GENGUBComputers and Operations Research10.1016/0305-0548(93)90112-V20:6(565-573)Online publication date: 1-Aug-1993
https://dl.acm.org/doi/10.1016/0305-0548%2893%2990112-V
Calamai PVicente LJúdice J(1993)A new technique for generating quadratic programming test problemsMathematical Programming: Series A and B10.1007/BF0158214861:2(215-231)Online publication date: 3-Sep-1993
https://dl.acm.org/doi/10.1007/BF01582148
Show More Cited By

Index Terms

Recommendations

Design of a Random Number Generator from Fingerprint
ICCIS '10: Proceedings of the 2010 International Conference on Computational and Information Sciences

Security of a cryptographic system depends much on the randomness of random number used in the system. In this paper, a true random number generator based on the data of fingerprint (FPTRNG) is designed which extracts the random information from image ...
Quantum random number generator vs. random number generator
2016 International Conference on Communications (COMM)
A random number generator produces a periodic sequence of numbers on a computer. The starting point can be random, but after it is chosen, everything else is deterministic. A random number generator produces a periodic sequence of numbers on a computer. ...
Simple extractors for all min-entropies and a new pseudorandom generator

A “randomness extractor” is an algorithm that given a sample from a distribution with sufficiently high min-entropy and a short random seed produces an output that is statistically indistinguishable from uniform. (Min-entropy is a measure of the amount ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Transactions on Mathematical Software

ACM Transactions on Mathematical Software Volume 6, Issue 1

March 1980

134 pages

ISSN:0098-3500

EISSN:1557-7295

DOI:10.1145/355873

Editor:
John R. Rice
Purdue Univ., West Lafayette, IN

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1980

Published in TOMS Volume 6, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
405
Total Downloads

Downloads (Last 12 months)61
Downloads (Last 6 weeks)11

Reflects downloads up to 21 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Eiselt HSandblom CBarnsley C(1997)A computational investigation into shapes of polyhedraComputers and Industrial Engineering10.1016/S0360-8352(96)00057-532:1(19-28)Online publication date: 1-Jan-1997
https://dl.acm.org/doi/10.1016/S0360-8352%2896%2900057-5
Arthur JFrendewey J(1993)GENGUBComputers and Operations Research10.1016/0305-0548(93)90112-V20:6(565-573)Online publication date: 1-Aug-1993
https://dl.acm.org/doi/10.1016/0305-0548%2893%2990112-V
Calamai PVicente LJúdice J(1993)A new technique for generating quadratic programming test problemsMathematical Programming: Series A and B10.1007/BF0158214861:2(215-231)Online publication date: 3-Sep-1993
https://dl.acm.org/doi/10.1007/BF01582148
Jackson RBoggs PNash SPowell S(1990)Guidelines for reporting results of computational experiments. Report of the ad hoc committeeMathematical Programming: Series A and B10.5555/2794650.311365249:1-3(413-425)Online publication date: 1-Nov-1990
https://dl.acm.org/doi/10.5555/2794650.3113652
Jackson RBoggs PNash SPowell S(1990)Guidelines for reporting results of computational experiments. Report of the ad hoc committeeMathematical Programming10.1007/BF0158880149:1-3(413-425)Online publication date: Nov-1990
https://doi.org/10.1007/BF01588801
Bartels RJoe B(1989)On Generating Discrete Linear $l_\infty $ Test ProblemsSIAM Journal on Scientific and Statistical Computing10.5555/3029652.302966210:3(550-561)Online publication date: 1-May-1989
https://dl.acm.org/doi/10.5555/3029652.3029662
Bartels RJoe B(1989)On Generating Discrete Linear $l_\infty $ Test ProblemsSIAM Journal on Scientific and Statistical Computing10.1137/091003510:3(550-561)Online publication date: May-1989
https://doi.org/10.1137/0910035
Bartels RMahdavi-Amiri N(1986)On Generating Test Problems for Nonlinear Programming AlgorithmsSIAM Journal on Scientific and Statistical Computing10.1137/09070527:3(769-798)Online publication date: Jul-1986
https://doi.org/10.1137/0907052
Lenard MMinkoff M(1984)Randomly Generated Test Problems for Positive Definite Quadratic ProgrammingACM Transactions on Mathematical Software10.1145/356068.35607510:1(86-96)Online publication date: 1-Jan-1984
https://dl.acm.org/doi/10.1145/356068.356075
O’Neill R(1982)A Comparison of Real-World Linear Programs and Their Randomly Generated AnalogsEvaluating Mathematical Programming Techniques10.1007/978-3-642-95406-1_6(44-59)Online publication date: 1982
https://doi.org/10.1007/978-3-642-95406-1_6
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

References

Cited By

Index Terms

Recommendations

Design of a Random Number Generator from Fingerprint

Quantum random number generator vs. random number generator

Simple extractors for all min-entropies and a new pseudorandom generator

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

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations