|
|
|
|
| LEADER |
01407nam a2200325 a 4500 |
| 001 |
c000162363 |
| 003 |
CARM |
| 005 |
20010812000000.0 |
| 008 |
910807s1991 gw a b 000 0 eng |
| 010 |
|
|
|a 91029163
|
| 019 |
1 |
|
|a 8457697
|5 LACONCORD2021
|
| 020 |
|
|
|a 0387545093
|b (U.S. : acid-free paper)
|
| 035 |
|
|
|a (OCoLC)24377540
|5 LACONCORD2021
|
| 040 |
|
|
|a DLC
|b eng
|c DLC
|d DLC
|d LC
|
| 050 |
0 |
0 |
|a QA402.5
|b .U55 1991
|
| 082 |
0 |
0 |
|a 519.7/2
|2 20
|
| 245 |
0 |
2 |
|a A Unified approach to interior point algorithms for linear complementarity problems /
|c M. Kojima ... [et al.].
|
| 246 |
3 |
|
|a Interior point algorithms for linear complimentarity problems.
|
| 260 |
|
|
|a Berlin ;
|a New York :
|b Springer-Verlag,
|c c1991.
|
| 300 |
|
|
|a viii, 108 p. :
|b ill. ;
|c 25 cm.
|
| 440 |
|
0 |
|a Lecture notes in computer science ;
|v 538.
|
| 500 |
|
|
|a Spine title: Interior point algorithms for linear complementarity problems.
|
| 504 |
|
|
|a Includes bibliographical references (p. [103]-108).
|
| 650 |
|
0 |
|a Interior-point methods.
|
| 650 |
|
0 |
|a Linear programming.
|
| 700 |
1 |
|
|a Kojima, M.
|q (Masakazu),
|d 1947-
|
| 740 |
0 |
|
|a Interior point algorithms for linear complimentarity problems.
|
| 852 |
8 |
|
|b CARM
|h A2:AM07E0
|i C05492
|p 0214317
|f BK
|
| 999 |
f |
f |
|i 6bd81adc-d0ad-5566-9eff-12b141bfa821
|s cb153260-4f76-5b44-8b83-d4689108a709
|
| 952 |
f |
f |
|p Can circulate
|a CAVAL
|b CAVAL
|c CAVAL
|d CARM 1 Store
|e C05492
|f A2:AM07E0
|h Other scheme
|i book
|m 0214317
|