Eastern Connecticut State University
MAT 360-01 Optimization 01
Course Website

Help   My Notes   My Account   Logout
bullet Home
bullet Instructor
bullet Syllabus
bullet Course Content
bullet Discussion Area
bullet GradeBook
bullet Web Links
bullet Student Registration
bullet Student Handbook
bullet Courses

Course Description
This course is designed to assist you to master the basic concepts of Optimization and how to use technology to analyze. This course is intended for undergraduate students who have taken a one year course in calculus. The course is an introduction of optimization techniques in Management Science. The core topics in this course are • Linear programming (graphical solutions) • Linear programming (computer solutions) • Integer programming • Nonlinear programming Emphasis will be placed on modeling and computer solutions. MAT 345 OPTIMIZATION COURSE OUTLINE 1. Introduction (a) Examples of optimization problems (b) Terminology (c) Standard maximum and minimum problems (d) Matrices and systems of linear equations 2. Linear programming model formulation and graphical solution 3. The Simplex Method (a) Simplex tableau (b) Duality 4. Linear programming: computer solution and sensitivity analysis 5. Integer programming 6. Nonlinear programming (a) Non-constrained single variable nonlinear objective functions: Method of derivatives (b) Partial Derivatives (c) Constrained nonlinear programming problems: Method of Lagrange’s Multipliers 7. Nonlinear programming problems: Computer Solution 8. Profit analysis 9. The transportation problem: Finding a basic feasible shipping schedule

This page has been viewed 261 times since January 10, 2008.

Please choose a section.
Home    Instructor    Syllabus    Course Content    Discussion Area    GradeBook    Web Links    Student Registration    Courses


Portions copyright ©2005 The McGraw-Hill Companies.
Any use is subject to the Terms of Use and Privacy Policy.
McGraw-Hill Higher Education is one of the many fine businesses of The McGraw-Hill Companies.