NON-LINEAR PROGRAMMING: "HILL-CLIMBING" TECHNIQUE AND CONSTRAINED OPTIMIZATION

SOME OF THE METHODS ARE CONSIDERED WHICH ARE AVAILABLE FOR THE NUMERICAL DETERMINATION OF MAXIMA OR MINIMA OF NONLINEAR FUNCTIONS, WHEN THE INDEPENDENT VARIABLES ARE CONSTRAINED IN SOME FASHION. AFTER GIVING THE NOTATION USED AND A STATEMENT OF THE MATHEMATICAL PROBLEM, TECHNIQUES ARE SUGGESTED WHICH ARE SUITABLE FOR UNCONSTRAINED OPTIMIZATION PROBLEMS. SOME METHODS OF SOLUTION REQUIRE A COMPLETE, OR AT LEAST PARTIAL, LINEARIZATION OF THE PROBLEM, WHILE OTHERS MODIFY THE 'COST' FUNCTION TO CONVERT THE CONSTRAINED PROBLEM INTO A SEQUENCE OF UNCONSTRAINED PROBLEMS; THESE ARE DESCRIBED. ATTENTION IS GIVEN TO OTHER METHODS WHICH DO NOT EASILY FALL INTO THE ABOVE CATEGORIES. THE AUTHOR MAKES RECOMMENDATIONS AS TO WHICH TECHNIQUES WILL PRODUCE THE MOST CONSISTENT RESULTS. /AUTHOR/

  • Supplemental Notes:
    • Vol 5, pp 5-28
  • Corporate Authors:

    N/A

    ,   USA 
  • Authors:
    • Rattray, C
  • Publication Date: 1969-9

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00201799
  • Record Type: Publication
  • Source Agency: Traffic Systems Reviews & Abstracts
  • Files: TRIS
  • Created Date: Jul 6 2003 12:00AM