A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality

DOI10.1016/0377-2217(79)90228-5zbMath0405.90062OpenAlexW2004001651MaRDI QIDQ1257414

Jamie J. Goode, Mokhtar S. Bazaraa

Publication date: 1979

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(79)90228-5

zbMATH Keywords

SubdifferentialsLagrangian DualityLagrangian MultipliersShortest SubgradientsSteepest Ascent Directions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods involving duality (49M29) Mathematical programming (90C99)

Related Items (36)

Efficient algorithms for the capacitated concentrator location problem ⋮ A computational evaluation of two subgradient search methods ⋮ New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation ⋮ Solution procedures for the service system design problem ⋮ Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs ⋮ Routing and capacity assignment in backbone communication networks ⋮ A Lagrangian relaxation-based heuristic for the vehicle routing with full container load ⋮ The capacitated maximal covering location problem with backup service ⋮ A surrogate and Lagrangian approach to constrained network problems ⋮ Zur effektiven Lösung von booleschen, quadratischen Optimierungsproblemen ⋮ The hierarchical network design problem with transshipment facilities ⋮ Bandwidth packing with priority classes ⋮ A multiple server location-allocation model for service system design ⋮ Locating concentrators in centralized computer networks ⋮ Capacitated lot-sizing and scheduling by Lagrangean relaxation ⋮ Capacitated emergency facility siting with multiple levels of backup ⋮ The multi-hour service system design problem ⋮ A modified subgradient algorithm for Lagrangean relaxation ⋮ The selection and scheduling of telecommunication calls with time windows ⋮ A coordinated planning model for the design of a distributed database system ⋮ Some relationships between lagrangian and surrogate duality in integer programming ⋮ The traveling salesman problem: A duality approach ⋮ A Benders decomposition based heuristic for the hierarchical production planning problem ⋮ A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions ⋮ An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality ⋮ An interactive method as an aid in solving multi-objective mathematical programming problems ⋮ Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures ⋮ Primary and secondary route selection in backbone communication networks ⋮ The design of service systems with queueing time cost, workload capacities and backup service ⋮ Routing and capacity assignment in backbone communication networks under time varying traffic conditions ⋮ An integrated approach for planning the adoption of client/server systems ⋮ A comparison of two dual-based procedures for solving the p-median problem ⋮ Cellular control of manufacturing systems ⋮ Development and evaluation of an assignment heuristic for allocating cross-trained workers ⋮ Designing a distribution network in a supply chain system: formulation and efficient solution procedure ⋮ Optimal set partitioning, matchings and lagrangian duality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions
• An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality
• Lagrange multipliers and nonlinear programming
• Algorithms for some minimax problems
• An approach to nonlinear programming
• Thevenin decomposition and large-scale optimization
• The Cutting-Plane Method for Solving Convex Programs
• The Decomposition Algorithm for Linear Programs
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
• A dual algorithm for the one-machine scheduling problem
• An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
• The B<scp>oxstep</scp> Method for Large-Scale Optimization
• The traveling salesman problem: A duality approach
• An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems
• An Algorithm for Some Special Nondifferentiable Optimization Problems
• Steepest Ascent for Large Scale Linear Programs
• Validation of subgradient optimization
• The Theory of Max-Min, with Applications
• An Infeasibility-Pricing Decomposition Method for Linear Programs
• An Algorithm for Separable Nonconvex Programming Problems
• Convergence Conditions for Nonlinear Programming Algorithms
• Elements of Large-Scale Mathematical Programming Part I: Concepts
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Minimization of unsmooth functionals
• The traveling-salesman problem and minimum spanning trees: Part II
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• Convergence rate of the gradient descent method with dilatation of the space
• Geometry and resolution of duality gaps
• On the Convergence of Gradient Methods under Constraint
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities

This page was built for publication: A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality