Elements of Large-Scale Mathematical Programming Part I: Concepts
From MaRDI portal
Publication:5609870
DOI10.1287/mnsc.16.11.652zbMath0209.22801OpenAlexW2045699373MaRDI QIDQ5609870
Publication date: 1970
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.16.11.652
Large-scale problems in mathematical programming (90C06) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00)
Related Items
General communication schemes for multiobjective decision making ⋮ Large-scale optimization with the primal-dual column generation method ⋮ An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Unnamed Item ⋮ The method of double truncation in the decomposition of large-scale problems ⋮ A large scale timetabling problem ⋮ Composite-variable modeling for service parts logistics ⋮ Partitioning procedure for polynomial optimization ⋮ An outer-approximation algorithm for a class of mixed-integer nonlinear programs ⋮ Decomposition strategy for the stochastic pooling problem ⋮ A stochastic programming model for scheduling call centers with global service level agreements ⋮ Multistage system planning for hydrogen production and distribution ⋮ Disjunctive cuts in mixed-integer conic optimization ⋮ A three-phase matheuristic algorithm for the multi-day task assignment problem ⋮ Existence of optimal Lagrange multipliers for certain nonconvex allocation problems ⋮ Incentives, iterative communication, and organizational control ⋮ An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints ⋮ Revised dantzig-wolfe decomposition for staircase-structured linear programs ⋮ Optimal cargo allocation on board a plane: A sequential linear programming approach ⋮ A projective method for structured nonlinear programs ⋮ A partitioning algorithm for the multicommodity network flow problem ⋮ The linearized version of an algorithm for the mixed norms problem ⋮ Generalized Benders' decomposition for topology optimization problems ⋮ Heuristics for vehicle routing problems: sequence or set optimization? ⋮ Stochastic mathematical programs with equilibrium constraints ⋮ Optimality tests for partitioning and sectional search algorithms ⋮ A central cutting plane algorithm for the convex programming problem ⋮ Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Lösung großer linearer Regionalplanungsprobleme mit der Methode vonDantzig undWolfe ⋮ A branch-and-cut algorithm for a class of sum-of-ratios problems ⋮ Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems ⋮ Extended VIKOR as a new method for solving Multiple Objective Large-Scale Nonlinear Programming problems ⋮ Applied unsupervised learning in model reduction of linear dynamic systems ⋮ OPTIMAL ALLOCATION OF TESTING RESOURCE FOR A MODULAR SOFTWARE ⋮ The Benders decomposition algorithm: a literature review ⋮ Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems ⋮ ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations ⋮ Simplicial decomposition in nonlinear programming algorithms ⋮ Foundations of hierarchical control ⋮ Computational aspects of cutting-plane algorithms for geometric programming problems ⋮ Minimization methods with constraints ⋮ Solving large-scale linear programs by aggregation ⋮ Decomposition of arborescent linear programs ⋮ A decomposition algorithm for quadratic programming ⋮ A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions ⋮ Large-scale problem analysis and decomposition theory ⋮ Multilevel decomposition of nonlinear programming problems by dynamic programming ⋮ A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality ⋮ A novel modeling approach for express package carrier planning ⋮ Simplicial Decomposition for Convex Generalized Networks ⋮ An algorithm for a piecewise linear model of trade and production with negative prices and bankruptcy ⋮ Using dual network bounds in algorithms for solving generalized set packing/partitioning problems ⋮ An augmented Lagrangian decomposition method for block diagonal linear programming problems ⋮ Generalized Benders decomposition ⋮ Identification of special structure constraints in linear programs ⋮ Parametric solution to the joint system identification and optimization problem ⋮ A mixed integer programming model for scheduling orders in a steel mill ⋮ A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals ⋮ Mixed-integer quadratic programming ⋮ An ideal column algorithm for integer programs with special ordered sets of variables ⋮ AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS ⋮ Large-scale mixed integer programming: Benders-type heuristics ⋮ An algorithm for hierarchical optimization of large-scale problems with nested structure ⋮ An outer-approximation guided optimization approach for constrained neural network inverse problems ⋮ An extension of the frank and Wolfe method of feasible directions ⋮ Applications of a general convergence theory for outer approximation algorithms ⋮ Validation of subgradient optimization ⋮ Finiteness in restricted simplicial decomposition ⋮ Average shadow prices in mathematical programming ⋮ A heuristic for the continuous capacity and flow assignment
