
Week 1 Problem Set ARE100A Spring Quarter 2021 Covers Questions: 3, 6, 7, 8, and 9


















Modeling convex piecewise linear functions in a data science application (ℓ1 regression). notes20201209b.pdf Videos and all other materials are copyright 2020 Matthias Köppe and shared as…


Review: mixed 0/1 modeling. Facility location: Aggregated vs. disaggregated formulation. Strengthening the nogood formulation of logical AND using a Chvátal–Gomory cut. General…


Separation of constraints within a cuttingplane algorithm for solving an LP with exponentially many constraints. Warm starts: Adding a valid inequality to a dictionary by rewriting it in the…


Traveling salesperson problem: Separation of the subtour elimination constraints as a combinatorial optimization problem. TSP formulation using cutset constraints, strengthened cutset constraints,…


Back to modeling: The (symmetric, metric) traveling salesperson problem (TSP) in the natural IP formulation. Subtour elimination constraints. Modeling with exponentially many constraints. Constraint…


Structure of the nodearc incidence matrix, rank deficiency. Generalizing the classic transportation problem to transportation problems with transshipment nodes, and to general (single commodity)…


Linear optimization problems in standard form. Linear algebra review: Rank of a matrix. Introducing slack variables. Dictionary, basic and nonbasic variables, basic solution. notes20201012.pdf …
