-
Institution:
-
New Jersey City University
-
Subject:
-
-
Description:
-
This course includes topics in the theory of optimization. The topics include the maximization and/or minimization of univariate functions (using such methods as exhaustive search, interval search, random search, and Fibonacci search), and multivariate functions (using techniques such as the method of steepest descent). The linear programming problem is introduced and the simplex method is used for solving it. Topics are covered in the context of decision- making. Prerequisite: MATH 191 Calculus II or equivalent
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(201) 200-2000
-
Regional Accreditation:
-
Middle States Association of Colleges and Schools
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.