Record ID | ia:heuristicsforglo00hart |
Source | Internet Archive |
Download MARC XML | https://archive.org/download/heuristicsforglo00hart/heuristicsforglo00hart_marc.xml |
Download MARC binary | https://www.archive.org/download/heuristicsforglo00hart/heuristicsforglo00hart_meta.mrc |
LEADER: 01847nam 2200445 a 4500
001 ocn427886775
003 OCoLC
005 20100622112326.8
006 m b
007 cr cga---uuuuu
008 090727s1974 caua bt f000 0 eng d
035 $a
035 $a
037 $aAD0782136$bDTI
040 $aAD#$cAD#
049 $aAD#A
086 0 $aD 208.14/2:NPS-55HH74051
088 $aNPS-55HH74051
100 1 $aHartman, James K.
245 10 $aHeuristics for global optimization of constrained nonlinear programs /$cby James K. Hartman.
260 $aMonterey, Calif. :$bNaval Postgraduate School,$c1974.
300 $a[22] p. :$bill. ;$c28 cm.
500 $aTitle from cover.
500 $a"Prepared for: Office of Naval Research, Arlington, Virginia 22217 "--Cover.
500 $a"May 1974"--Cover.
500 $a"NPS-55HH74051"--Cover.
500 $aAuthor(s) subject terms: Optimization, global optimization, nonlinear programming, search methods, Heuristics.
504 $aIncludes bibliographical references (p. [15])
506 $a"Approved for public release; distribution unlimited"--Cover.
513 $aTechnical report; 1974.
520 $aWe consider the problem of finding the global solution to non-convex nonlinear programs which may have local solutions distinct from the global solution. Several heuristic methods are proposed. The advantage and disadvantages of heuristic methods as compared with algorithmic methods are discussed. (Author)
650 0 $aNonlinear programming.
650 0 $aMathematical optimization.
650 0 $aHeuristic.
710 2 $aNaval Postgraduate School (U.S.)
994 $aC0$bAD#
035 $a
035 $a
949 $lgen$nL$aQA265$b.H269$s1$tnorm$u00001$i32768001711369
926 $aNPS-LIB$bDIGIPROJ$cD 208.14/2:NPS-55HH74051$dTECH_RPT$eNEVER$f1