An Algorithm for Separable Nonconvex Programming Problems
From MaRDI portal
Publication:5558786
DOI10.1287/mnsc.15.9.550zbMath0172.43802OpenAlexW2098968017MaRDI QIDQ5558786
Richard M. Soland, James E. Falk
Publication date: 1969
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.15.9.550
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items
Variations and extension of the convex-concave procedure, A weighting method for 0-1 indefinite quadratic bilevel programming, A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, Solving the staircase cost facility location problem with decomposition and piecewise linearization, Tabu search applied to the general fixed charge problem, Extended reverse-convex programming: an approximate enumeration approach to global optimization, Decomposition based and branch and bound global optimization approaches for the phase equilibrium problem, Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization, On some optimization problems under uncertainty, A revision of the rectangular algorithm for a class of DC optimization problems, Deletion-by-infeasibility rule for DC-constrained global optimization, An interval branch and bound algorithm for global optimization of a multiperiod pricing model, Cold supply chain design with environmental considerations: a simulation-optimization approach, On consistency of bounding operations in deterministic global optimization, A branch and bound network approach to the canonical constrained entropy problem, Second-order sensitivity analysis in factorable programming: Theory and applications, Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems, Deterministic global optimization in ab-initio quantum chemistry, A branch-and-reduce approach to global optimization, An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks, Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience, Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations, Reversed geometric programming: A branch-and-bound method involving linear subproblems, Facets of a mixed-integer bilinear covering set with bounds on variables, A practical but rigorous approach to sum-of-ratios optimization in geometric applications, On the convergence of two branch-and-bound algorithms for nonconvex programming problems, Domain reduction techniques for global NLP and MINLP optimization, A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies, Algorithms for parametric nonconvex programming, A branch-and-bound algorithm embedded with DCA for DC programming, Global optimization of bounded factorable functions with discontinuities, Membership functions, some mathematical programming models and production scheduling, Optimal deviations from an asset allocation., Deterministic global optimization of steam cycles using the IAPWS-IF97 model, LP-form inclusion functions for global optimization, Solving a class of multiplicative programs with 0-1 knapsack constraints, A combined cutting-stock and lot-sizing problem, Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms, An all-linear programming relaxation algorithm for optimizing over the efficient set, Existence and sum decomposition of vertex polyhedral convex envelopes, Power-to-chemicals: a superstructure problem for sustainable syngas production, Reverse propagation of McCormick relaxations, A new simplicial cover technique in constrained global optimization, Biconvex sets and optimization with biconvex functions: a survey and extensions, Convergence qualification of adaptive partition algorithms in global optimization, Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets, Generalized bilinear programming. I: Models, applications and linear programming relaxation, Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems, Global search algorithms for minimum concave-cost network flow problems, On the indefinite quadratic bilevel programming problem., A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems, Calculation of bounds on variables satisfying nonlinear inequality constraints, Linear multiplicative programming, Discrete solutions to engineering design problems, A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs, Mean-variance portfolio optimal problem under concave transaction cost, A fast memoryless interval-based algorithm for global optimization, Robust network design in telecommunications under polytope demand uncertainty, On solving nonconvex optimization problems by reducing the duality gap, Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities, Fractional programming with convex quadratic forms and functions, Convergent upper bounds in global minimization with nonlinear equality constraints, A branch and bound algorithm for solving a class of D-C programming, An exact algorithm for the concave transportation problem, A note on adapting methods for continuous global optimization to the discrete case, A parallel algorithm for partially separable non-convex global minimization: Linear constraints, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, Separable concave minimization via partial outer approximation and branch and bound, Global optimization of linear hybrid systems with explicit transitions, A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision, On the nonlinear multilevel programming problems, A branch and reduce approach for solving a class of low rank d.c. programs, A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems, A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality, The cluster problem revisited, Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem, Progress payments in project scheduling problems., Subdivision of simplices relative to a cutting plane and finite concave minimization, Decomposition of mathematical programming problems by dynamic programming and its application to block-diagonal geometric programms, Ordering policies of a deteriorating item in an EOQ model under upstream partial order-quantity-dependent trade credit and downstream full trade credit, Discretizing dynamic programs, Credal networks, On optimal zero-preserving corrections for inconsistent linear systems, Sufficient optimality criterion for linearly constrained, separable concave minimization problems, The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization, An algorithm for optimizing network flow capacity under economies of scale, Fair transfer price and inventory holding policies in two-enterprise supply chains, Optimization of a long-short portfolio under nonconvex transaction cost, Global optimization versus integer programming in portfolio optimization under nonconvex transaction costs, Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations, On the convexification of nonlinear programming problems: An applications-oriented survey, On the global minimization of concave functions, A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization, The polyadic structure of factorable function tensors with applications to high-order minimization techniques, Global optimization algorithms for linearly constrained indefinite quadratic problems, Interval branch and bound with local sampling for constrained global optimization, Proof of convergence for a global optimization algorithm for problems with ordinary differential equations, Decomposition methods for solving nonconvex quadratic programs via branch and bound, Global optimization of nonconvex problems with multilinear intermediates, Dual toll pricing for hazardous materials transport with linear delay, COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS, A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem, Stochastic allocation of inspection capacity to competitive processes, A fast algorithm for globally solving Tikhonov regularized total least squares problem, Strong valid inequalities for orthogonal disjunctions and bilinear covering sets, A decomposition approach for global optimum search in QP, NLP and MINLP problems, An implicit enumeration method for global optimization problems, An algorithm for indefinite integer quadratic programming, Optimization of vehicle speed for batches to minimize supply chain cost under uncertain demand, An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives, Convex and concave relaxations of implicit functions, A general purpose exact solution method for mixed integer concave minimization problems, (Global) optimization: historical notes and recent developments, Subdomain separability in global optimization, MINIMAL COST INDEX TRACKING UNDER NONLINEAR TRANSACTION COSTS AND MINIMAL TRANSACTION UNIT CONSTRAINTS, Minimizing a sum of staircase functions under linear constraints, Global optimization using special ordered sets, Global solution of non-convex quadratically constrained quadratic programs, An algorithm for nonconvex programming problems, Global optimization, On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions, Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems, Quasiconvex relaxations based on interval arithmetic, A continuous approch for globally solving linearly constrained quadratic, A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron, Reachability Analysis and Deterministic Global Optimization of DAE Models, A method for globally minimizing concave functions over convex sets, Preface, Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual, Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint, The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms, Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints, Extension of optimality conditions via supporting functions
