CollegeTransfer.Net

Course Criteria

Add courses to your favorites to save, share, and find your best transfer school.
  • 3.00 Credits

    Theoretical development of nonlinear optimization with applications, classical optimization, convex and concave functions, separable programming, quadratic programming and gradient methods. Offered spring semester only. Students are expected to have completed a course in linear programming and a course in advanced calculus before enrolling in this course.
  • 3.00 Credits

    Principal methods used in integer programming and discrete optimization; branch and bound, implicit enumeration, cutting planes, group knapsack, Lagrangian relaxation, surrogate constraints, heuristics (performance analysis), separation/branching strategies, and polynomial time algorithms for specific problems on special structures. Offered fall semester only. Students are expected to have completed a graduate-level course in linear programming before enrolling in this course.
  • 3.00 Credits

    Development of linear programming theory using inequality systems, convex cones, polyhedra and duality; solution algorithms, and computational considerations for large scale and special structured problems using techniques of upper bounded variables, decomposition, partitioning and column generation; game theory; nonlinear representations and other methods such as ellipsoid and Karmarkar. Offered spring semester only. Students are expected to have completed a graduate-level course in linear programming before enrolling in this course.
  • 3.00 Credits

    Max-flow/min-cut theorem, combinatorial applications, minimum cost flow problems (transportation, shortest path, transshipment), solution algorithms (including the out-of-kilter), and implementation and computational considerations. Offered fall semester only. Students are expected to have completed a graduate-level course in linear programming before enrolling in this course.
  • 3.00 Credits

    Design, analysis and implementation of algorithms and data structures associated with the solution of problems formulated as networks and graphs; applications to graph theory, combinatorial optimization and network programming. Offered spring semester only. Students are expected to have completed a course in each of the following before enrolling in this course: linear programming, graduate mathematical programming, graph theory, undergraduate algorithms and data structures.
  • 3.00 Credits

    Stochastic control; structure of sequential decision processes; stochastic inventory models; recursive computation of optimal policies; discrete parameter finite Markov decision processes; various optimality criteria; computation by policy improvement and other methods; existence of optimal stationary policies; stopping-rule problems; examples from financial management, maintenance and reliability, search, queuing and shortest path. Offered spring semester only. Students are expected to have completed a graduate-level course in stochastic processes before enrolling in this course.
  • 3.00 Credits

    Introduction to queuing theory: Markovian queues, repairman problems, queues with an embedded Markov structure, the queue GI/G/1, queues with a large number of servers, decision making in queues; introduction to reliability theory; failure distributions; stochastic models for complex systems; maintenance and replacement policies; reliability properties of multicomponent structures. Offered fall semester only. Students are expected to have completed a graduate-level course in stochastic models in operations research before enrolling in this course.
  • 3.00 Credits

    Theory and methodology of optimization problems with vector-valued objective functions; preference orders and domination structures; generating efficient solutions; solving multicriteria decision-making problems; noninteractive and interactive methods with applications. Offered fall semester only. Students are expected to have completed a graduate-level course in mathematical programming before enrolling in this course.
  • 3.00 Credits

    Theory, algorithms and applications of linear and nonlinear complementarity; classes of matrices and functions and corresponding algorithms; applications to economics, mechanics and networks; generalizations to fixed-point problems and nonlinear systems of equations. Offered spring semester only. Students are expected to have completed a graduate-level course in mathematical programming before enrolling in this course.
  • 3.00 Credits

    Normed spaces; Hilbert spaces, Banach spaces, linear functionals, linear operators, orthogonal systems. Offered spring semester and summer session only. Students are expected to have either completed an undergraduate-level course in advanced calculus II or to have completed both an undergraduate-level advanced calculus I course and a graduate-level matrix analysis course before enrolling in this course.
To find college, community college and university courses by keyword, enter some or all of the following, then select the Search button.
(Type the name of a College, University, Exam, or Corporation)
(For example: Accounting, Psychology)
(For example: ACCT 101, where Course Prefix is ACCT, and Course Number is 101)
(For example: Introduction To Accounting)
(For example: Sine waves, Hemingway, or Impressionism)
Distance:
of
(For example: Find all institutions within 5 miles of the selected Zip Code)