Nondifferentiable Optimization of Lagrangian Dual Formulations for Linear Programs with Recovery of Primal Solutions
This dissertation is concerned with solving large-scale, ill-structured linear programming (LP) problems via Lagrangian dual (LD) reformulations. A principal motivation for this work arises in the context of solving mixed-integer programming (MIP) problems where LP relaxations, sometimes in higher d...
Main Author: | Lim, Churlzu |
---|---|
Other Authors: | Industrial and Systems Engineering |
Format: | Others |
Published: |
Virginia Tech
2014
|
Subjects: | |
Online Access: | http://hdl.handle.net/10919/28144 http://scholar.lib.vt.edu/theses/available/etd-06282004-125356/ |
Similar Items
-
Nondifferentiable optimization algorithms with application to solving Lagrangian dual problems
by: Choi, Gyunghyun
Published: (2014) -
Lagrangian Relaxation / Dual Approaches For Solving Large-Scale Linear Programming Problems
by: Madabushi, Ananth R.
Published: (2014) -
Duality in nondifferentiable minimax fractional programming with <it>B</it>-(<it>p</it>, <it>r</it>)<b>-</b>invexity
by: Kailey N, et al.
Published: (2011-01-01) -
Modeling of drone-reflected doppler signals using fractal nondifferentiable functions
by: R.E. Pashchenko, et al.
Published: (2020-09-01) -
Robust passivity analysis of mixed delayed neural networks with interval nondifferentiable time-varying delay based on multiple integral approach
by: Thongchai Botmart, et al.
Published: (2021-01-01)