Lagrangian Relaxation / Dual Approaches For Solving Large-Scale Linear Programming Problems
This research effort focuses on large-scale linear programming problems that arise in the context of solving various problems such as discrete linear or polynomial, and continuous nonlinear, nonconvex programming problems, using linearization and branch-and-cut algorithms for the discrete case, and...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
Virginia Tech
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10919/36833 http://scholar.lib.vt.edu/theses/available/etd-612112439741131/ |