scientific article; zbMATH DE number 3356467
From MaRDI portal
Publication:5630824
zbMath0224.90038MaRDI QIDQ5630824
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Linear programming (90C05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items (only showing first 100 items - show all)
General communication schemes for multiobjective decision making ⋮ Lagrangian coordination and analytical target cascading: Solving ATC-decomposed problems with Lagrangian duality ⋮ Multiple allocation hub-and-spoke network design under hub congestion ⋮ A solution comparison for dual angular linear programs ⋮ A new Lagrangian relaxation approach to the generalized assignment problem ⋮ Branch-and-price algorithm for the resilient multi-level hop-constrained network design ⋮ Local decomposition methods for linear programming ⋮ A subgradient selection method for minimizing convex functions subject to linear constraints ⋮ Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms ⋮ Shares allocation methods for generalized game problems with joint constraints ⋮ A multicut algorithm for two-stage stochastic linear programs ⋮ Exploiting special structure in Karmarkar's linear programming algorithm ⋮ An algorithm for decomposition coordination of large scale convex programming problems ⋮ A new integer programming formulation for the permutation flowshop problem ⋮ A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems ⋮ New stability and stabilization for switched neutral control systems ⋮ An interactive fuzzy satisficing method for multiobjective nonlinear integer programming problems with block-angular structures through genetic algorithms with decomposition procedures ⋮ Exact decomposition approaches for Markov decision processes: a survey ⋮ A classification of methods for distributed system optimization based on formulation structure ⋮ A fuzzy satisficing method for large-scale linear programming problems with block angular structure ⋮ On the cutting stock problem under stochastic demand ⋮ Input/output selection in DEA under expert information, with application to financial markets ⋮ A property of certain multistage linear programs and some applications ⋮ Suboptimal switching control consistency analysis for discrete-time switched linear systems ⋮ Analysis of decomposition algorithms via nonlinear splitting functions ⋮ Existence of optimal Lagrange multipliers for certain nonconvex allocation problems ⋮ Feasible direction method for large-scale nonconvex programs: Decomposition approach ⋮ Set partitioning mit linearen Randbedingungen ⋮ Algebraic properties of satisficing decision criterion ⋮ Hierarchical multi-objective decision systems for general resource allocation problems ⋮ A branch and price solution approach for order acceptance and capacity planning in make-to-order operations ⋮ Decomposition of satisficing decision problems ⋮ Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method ⋮ Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation ⋮ Multi-level optimization for multi-objective problems ⋮ On the solution of generalized multiplicative extremum problems ⋮ Delay-dependent BIBO stability analysis of switched uncertain neutral systems ⋮ Modified Lagrangian methods for separable optimization problems ⋮ Theory construction in psychology: The interpretation and integration of psychological data ⋮ Unified approach for the optimization of nonlinear hydraulic systems ⋮ Benders' decomposition for the constrained \(\ell_ 1\)-problem ⋮ Fractional programming by lower subdifferentiability techniques ⋮ An augmented Lagrangian relaxation for analytical target cascading using the alternating direction method of multipliers ⋮ An implementation of Lagrangian decomposition in solving a multi-item production scheduling problem with changeover cost and restrictions ⋮ A heuristic decomposition approach to optimal control in a water supply model ⋮ Linear lexicographic optimization ⋮ Parallel processing of optimal-control problems by dynamic programming ⋮ Decomposition methods in multiobjective discrete-time dynamic problems ⋮ Stabilization and robust \(H_\infty\) control for sector-bounded switched nonlinear systems ⋮ Optimality tests for partitioning and sectional search algorithms ⋮ A convex analysis approach for convex multiplicative programming ⋮ Turning restriction design in traffic networks with a budget constraint ⋮ New overlapping coordination methodologies for large-scale optimization problems ⋮ A branch-and-cut algorithm for a class of sum-of-ratios problems ⋮ A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure ⋮ Integrated airline scheduling ⋮ A fuzzy satisficing method for large-scale multiobjective linear programming problems with block angular structure ⋮ Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems ⋮ Lagrangean relaxation based heuristics for lot sizing with setup times ⋮ Using central prices in the decomposition of linear programs ⋮ A barrier method for dynamic Leontief-type linear programs ⋮ Routing flexibility and production scheduling in a flexible manufacturing system ⋮ Uncertain random multilevel programming with application to production control problem ⋮ Exact algorithms for the matrix bid auction ⋮ Decomposition in general mathematical programming ⋮ Systems of seemingly unrelated regression equations with time varying coefficients -- an interplay of Kalman filtering, scoring, EM- and MINQUE-method ⋮ Application of the alternating direction method of multipliers to separable convex programming problems ⋮ On discrete lot-sizing and scheduling on identical parallel machines ⋮ An anytime deduction algorithm for the probabilistic logic and entailment problems ⋮ A nonsmooth optimization problem in envelope constrained filtering ⋮ An outcome space approach for generalized convex multiplicative programs ⋮ Recent advances in gradient algorithms for optimal control problems ⋮ A generalized Lagrangian function and multiplier method ⋮ Generation of optimal schedules for metro lines using model predictive control ⋮ Variable metric methods in Hilbert space with applications to control problems ⋮ Shipment planning at oil refineries using column generation and valid inequalities ⋮ Function-space quasi-Newton algorithms for optimal control problems with bounded controls and singular arcs ⋮ Approximate dynamic programming via direct search in the space of value function approximations ⋮ Horizontal mixed decomposition ⋮ A modification of Karmarkar's linear programming algorithm ⋮ Column generation decomposition with the degenerate constraints in the subproblem ⋮ Practical enhancements to the Magnanti-Wong method ⋮ Problems of efficient application and development of a network under capital investments and credits ⋮ Two-level primal-dual decomposition technique for large-scale nonconvex optimization problems with constraints ⋮ Parallel solution of large-scale, block-angular linear programs ⋮ Theoretical properties and numerical tests of an efficient nonlinear decomposition algorithm ⋮ A fuzzy approach to hierarchical multiobjective programming problems and its application to an industrial pollution control problem ⋮ Globally convergent decomposition methods for nonconvex optimization problems ⋮ On the characterization of noninferior solutions of the vector optimization problem ⋮ Dual simplex method for GUB problems ⋮ Envelope-constrained filters with uncertain input ⋮ Ranking of vertices in the linear fractional programming problem ⋮ On a space extension algorithm for nondifferentiable optimization ⋮ Convergence behavior of decomposition algorithms for linear programs ⋮ The optimization of an interconnected system with multiple decision makers ⋮ Linear programming on a micro - The case of the Apple II ⋮ Geometric and algorithmic developments for a hierarchical planning problem ⋮ Note on solving linear complementarity problems as jointly constrained bilinear programs ⋮ An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type ⋮ Decomposition method of descent for minimizing the sum of convex nonsmooth functions
This page was built for publication:
