000 01115nam a2200337 a 4500
008 141028s1973 cau i000 0 eng d
020 _cHadiah
039 9 _a201410280906
_basrul
_y10-28-2014
_zasrul
040 _aUKM
_erda
090 _aRAND 7
_bP-5124 1973
100 1 _aHillestad, Richard J.
245 1 2 _aA cutting plane algorithm for problems containing convex and reverse convex constraints /
_cRichard J. Hillestad
260 _aCalifornia :
_bRand Corporation,
_c1973
300 _a15 pages ;
_c28 cm.
336 _atext
_2rdacontent
337 _aunmediated
_2rdamedia
338 _avolume
_2rdacarrier
490 1 _aThe Rand paper series ;
_vP-5124
504 _aBibliography: p.15.
650 0 _aMathematical programming.
650 0 _aConvex sets.
650 0 _aAlgorithms.
710 2 _aThe Rand Corporation
830 0 _aRand paper series ;
_vP-5124
907 _a.b16016130
_b2022-01-21
_c2019-11-12
942 _c4
_n0
_kRAND 7 P-5124 1973
914 _avtls003572299
990 _azear
991 _aKoleksi Dokumen
998 _at
_b2014-02-10
_cm
_da
_feng
_gcau
_y0
_z.b16016130
999 _c580874
_d580874