Scribd
Upload
28 views3 pages

Course Information - 2023

This document provides information about the MH3701 Basic Optimization course offered in semester 2 of AY 2022/2023. It outlines the learning outcomes, instructors, policies, assessments, and schedule. The course covers solving linear programs with simplex methods, optimality and duality in linear programming, and nonlinear programs. It is assessed through labs, online quizzes, one test, and a final exam. The instructor is Asst. Prof. YAN Zhenzhen and it follows a traditional lecture-tutorial mode of instruction.

Uploaded by

Jas Ross
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
28 views3 pages

Course Information - 2023

This document provides information about the MH3701 Basic Optimization course offered in semester 2 of AY 2022/2023. It outlines the learning outcomes, instructors, policies, assessments, and schedule. The course covers solving linear programs with simplex methods, optimality and duality in linear programming, and nonlinear programs. It is assessed through labs, online quizzes, one test, and a final exam. The instructor is Asst. Prof. YAN Zhenzhen and it follows a traditional lecture-tutorial mode of instruction.

Uploaded by

Jas Ross
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

MH3701 Basic Optimization AY 2022/2023 Semester 2

Course Information
Learning Outcomes
At the end of this course, students should be able to:
1. Solve instances of linear programs with the simplex method.
2. Explain and relate the geometry, the algebra, and the tabular form of the simplex method.
3. Solve instances of minimum-cost flow problems with the network simplex method.
4. Explain the algebra of the network simplex method.
5. Explain the optimality of a solution to a linear program, and the infeasibility of a linear program,
using linear programming duality.
6. Conduct sensitivity and post-optimality analysis on linear programs.
7. Solve instances of nonlinear programs via their Karush-Kuhn-Tucker conditions.

Instructors
The course coordinator is Asst. Prof. YAN Zhenzhen

• Office: SPMS-MAS-05-19
• Phone: 6513 7466
• E-mail: [email protected]
• Consultation: via e-mail, or by appointment.

Course Policies
The course will adhere to the following policies:
1. Academic conduct
All students are expected to uphold academic integrity.
It is a violation of academic integrity to

• copy another person's work;


• use another person's work or idea without acknowledging;
• cheat on tests and exams.
2. Absentee
A missed test or lab will be given a mark of zero, unless the cause is illness (medical note required)
or similarly good reason notified promptly in writing (e-mail is acceptable).
A student who missed a test or lab due to illness must contact the instructor within 7 days after the
test or lab.

References
Students may refer to the following textbooks:
1. Introduction to Operations Research,
by Frederick S. Hillier and Gerald J. Lieberman,

1
MH3701 Basic Optimization AY 2022/2023 Semester 2

published by McGraw-Hill.
2. Linear Programming: Foundations and Extensions
by Robert J. Vanderbei,
published by Springer.

Class Times

Labs on Weeks 3 (25, 26 Jan), 6 (15, 16 Feb), 9 (15, 16 Mar), and 12 (5, 6 Apr).
LA1 Wednesdays 12.30-14.20 COMP LAB 3
LA2 Wednesdays 13.30-15.20 COMP LAB 2
LA3 Thursdays 16.30-18.20 COMP LAB 1
LA4 Thursdays 16.30-18.20 COMP LAB 2

Mode of Instructions
This course follows a traditional lecture-tutorial mode of instructions.

Assessments
Formative assessments (25% of final grade)

• Labs 5% • There will be four lab sessions.


• Successfully completing each of the first two lab sessions earns
you 1.5%.
• Successfully completing each of the last two lab sessions earns
you 1%.
• No partial credits for each test question.
• Online 20% • There will be 3 online quizzes.
quizzes • Quiz #1 covers prerequisites from Linear Algebra; it is due at
the end of Week 3; it’s worth 5% of the final grade.
• Quiz #2 covers material in Weeks 2—7; it is due at the end of
the recess week; it’s worth 6% of the final grade.
• Quiz #3 covers material in Weeks 8—12; it is due at the end of
Week 13; it’s worth 9% of the final grade.
• No partial credits for each quiz question.

Summative assessments (75% of final grade)

• Tests 25% • There will be ONE test.


• The test date: 8 Mar 2023.
• Final 50% • The final exam date: 26 April 2023.
exam

Course Schedule
The following schedule will be closely followed:

• Weeks 1 --- 4 Part I. The Simplex Method


• Weeks 5 --- 8 Part II. Other Simplex Methods
• Weeks 9 --- 11 Part III. Theory of Linear Program

2
MH3701 Basic Optimization AY 2022/2023 Semester 2

• Weeks 12 --- 13 Part IV. Beyond Linear Programming

You might also like