scientific article
From MaRDI portal
Publication:3947447
zbMath0486.90063MaRDI QIDQ3947447
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Nonlinear programming (90C30) Duality theory (optimization) (49N15)
Related Items
Throughput analysis in manufacturing networks ⋮ A new Lagrangian relaxation approach to the generalized assignment problem ⋮ Capacity analysis in repetitive assemble-to-order manufacturing systems ⋮ Constrained multi-project planning problems: A Lagrangean decomposition approach ⋮ Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm ⋮ A queueing-location model with expected service time dependent queueing disciplines ⋮ Breast cancer prediction using the isotonic separation technique ⋮ Mixed partial elasticities in constant returns-to-scale production technologies ⋮ Multiple items procurement under stochastic nonstationary demands ⋮ Approximate stochastic dynamic programming for hydroelectric production planning ⋮ Existence of optimal Lagrange multipliers for certain nonconvex allocation problems ⋮ Use of Lagrangian decomposition in supply chain planning ⋮ Relocation-promotion problem with Euclidean distance ⋮ A heuristic decomposition approach to optimal control in a water supply model ⋮ Convergent duality for the traveling salesman problem ⋮ Formulations and exact algorithms for the vehicle routing problem with time windows ⋮ A Benders decomposition based heuristic for the hierarchical production planning problem ⋮ A convex form of the quadratic assignment problem ⋮ A simple derivation of scale elasticity in data envelopment analysis ⋮ Application of the scenario aggregation approach to a two-stage, stochastic, common component, inventory problem with a budget constraint ⋮ The decomposition principle and algorithms for linear programming ⋮ Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
