ConceptEngineering
Lower bound in ACCPM
Obtaining a lower bound on the optimal value by solving the dual of the piecewise linear relaxed problem constructed during analytic center cutting plane method iterations.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.