| Record ID | marc_columbia/Columbia-extract-20221130-004.mrc:61250613:1263 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-004.mrc:61250613:1263?format=raw |
LEADER: 01263cam a22003131 4500
001 1544618
005 20220608184600.0
008 681210s1968 nyua b 001 0 eng
010 $a 68030909
020 $a0471258105
035 $a(OCoLC)ocm00230599
035 $9AKC6466CU
035 $a(NNC)1544618
035 $a1544618
040 $aDLC$cDLC$dOCL$dZCU
050 00 $aQA264$b.F5
082 0 $a519/.92
100 1 $aFiacco, Anthony V.$0http://id.loc.gov/authorities/names/n79145550
245 10 $aNonlinear programming ;$bsequential unconstrained minimization techniques /$c[by] Anthony V. Fiacco [and] Garth P. McCormick.
260 $aNew York :$bWiley,$c[1968]
300 $axiv, 210 pages :$billustrations ;$c23 cm
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
504 $aBibliography: p. 196-201.
650 0 $aNonlinear programming.$0http://id.loc.gov/authorities/subjects/sh85092331
650 0 $aMathematical optimization.$0http://id.loc.gov/authorities/subjects/sh85082127
650 0 $aAlgorithms.$0http://id.loc.gov/authorities/subjects/sh85003487
700 1 $aMcCormick, Garth P.,$eauthor.$4http://id.loc.gov/vocabulary/relators/aut$0http://id.loc.gov/authorities/names/n82115688
852 00 $boff,eng$hQA264$i.F5