MSc: Optimization - Revision history

R.sirgalina: /* The retake exam */

2022-11-10T11:09:42Z

The retake exam

← Older revision		Revision as of 11:09, 10 November 2022
Line 172:		Line 172:
	<math>{\displaystyle x_{i}\in \{0,1\}}</math>		<math>{\displaystyle x_{i}\in \{0,1\}}</math>
	Solve it using cutting-plane and branch-and-bound methods.		Solve it using cutting-plane and branch-and-bound methods.
		+
	'''Section 2'''		'''Section 2'''
	# Consider the problem:		# Consider the problem:

R.sirgalina at 08:41, 29 August 2022

2022-08-29T08:41:33Z

Show changes

R.sirgalina: /* Course Sections */

2022-07-13T07:39:50Z

Course Sections

← Older revision		Revision as of 07:39, 13 July 2022
Line 117:		Line 117:
	=== Section 1 ===		=== Section 1 ===

−	==== Section title: ~~Linear programming~~ ====	+	==== Section title: ====
		+	Linear programming
−

	==== Topics covered in this section ====		==== Topics covered in this section ====
Line 124:		Line 124:
	* simplex method to solve real linear programs		* simplex method to solve real linear programs
	* cutting-plane and branch-and-bound methods to solve integer linear programs.		* cutting-plane and branch-and-bound methods to solve integer linear programs.
−

	==== What forms of evaluation were used to test students’ performance in this section? ====		==== What forms of evaluation were used to test students’ performance in this section? ====
Line 205:		Line 204:
	=== Section 2 ===		=== Section 2 ===

−	==== Section title: ~~Nonlinear programming~~ ====	+	==== Section title: ====
		+	Nonlinear programming
−

	==== Topics covered in this section ====		==== Topics covered in this section ====
Line 213:		Line 212:
	* linear and nonlinear least-squares problems		* linear and nonlinear least-squares problems
	* methods for constrained optimization		* methods for constrained optimization
−

	==== What forms of evaluation were used to test students’ performance in this section? ====		==== What forms of evaluation were used to test students’ performance in this section? ====
Line 273:		Line 271:
	#: <math> \text{subject to } x_1,\ x_2\geq0 </math>		#: <math> \text{subject to } x_1,\ x_2\geq0 </math>
	#: Solve it using the suitable method.		#: Solve it using the suitable method.
−

	==== Test questions for final assessment in this section ====		==== Test questions for final assessment in this section ====

R.sirgalina: /* Course Objectives Based on Bloom’s Taxonomy */

2022-07-13T07:38:54Z

Course Objectives Based on Bloom’s Taxonomy

← Older revision		Revision as of 07:38, 13 July 2022
Line 61:		Line 61:
	\|align="center"\| 0/100		\|align="center"\| 0/100
	\|}		\|}
		+	</div>

	A student can take the examination by properly solving three assignments or the final exam, which is composed of three questions on the same arguments of the assignments.		A student can take the examination by properly solving three assignments or the final exam, which is composed of three questions on the same arguments of the assignments.
Line 83:		Line 84:
	\|align="center"\| 0-55		\|align="center"\| 0-55
	\|}		\|}
		+	</div>

	=== Resources and reference material ===		=== Resources and reference material ===

M.petrishchev at 07:17, 25 April 2022

2022-04-25T07:17:13Z

← Older revision		Revision as of 07:17, 25 April 2022
Line 16:		Line 16:
	The main purpose of this course to make the student aware of basic notions of mathematical programming and of its importance in the area of engineering.		The main purpose of this course to make the student aware of basic notions of mathematical programming and of its importance in the area of engineering.

−	=== Course Objectives Based on Bloom’s Taxonomy ===	+	== Course Objectives Based on Bloom’s Taxonomy ==

	==== What should a student remember at the end of the course? ====		==== What should a student remember at the end of the course? ====

R.akhmetzyanov: /* Optimization */

2022-04-21T07:58:59Z

Optimization

← Older revision		Revision as of 07:58, 21 April 2022
Line 3:		Line 3:
	* <span>'''Course name:'''</span> Optimization		* <span>'''Course name:'''</span> Optimization
	* <span>'''Course number:'''</span> R-01		* <span>'''Course number:'''</span> R-01
		+	== Prerequisites ==

	== Course characteristics ==		== Course characteristics ==

M.petrishchev: M.petrishchev moved page MSc:Optimization to MSc: Optimization

2022-04-15T08:02:09Z

M.petrishchev moved page MSc:Optimization to MSc: Optimization

← Older revision	Revision as of 08:02, 15 April 2022
(No difference)

R.akhmetzyanov: /* Section 2 */

2022-04-05T07:04:27Z

Section 2

@@ Line 247: / Line 247: @@
 </div>
 ====  Typical questions for ongoing performance evaluation within this section ====
@@ Line 253: / Line 254: @@
 # What is the goal of a descent algorithm?
 # What does it mean to fit some experimental data points
 ==== Test questions for final assessment in this section ====

R.akhmetzyanov: /* Section 1 */

2022-04-05T06:58:03Z

Section 1

@@ Line 164: / Line 164: @@
 # What is the difference between polyhedron and polytope?
 # Why does always a linear program include constraints?
 ==== Test questions for final assessment in this section ====
@@ Line 171: / Line 199: @@
 # How one can test unbounded solutions to a linear program?
 # How can the computational complexity of an optimization algorithm can be defined?
 === Section 2 ===

M.petrishchev: M.petrishchev moved page MSc:Optimization.F21 to MSc:Optimization over redirect

2022-04-04T12:54:02Z

M.petrishchev moved page MSc:Optimization.F21 to MSc:Optimization over redirect

← Older revision	Revision as of 12:54, 4 April 2022
(No difference)