(in Polish) Operational Research and Optimization IE-SI7O>ORaO
The aim of the course is to acquaint students with the formulation, theory and methods of solving linear programming problems, especially using the simplex algorithm. Other issues concern the formulation, theory and solution of unconstrained and constrained nonlinear programming problems. Numerical algorithms for solving nonlinear optimisation problems are also presented.
Course coordinators
<b>Final assessment</b>
<b>Prerequisites</b>
<b>Basic literature</b>
<b>Supplementary literature</b>
<b>Other information</b>
Learning outcomes
Knowledge
Related directional learning outcomes:
IE1A_W17
Verification metods:
Knowledge
Related directional learning outcomes:
IE1A_W19
Verification metods:
Skills
Related directional learning outcomes:
IE1A_U08
Verification metods:
Skills
Related directional learning outcomes:
IE1A_U14
Verification metods:
Social competence
Related directional learning outcomes:
IE1A_K07
Verification metods: