Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
From MaRDI portal
Publication:3850361
DOI10.1287/opre.11.3.399zbMath0113.14202OpenAlexW2069277547MaRDI QIDQ3850361
Publication date: 1963
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.11.3.399
Related Items (only showing first 100 items - show all)
Multi-item spare parts systems with lateral transshipments and waiting time constraints ⋮ Optimum dimensional synthesis of planar mechanisms with geometric constraints ⋮ Decomposition in multi-item inventory control ⋮ Lagrangean relaxation. (With comments and rejoinder). ⋮ Stochastic allocation of a resource among partially interchangeable activities ⋮ Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms ⋮ Lagrangian coordination and analytical target cascading: Solving ATC-decomposed problems with Lagrangian duality ⋮ Efficient algorithms for the capacitated concentrator location problem ⋮ A new Lagrangian relaxation approach to the generalized assignment problem ⋮ A maximum entropy method for a robust portfolio problem ⋮ Utility, probabilistic constraints, mean and variance of discounted rewards in Markov decision processes ⋮ Newsvendor characterizations for one-warehouse multi-retailer inventory systems with discrete demand under the balance assumption ⋮ A forward maximum principle algorithm with decision horizon results ⋮ Optimal contract design in the joint economic lot size problem with multi-dimensional asymmetric information ⋮ Solving the \(p\)-median problem with a semi-Lagrangian relaxation ⋮ Optimizing stop plan and tickets allocation for high-speed railway based on uncertainty theory ⋮ Distributed media cooperation for enhanced video communication ⋮ Clause weighting local search for SAT ⋮ Additively separable duality theory ⋮ A recursive Lagrangian method for clustering problems ⋮ Method of digraphs for multi-dimensional screening ⋮ Solving network manpower problems with side constraints ⋮ Dynamic pricing of a web service in an advance selling environment ⋮ A Lagrangean approach to the degree-constrained minimum spanning tree problem ⋮ A submodular approach to discrete dynamic programming ⋮ Constrained Optimization on Hierarchies and Braids of Partitions ⋮ A two-item two-warehouse periodic review inventory model with transshipment ⋮ Integrating combinatorial algorithms into a linear programming solver ⋮ Existence of optimal Lagrange multipliers for certain nonconvex allocation problems ⋮ A distributed algorithm for fitting generalized additive models ⋮ Fast approximate energy minimization with label costs ⋮ Use of Lagrangian decomposition in supply chain planning ⋮ Metric selection in fast dual forward-backward splitting ⋮ Decomposition of satisficing decision problems ⋮ A Lagrangian treatment of certain nonlinear clustering problems ⋮ Optimization of spare parts for hierarchically decomposable systems ⋮ Parallel multi-block ADMM with \(o(1/k)\) convergence ⋮ A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem ⋮ Ersatzteilbemessung für reparierbare Geräte. Grundlegende Modelle und Verfahren ⋮ The capacitated maximal covering location problem with backup service ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Dynamic Bezier curves for variable rate-distortion ⋮ COSMO: a conic operator splitting method for convex conic problems ⋮ Distributed optimization and control with ALADIN ⋮ A parallel iterative algorithm for structural optimization ⋮ Formulations and exact algorithms for the vehicle routing problem with time windows ⋮ Unconstrained duals to partially separable constrained programs ⋮ Computational approaches to variance-penalised Markov decision processes ⋮ A multi-item approach to repairable stocking and expediting in a fluctuating demand environment ⋮ Capacitated emergency facility siting with multiple levels of backup ⋮ Greedy algorithm for the general multidimensional knapsack problem ⋮ Convergent Lagrangian heuristics for nonlinear minimum cost network flows ⋮ Downlink resource allocation for autonomous infrastructure-based multihop cellular networks ⋮ Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method ⋮ Towards the real time solution of strike force asset allocation problems ⋮ Determining strategy of pricing for a web service with different QoS levels and reservation level constraint ⋮ A generalized Lagrangian function and multiplier method ⋮ A Lagrangian bound for many-to-many assignment problems ⋮ Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search ⋮ A generalization of Lagrange's method of undetermined multipliers using zero-zone functionals ⋮ Studying properties of Lagrangian bounds for many-to-many assignment problems ⋮ Conjugate duality and its implications in dynamic programming ⋮ An approximate solution approach for a scenario-based capital budgeting model ⋮ Allocation of resources according to a fractional objective ⋮ A novel analytical integer optimization method for wavelet based subband coding ⋮ Convexification procedures and decomposition methods for nonconvex optimization problems ⋮ Upper bounds for strictly concave distortion risk measures on moment spaces ⋮ An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization ⋮ A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality ⋮ Partially distributed outer approximation ⋮ Product selection and space allocation in supermarkets ⋮ Facility siting and integer-friendly programming ⋮ Lagrange multipliers and nonlinear programming ⋮ Dynamic programming and inequalities ⋮ Nonlinear programming: Global use of the Lagrangian ⋮ A note on optimization using the augmented penalty function ⋮ Convexity and concavity properties of the optimal value function in parametric nonlinear programming ⋮ Transformation of integer programs to knapsack problems ⋮ Resource allocation to defensive marketing and manufacturing strategies ⋮ On high-resolution adaptive sampling of deterministic signals ⋮ A theorem of the alternative with application to convex programming: optimality, duality, and stability ⋮ Parametric solution to the joint system identification and optimization problem ⋮ A new duality theory for mathematical programming ⋮ Theorems of the alternative and optimality conditions ⋮ Dynamic programming using the Fritz-John conditions ⋮ Globally convergent decomposition methods for nonconvex optimization problems ⋮ The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization ⋮ A heuristic algorithm for the multidimensional zero-one knapsack problem ⋮ On the characterization of noninferior solutions of the vector optimization problem ⋮ Revisiting augmented Lagrangian duals ⋮ Zero-one integer programs with few contraints - lower bounding theory ⋮ A multiple objective interactive Lagrangean relaxation approach ⋮ A restriction and feasible direction algorithm for a capacity expansion problem ⋮ A heuristic approach to hard constrained shortest path problems ⋮ ASEAN industrial cooperation: The case of multi-product capacity expansion ⋮ The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm ⋮ A three echelon spare parts provisioning model ⋮ The primal-dual algorithm as a constraint-set-manipulation device ⋮ On geometric programming and complementary slackness
This page was built for publication: Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
