[{"run_id":"20260906T231458-5fdd2fff","semester":"1272","observed_at":"2026-09-06 23:14:58.172943+00:00","record_version_id":"b93f377431494ba06e268eaa36e930808175e920206dcb5e5be1503cbba18081","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"20260907T155543-ce3781c4","semester":"1272","observed_at":"2026-09-07 15:55:43.033547+00:00","record_version_id":"b93f377431494ba06e268eaa36e930808175e920206dcb5e5be1503cbba18081","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"20261014T203208-0851c9a1","semester":"1274","observed_at":"2026-10-14 17:50:09.728220+00:00","record_version_id":"f3a1d59c1c11c116a3a64ca3d563e14027984d4145daec998aa32fece69a8d6a","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"2b84633670f293fc9a4f082a6dbfc20bf62296c147e01ea56910c74c89fc713e","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,345,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:52:01.938346+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\",\"term\":null,\"text\":\"Use linear programming to formulate real world decision problems.\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:52:01.938346+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\",\"term\":null,\"text\":\"Apply algorithms to solve linear programming problems and demonstrate their correctness.\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:52:01.938346+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\",\"term\":null,\"text\":\"Combine different proving techniques explored in class in an original way to show new results.\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:51:40.213374+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/i_sy_e/\",\"term\":null,\"text\":\"Use linear programming to formulate real world decision problems.\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:51:40.213374+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/i_sy_e/\",\"term\":null,\"text\":\"Apply algorithms to solve linear programming problems and demonstrate their correctness.\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:51:40.213374+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/i_sy_e/\",\"term\":null,\"text\":\"Combine different proving techniques explored in class in an original way to show new results.\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:51:41.022582+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/math/\",\"term\":null,\"text\":\"Use linear programming to formulate real world decision problems.\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:51:41.022582+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/math/\",\"term\":null,\"text\":\"Apply algorithms to solve linear programming problems and demonstrate their correctness.\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:51:41.022582+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/math/\",\"term\":null,\"text\":\"Combine different proving techniques explored in class in an original way to show new results.\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:51:01.923427+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/stat/\",\"term\":null,\"text\":\"Use linear programming to formulate real world decision problems.\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:51:01.923427+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/stat/\",\"term\":null,\"text\":\"Apply algorithms to solve linear programming problems and demonstrate their correctness.\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:51:01.923427+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/stat/\",\"term\":null,\"text\":\"Combine different proving techniques explored in class in an original way to show new results.\"}]"},{"run_id":"legacy-03b0bbb9723907cf3d1b41cf0bb34837dc398e42","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"6742dc346e1c1b88b9691527a0b1ac8cdf6a7b2963d328ec9e5de996df65bcef","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-0837245627eb714ae6bb0375f7abe8f41042011f","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"6742dc346e1c1b88b9691527a0b1ac8cdf6a7b2963d328ec9e5de996df65bcef","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-08c92e359bbbc110b0778b7e0b15d6f40000e6b1","semester":"1262","observed_at":"2025-08-21 07:05:14.730696+00:00","record_version_id":"bff06fe98a1ff418fa4a815b07de48c66268efc3e92e06748a132489dce4d694","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-0944d76440dc778fbb89626058c10451009ce9c6","semester":"1262","observed_at":"2025-05-21 03:36:18.194118+00:00","record_version_id":"ba93d25206b432f7d95b49bf9bcd762997c0b4d1b9e3e6af6ef23e7f932cf5bc","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-0a7f4bce29c816ef4d3d71b4eb8a2a3e15e33cc1","semester":"1262","observed_at":"2025-06-18 20:04:02.695444+00:00","record_version_id":"0169a8b755e447de8606352fae03d0f3d10a00dc8de3548ae6302bf905f2ca19","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-0ab917f827a7de22ebdc1087114d377a31c4687b","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"f3213344d2793f19f8feef3a3acf4274e764f167976bea395fc72c00d229617e","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-0c40ecab4b6db9333d1f18aef816e3ee659e300c","semester":"1262","observed_at":"2025-05-25 18:02:34.797617+00:00","record_version_id":"7d8d55802a9905eb434099a896e9237bef1085587f5c8cb4d3ec91edb903c6a4","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-0cb4d29a588ec7f11c7e00b7cf5dc3a0d23d0349","semester":"1266","observed_at":"2026-01-22 01:00:26.555427+00:00","record_version_id":"52073c96af94a259ed6a57a1c16abf40780c42c07aefa2abf0cc8d9e5ca419de","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-11c30ec39e91498cbfcf3a923c53a4b03e387280","semester":"1262","observed_at":"2025-07-20 04:58:26.847117+00:00","record_version_id":"c99226d70a0f7169f9b01ff7f2fa1beaa3b224f81326be986ea2121a46f351b9","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-13cd500edf2587e9a3428f326253738fbea965ea","semester":"1264","observed_at":"2025-12-14 04:50:04.653658+00:00","record_version_id":"3806ded86016378ff0568165919438aed156de31a797e65d23c09a6b7b2cbea3","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-1da08b2de39f05e6bc877c189fc2fd6eeda563f5","semester":"1262","observed_at":"2025-07-01 00:03:56.707251+00:00","record_version_id":"9daa5ee3093148c315796d47ab6bcfeec678c03b4683915eb54752c9e4d829fd","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-2031af47efe133b0e7877f433286ff07385afc41","semester":"1262","observed_at":"2025-07-02 20:16:45.749584+00:00","record_version_id":"bbf41a19a2273f986bc4d4a1cbf786f7c2090e6b2686271afabbc6cc496de208","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-238eba6f32fbc30407f616dd0628ff02a2a824dd","semester":"1262","observed_at":"2025-08-17 05:15:07.788352+00:00","record_version_id":"7776d346acd9355e673289d40dd4a3d5624f3bdce9babeeb901a0b91b5d180d8","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-25f0ff56bc4d80f8a8afa1a0bcce8dae6fddb5e5","semester":"1262","observed_at":"2025-05-25 17:20:25.942090+00:00","record_version_id":"1e2dbf7b9ea89c9ec72008306b5dea006a20da22fcd9ccc405028c2c0d5748df","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-2923f91826ce253b7aeefa9f75b4a39fe4c80ff0","semester":"1262","observed_at":"2025-08-10 05:10:25.938416+00:00","record_version_id":"f00df925ed9604c785b57baae8255dc10f3373734732943bd59af248c2f921bd","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-2a05214a4023e0157fa6f7d188c85308f714176c","semester":"1262","observed_at":"2025-09-07 04:56:38.255315+00:00","record_version_id":"1ce1d62d862858943a16e10f17ac5d639838326a662c63360e849a9db544cc42","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-2b1b8e39131de92b94620b25c5bbb25690efed4c","semester":"1262","observed_at":"2025-06-01 07:54:53.913454+00:00","record_version_id":"a0ce83b722d651aab0b708094df3a6ffa3c0026e33745b59c1e095b9905b2d50","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-33a1225644e5a5855d60f66e65413946e72fedf4","semester":"1262","observed_at":"2025-06-22 01:52:05.152650+00:00","record_version_id":"43512fe9536241e65a30fc95d679d175c23c7c19ce8e5c39f086a6a8de81a29a","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-3b89c83dbf5208e13756184de1f2b2d0c09af35f","semester":"1262","observed_at":"2025-06-30 06:40:10.235522+00:00","record_version_id":"ca13058c4b064ecaa5014f8edf68d36d2947553c18c38984fbc342bebfcd09a7","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-3c3eebf7f35c39364b445a2fa5a112ce28dbb4a1","semester":"1262","observed_at":"2025-06-01 17:03:59.062985+00:00","record_version_id":"ed2dd6935590e3c9b8fb9316be922d715ccb46878de85dd6f9c6578a87702b1b","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-3fa4dd71391f1c9cf4ab2216680bbc428689f92d","semester":"1262","observed_at":"2025-05-25 01:15:58.180530+00:00","record_version_id":"c3a79636ea6c290ca131f8a141a0a00a273803f8d0c16a74629b15080f793edd","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-4040aa216da722a34483f68fc1e129ea571ae08d","semester":"1262","observed_at":"2025-06-01 07:27:39.695506+00:00","record_version_id":"662f2443f48dc98570a7ff4bf717d417990868e802bb32d970a35416d36f9ffe","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-454d53cd690294459f8ad0793cc3ed562060e56c","semester":"1262","observed_at":"2025-05-25 01:34:00.536004+00:00","record_version_id":"c72fdde990cdb99bb5e27c2bec5096c81c8f6420b412ce489fbeff383670f2d5","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-486f091e051fdb4ccdb80ee7b4fb0a5814510324","semester":"1264","observed_at":"2025-11-16 05:32:31.273726+00:00","record_version_id":"d35f5088f707f0443045c5702e31cea8e79d63042563fedd73e6246499088cee","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-50393cfc5fd5598d4f4731ef1919f2ff53af07d9","semester":"1262","observed_at":"2025-06-30 06:05:57.438846+00:00","record_version_id":"60fd867c792bba26edcdf51ed369fc61bea3b1dad9e43d22a9d28df16b4ad308","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-50f6947786b208c800db8bbd0cec84a8f0f187d2","semester":"1262","observed_at":"2025-06-02 03:49:42.915428+00:00","record_version_id":"6219d9fe491900d06260ead2aecdb0aec9a2c437849622bbb736c9ea183981ba","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-51d86ed4082dced3803c295419b0ec8440942016","semester":"1264","observed_at":"2025-11-12 04:50:41.141307+00:00","record_version_id":"893fe7998c118f1acc20a3a09a50c346c59e77b59b091379d07e8af2511a2d7f","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-53101bd1c10db0d00d094e4c9154d4c244ff23d9","semester":"1262","observed_at":"2025-10-05 04:58:05.366968+00:00","record_version_id":"811efa7f576b10f79625dd79fa394964a6a65bff6a1490c79f22b2f0d015ea32","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-58751151c564e11c5cb8aedd3a2d3527c22f73eb","semester":"1262","observed_at":"2025-06-01 06:59:01.536576+00:00","record_version_id":"95275fc251c5c77e38bcee4c330cde4448454efa942695d2120e3740b180c4c3","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-5c4c8d3701a333ba4ddadef7d0b5dde8440fcdf0","semester":"1262","observed_at":"2025-06-01 01:57:51.256704+00:00","record_version_id":"a2c83bbf40a3bdb0d6624fbe03eeeb632d0fe917cb4063387d8420b5a7f56305","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-5d20d9f81651d3c83fcaa2fd10870ce6e5d5a685","semester":"1262","observed_at":"2025-05-21 16:48:48.484741+00:00","record_version_id":"663e5955be3085dacccd33b8c3e74f713a19adce70c943884774fef222d68f69","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-5feaebf2ab37051c86ad360cc0fa0d7e0e2ea295","semester":"1262","observed_at":"2025-05-24 15:58:23.378859+00:00","record_version_id":"f5903ca9be4194189b4cea33eadee1e440c95c4d8bfa6a0ef6634cf1baa9971e","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-60949965544fce098cc006354e201149005fb77b","semester":"1264","observed_at":"2025-10-26 05:07:14.077864+00:00","record_version_id":"a8d3457819b01a4a52ee8a950942f2466df6b91b1c59aa95d49f9868f3dfa351","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-639225ac3addf8522f1d30cb4fe26054ea7f8c49","semester":"1262","observed_at":"2025-06-01 08:14:42.497608+00:00","record_version_id":"6fb198c014b7fa889e13f6254fb436cf4c3a67263a193cecfa749ef544bd15d2","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-64093b17b3a9c67a41aa33eb37adb53ec38df714","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"3368c5110236257af02cbab881b5cdff6d53bc4bc075cfde686b238f1824a097","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-6885b56099f55e08aa0205546369fb0381d50e13","semester":"1262","observed_at":"2025-07-13 04:59:22.367394+00:00","record_version_id":"10b0b2893f10e88f0c8318d41bbd03a4858c4f9c896660c4e63b95847705b82f","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-69d4b2b16e8268f75b6390b3a0e2ce8bf73999da","semester":"1262","observed_at":"2025-06-30 03:21:29.925498+00:00","record_version_id":"705a68c2b6b52c254ed7e39e5e5187ab856bf94b95ff4a7bb6be033eaa107838","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-6b29c3e0673b2f9a736d2363db5409e03d5b3ed4","semester":"1264","observed_at":"2025-12-03 12:33:41.418072+00:00","record_version_id":"e81cb58fda60fed39283ce307e1741fbce2a2b6405fc44868a5801d38dcf40a9","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-73259984748de484976ef2ad56ad7ab3d4cb4518","semester":"1262","observed_at":"2025-06-26 08:27:56.461216+00:00","record_version_id":"9fbedcf8364aafcdd334adb7211f1b1fee6e77874dd376b22e4cac7436f1bf88","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-741602fbc6252c232a0b9e6bc1a9ae3101625f5a","semester":"1262","observed_at":"2025-06-30 22:49:32.522034+00:00","record_version_id":"11443ecf156975897adf701fdf6970ff7087fa7b3c726c092613cedd54d37341","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-7774f45558276ec29bf626e58fffb4a27bdbb2a9","semester":"1264","observed_at":"2025-11-01 11:49:36.359151+00:00","record_version_id":"7256046cd89c72e0eada940673affbef9de9d7fbd3ab1125eecc2588a82004b0","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-7ab7c5e783fc8ebef8b8ee8cea019ee37a72ce74","semester":"1262","observed_at":"2025-09-28 04:58:07.340658+00:00","record_version_id":"426a57f78110a17856923283592c314852ff516afc3139e58933bfc7d2b6d5b4","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-7b2f22d83ea05055ab90dcb77dc802382cccc6f7","semester":"1262","observed_at":"2025-05-21 17:56:46.096741+00:00","record_version_id":"648d470dd81dc9dab0f7632ed08364be56fd291ab8badf5d692141110411cd96","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-7ca1175502be18eb51f7b016818a884a43fd4ebb","semester":"1262","observed_at":"2025-07-29 06:28:23.644795+00:00","record_version_id":"cc4f24983020e8fcac82eef6cccba161fd81b6eb8bd1f1eb8af343089eee0d26","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-7d8cee5e42602ad9ba5dc0322085af2fa0dffaac","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"c42caaced9050c2b5cd5726e042a21f219b8a28ea57db3b3e43adf711804c2e4","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-81a0d6a7f668c98c59bd05fa988aa079c5ad1f68","semester":"1262","observed_at":"2025-05-31 07:49:50.419452+00:00","record_version_id":"afd48604af01faa051b1f5c0af6b5ffb1a4ef3993a63fa19a111147db14686d2","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-82f31c08c746a214872494cde6ecaeb9330441b4","semester":"1262","observed_at":"2025-06-17 21:26:08.547156+00:00","record_version_id":"fd2319a35abcd89f15f0b26d2d1b0bf0f7d4091a46d93b44929faa2d80b2a975","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-84c248343c5a99ab42c5616c594812a5e3e31cbb","semester":"1262","observed_at":"2025-07-04 06:00:07.487827+00:00","record_version_id":"912b29f7fcf457e3a48fb99f2f18059ae61f2451e88eabd32606921414b2aeb6","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-86334e7275e315853287e8580c35456c68df800b","semester":"1262","observed_at":"2025-05-22 06:53:03.336354+00:00","record_version_id":"b95c7337d13bf36dc7a2e0b75049ecba2aa1550d58c9b70b8ea81672387a5dab","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-8686dc1664f93a6c05f50321410961b39b12f91b","semester":"1262","observed_at":"2025-05-28 10:17:41.595894+00:00","record_version_id":"99daef016e666a07de6d108096d4a1199f171e7a0ee2ede1a5adf92f85eb2a05","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-86d941366886c9a14a2581c04e20d0bdd25e1b02","semester":"1262","observed_at":"2025-08-31 04:54:14.656039+00:00","record_version_id":"9b60917e2a270fce82c82a8361cc6da22c6941f2ef1da01f529dbaa38145d105","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-8ba1d2e6cfbb1525b4f9f769ec164fb6ad0f237a","semester":"1262","observed_at":"2025-06-02 05:22:45.010398+00:00","record_version_id":"c188473ea402bf4dab6a4eb6442660f37073f7bf612b4740c1da90fbef4d5782","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-90e5aa456689a3b222016c05c319bbcd0bddd453","semester":"1262","observed_at":"2025-05-25 02:00:10.037905+00:00","record_version_id":"ffb0b93bf9e6694a3079bf6cc897c243fef8f6695247b3aea55d1e97fa6d6832","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-92d960aa7e4cd6e4c9ac8b2e232092904038e9e4","semester":"1262","observed_at":"2025-06-08 01:50:46.451351+00:00","record_version_id":"90bb3146407829af764ab082889badb8d2bec36e8c15c17de686f1ad74b3607d","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-94002ae588a8f71eca6d64105f2e603e8587293b","semester":"1262","observed_at":"2025-05-21 09:01:16.021508+00:00","record_version_id":"16968b24610617c657707c176f0f21932e783ed1b22300eddcaa35c52d029ece","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-9dd575e013c5c6e000ab3ad2d1288cc1dd9c96dc","semester":"1264","observed_at":"2025-12-21 04:47:46.589081+00:00","record_version_id":"352794cc687befc6eb80dafb92593eb4d06f4695b7d91dd0dca89c45e4b08c81","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-a1ea26ed78cbd6e94bc3221e50a6ed9b6bf43871","semester":"1262","observed_at":"2025-05-25 09:16:55.180581+00:00","record_version_id":"9a90a8da6164f2fe18ed8e7b261dd54e6bd32a0e13dce7f87bd159279cce1a36","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-a76a3505853d5ea9c13bb98472b87361d469e2ee","semester":"1262","observed_at":"2025-05-28 18:03:41.793846+00:00","record_version_id":"347e4bde35aead55456dd815e8728926435f70fab53a0d325f40818ad0748e8f","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-b285d591f6acf3aa1910e02edc297664db86eb8c","semester":"1262","observed_at":"2025-06-10 22:48:22.460295+00:00","record_version_id":"e31d25d9ca81039fd5a6c3cfe9f8e3817ce996c62da2fdb6f674dec61393c886","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-b79af756e4f00ba98231feb859ed8e98239eb811","semester":"1262","observed_at":"2025-05-22 02:47:56.931581+00:00","record_version_id":"91f162a2cc5e1eb1d5af24c76b60eba215ef55a854bbe5402c2751cfac6572f0","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-b89e05b94730c6471439082d9279c0a834a4aeec","semester":"1262","observed_at":"2025-08-26 20:25:42.325239+00:00","record_version_id":"1e170ed4343747cb5e3087004916555c1d580c284a135b8aaa7dae6f31519b61","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-b9279a12d1f2688df9e556183c94d41a89e431dc","semester":"1262","observed_at":"2025-07-06 01:49:47.203835+00:00","record_version_id":"1ea2fb8379314e2f56b173c78aa7a43d26a20fed6acd163c8e9b45674887f4df","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-bbdc905e96cc681a5e9a8b02c795b682206e36d1","semester":"1262","observed_at":"2025-06-25 08:02:45.445730+00:00","record_version_id":"6d8cb55b44d62609a4fabddf54dc163d7a4764b33c644df2b78cd4b9b80e9590","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-bde225b5243a13d81827aa173e39c78a652b54a0","semester":"1262","observed_at":"2025-05-23 07:22:33.219345+00:00","record_version_id":"3101ad5a0e8c8add234af76b43a69eeabde3c69f384b5ff834986eed72f5a44c","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-c1fac4cbfde737f4f4ac02cdf15e6f5a9b5b676d","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"c42caaced9050c2b5cd5726e042a21f219b8a28ea57db3b3e43adf711804c2e4","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-c6b62be45f8a13cba109ef2a7741b9cd9a6b8272","semester":"1262","observed_at":"2025-08-24 08:48:09.035112+00:00","record_version_id":"61776ae13c2000b2940d3bc2226399b2f37fb0de1a8fdc1380ddc78fca0d2e52","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-cc83f62cb6db61f39320916d819ad48ce55cd96d","semester":"1262","observed_at":"2025-05-22 00:45:35.735230+00:00","record_version_id":"f7c85c893b5323407143da73e7d0ac1aa7337c1deda0dfa074bcade5574ebd1a","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-d33818a01b6b4c5e2902e704da6e5b713742d4dc","semester":"1262","observed_at":"2025-10-13 10:46:24.251475+00:00","record_version_id":"298babdea7ffef4a16103ea72593f868dfd783011f975cc3b44bd5425b87a90b","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-d3c17db9832d3064916046caf891dd23f10b1bb9","semester":"1262","observed_at":"2025-08-26 11:30:42.288639+00:00","record_version_id":"171d09549337add3a5af433aa77abff6024335641952719c0c237fc7274b7b0b","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-d4ee226dc44268e9b6767fb9f5f20343322f494b","semester":"1262","observed_at":"2025-06-15 01:52:23.911697+00:00","record_version_id":"5ac91832d4f64ad6eca726c7d0f9742300027c41dd29aceb729a8859111cc144","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-d8f9fc7f136e2033556d9d65bbdbdf33425dbdc9","semester":"1262","observed_at":"2025-05-28 16:48:12.400438+00:00","record_version_id":"ee9c676bd15c7e281be871bfd874cacfb1bbfe1c238e98ef170a828bb5b89ce8","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-dbbc9739c616c3846b2e796e00a36fa41225f7d8","semester":"1262","observed_at":"2025-06-01 17:47:19.325144+00:00","record_version_id":"7016c026cf5ecd671fd0265456db7a64e00f8e56ac8ed3016e85e3424e7afcb4","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-dbe5f2d24b48c3177297a3d69c553cc9d1194bac","semester":"1262","observed_at":"2025-09-14 05:00:27.366070+00:00","record_version_id":"a3f2100cad8e263eedd13af4802514eaebc657421ecf1c67aabd61b66ac88a7b","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-dd357dc2758e9e282c30988a527ce37de92593b9","semester":"1264","observed_at":"2025-10-19 01:39:41.951404+00:00","record_version_id":"d1095521dc63ecb0cbd2cbd82f5c52b592a03e70448ab437c09fdf09cfa4e441","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-de74de559e409a3fe668685e28043b888d2e6841","semester":"1262","observed_at":"2025-06-27 07:38:50.882897+00:00","record_version_id":"8ac1079dbeaccbb08027b0559ae66c53d43a1c3ec93fe52d0d85f1f3593ad38f","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-deca7188cf536ade3203cd88b52a45e92a059617","semester":"1262","observed_at":"2025-06-27 00:37:46.087071+00:00","record_version_id":"67fa18b7770a2a5751c57bd389cc3e306f30a2591bebc83b175e0d2b33f1495e","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-df60fa9ac3931c5612b0fa641b7a6f5fbec86fab","semester":"1262","observed_at":"2025-05-24 06:36:37.554678+00:00","record_version_id":"21724e1c584374cf1d7f4175d2f495170ceaacc07bd7abd717493cd7387fa0e7","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-e339da2d849aaf8bb4dceca07a84728af23cf755","semester":"1262","observed_at":"2025-07-23 08:49:22.748925+00:00","record_version_id":"f5ad0b38a9013d36bf1376d4e73925309d771b57aa8bec49632d12e45ce60597","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-e934b1784835f5d36ae9b7ef0992b11e72c39142","semester":"1262","observed_at":"2025-06-01 06:21:25.219533+00:00","record_version_id":"4d319af72d6362a9fe4b4cf00cb4c924dc9f8491d9d3a19d2b3cc7839600aa51","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-ef471690c082448deebd2687eab84b0b78813c36","semester":"1262","observed_at":"2025-06-29 01:47:56.317645+00:00","record_version_id":"e955cbf1170678dbf60eb7fe022197be856a3fbd421271f9df18988145a3a213","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-efc4e8e2cd7c3f68e059a308990c00c77c7611eb","semester":"1264","observed_at":"2025-10-16 05:48:13.935141+00:00","record_version_id":"9956df4e4fd08ba620aa87f8ce8ef421b5b5ce1219e2099941ecb9eb3ed4b05e","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-f18b7749725097d41f69c60779ff38cf073b93b3","semester":"1262","observed_at":"2025-05-21 19:52:03.259353+00:00","record_version_id":"f67420f987a1d49651c2def4244fb25cc25468d42330de0e8706cda7371f714b","course_id":"COMPSCI/ISYE/MATH/STAT 525","course_uid":"course_a04e8d794b24e3b81b984774","catalog_version_id":"e2176c290091ba9b2960587899ae37910570dca538d27b5d0973d4293c1b1edf","course_number":525,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"LINEAR OPTIMIZATION","description":"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory and theorems of the alternatives.","requirements_text":"MATH 320,340,341,375, or443or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"}]