Pages that link to "Item:Q3850361"

The following pages link to Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources (Q3850361):

Displaying 50 items.

• Computational approaches to variance-penalised Markov decision processes (Q1198139) (← links)
• A generalized Lagrangian function and multiplier method (Q1214669) (← links)
• A generalization of Lagrange's method of undetermined multipliers using zero-zone functionals (Q1219830) (← links)
• Allocation of resources according to a fractional objective (Q1243666) (← links)
• Convexification procedures and decomposition methods for nonconvex optimization problems (Q1251185) (← links)
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality (Q1257414) (← links)
• Product selection and space allocation in supermarkets (Q1259976) (← links)
• Facility siting and integer-friendly programming (Q1261377) (← links)
• Resource allocation to defensive marketing and manufacturing strategies (Q1278332) (← links)
• The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm (Q1318275) (← links)
• On geometric programming and complementary slackness (Q1321217) (← links)
• Stochastic allocation of a resource among partially interchangeable activities (Q1333555) (← links)
• Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms (Q1338142) (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
• Dynamic programming using the Fritz-John conditions (Q1577116) (← links)
• Dynamic pricing of a web service in an advance selling environment (Q1666561) (← links)
• Parallel multi-block ADMM with \(o(1/k)\) convergence (Q1704845) (← links)
• A multi-item approach to repairable stocking and expediting in a fluctuating demand environment (Q1752175) (← links)
• Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method (Q1761134) (← links)
• Towards the real time solution of strike force asset allocation problems (Q1765539) (← links)
• Upper bounds for strictly concave distortion risk measures on moment spaces (Q1799647) (← links)
• Theorems of the alternative and optimality conditions (Q1836144) (← links)
• The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization (Q1842902) (← links)
• Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
• Additively separable duality theory (Q1908637) (← links)
• Distributed optimization and control with ALADIN (Q1980563) (← links)
• Determining strategy of pricing for a web service with different QoS levels and reservation level constraint (Q2009945) (← links)
• Studying properties of Lagrangian bounds for many-to-many assignment problems (Q2017507) (← links)
• Partially distributed outer approximation (Q2046262) (← links)
• Revisiting augmented Lagrangian duals (Q2097636) (← links)
• Optimum dimensional synthesis of planar mechanisms with geometric constraints (Q2121228) (← links)
• Optimizing stop plan and tickets allocation for high-speed railway based on uncertainty theory (Q2153571) (← links)
• COSMO: a conic operator splitting method for convex conic problems (Q2231337) (← links)
• Conjugate duality and its implications in dynamic programming (Q2277162) (← links)
• On high-resolution adaptive sampling of deterministic signals (Q2320451) (← links)
• Method of digraphs for multi-dimensional screening (Q2399327) (← links)
• Integrating combinatorial algorithms into a linear programming solver (Q2418164) (← links)
• A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
• Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
• Greedy algorithm for the general multidimensional knapsack problem (Q2480198) (← links)
• Convergent Lagrangian heuristics for nonlinear minimum cost network flows (Q2480971) (← links)
• Lagrange multipliers and nonlinear programming (Q2526613) (← links)
• Nonlinear programming: Global use of the Lagrangian (Q2535944) (← links)
• Transformation of integer programs to knapsack problems (Q2547181) (← links)
• A theorem of the alternative with application to convex programming: optimality, duality, and stability (Q2557650) (← links)
• Parametric solution to the joint system identification and optimization problem (Q2560613) (← links)
• A novel analytical integer optimization method for wavelet based subband coding (Q2798128) (← links)
• An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization (Q2805706) (← links)
• Constrained Optimization on Hierarchies and Braids of Partitions (Q2946806) (← links)
• A new duality theory for mathematical programming (Q3112511) (← links)