| Tag |
First Indicator |
Second Indicator |
Subfields |
| LEADER |
00000cam a2200000Ma 4500 |
| 001 |
in00003554705 |
| 006 |
m o d |
| 007 |
cr nn||||||||| |
| 008 |
121227s1989 nyua o 000 0 eng d |
| 005 |
20260420215547.2 |
| 020 |
|
|
|a 9781461396178 (electronic bk.)
|
| 020 |
|
|
|a 1461396174 (electronic bk.)
|
| 035 |
|
|
|a (OCoLC)840283083
|
| 040 |
|
|
|a I9W
|b eng
|e pn
|c I9W
|d OCLCQ
|d UV0
|d GW5XE
|d OCLCF
|d UtOrBLW
|
| 049 |
|
|
|a TXAM
|
| 050 |
|
4 |
|a QA76.6-76.66
|
| 082 |
0 |
4 |
|a 005.11
|2 23
|
| 100 |
1 |
|
|a Megiddo, Nimrod.
|
| 245 |
1 |
0 |
|a Progress in Mathematical Programming :
|b Interior-Point and Related Methods /
|c edited by Nimrod Megiddo.
|
| 264 |
|
1 |
|a New York, NY :
|b Springer New York,
|c 1989.
|
| 300 |
|
|
|a 1 online resource (X, 158 pages 8 illustrations)
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 520 |
|
|
|a The starting point of this volume was a conference entitled "Progress in Mathematical Programming", held at the Asilomar Conference Center in Pacific Grove, California, March 1-4, 1987. The main topic of the conference was developments in the theory and practice of linear programming since Karmarka's algorithm. Presentations included new algorithms, new analysis of algorithms, reports on computational experience, and some other topics related to the practice of mathematical programming.
|
| 505 |
0 |
|
|a Contents: An Algorithm for Solving Linear Programming Programs in O(n3L) Operations -- A Primal-Dual Interior Point Algorithm for Linear Programming -- An Extension of Karmarkar's Algorithm and the Trust Region Method for Quadratic Programming -- Approximate Projections in a Projective Method for the Linear Feasibility Problem -- A Locally Well-Behaved Potential Function and a Simple Newton-Type Method for Finding the Center of a Polytype -- A Note on Comparing Simplex and Interior Methods for Linear Programming -- Pricing Criteria in Linear Programming -- Pathways to the Optimal Set in Linear Programming.
|
| 500 |
|
|
|a Electronic resource.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
7 |
|a Algorithms.
|2 fast
|0 (OCoLC)fst00805020
|
| 650 |
|
7 |
|a Computer science.
|2 fast
|0 (OCoLC)fst00872451
|
| 655 |
|
7 |
|a Electronic books.
|2 local
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 856 |
4 |
0 |
|u http://proxy.library.tamu.edu/login?url=https://link.springer.com/10.1007/978-1-4613-9617-8
|z Connect to the full text of this electronic book
|t 0
|
| 994 |
|
|
|a 92
|b TXA
|
| 999 |
|
|
|a MARS
|
| 999 |
f |
f |
|s d8f49b9d-d875-39e5-b6ae-7b33073d4895
|i 5f7d4682-a2b7-367b-bfba-de9d260d042f
|t 0
|
| 952 |
f |
f |
|a Texas A&M University
|b College Station
|c Electronic Resources
|s www_evans
|d Available Online
|t 0
|e QA76.6-76.66
|h Library of Congress classification
|
| 998 |
f |
f |
|a QA76.6-76.66
|t 0
|l Available Online
|