A finite algorithm for concave minimization over a polyhedron
From MaRDI portal
Publication:3705227
DOI10.1002/nav.3800320119zbMath0581.90080OpenAlexW2089656647MaRDI QIDQ3705227
Publication date: 1985
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800320119
bilinear programmingcomputational experiencepolyhedral domainlinear programming subproblemsbranch-and-bound typeglobally optimal extreme point solutionnonseparable concave function
Related Items
An algorithm for optimizing over the weakly-efficient set, A finite concave minimization algorithm using branch and bound and neighbor generation, A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization, Using convex envelopes to solve the interactive fixed-charge linear programming problem, On the structure and properties of a linear multilevel programming problem, A note on the solution of bilinear programming problems by reduction to concave minimization, Nonconvex optimization over a polytope using generalized capacity improvement, Discontinuous piecewise linear optimization, A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables, A general purpose exact solution method for mixed integer concave minimization problems, Solving polyhedral d.c. optimization problems via concave minimization, Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions, Calculation of bounds on variables satisfying nonlinear inequality constraints, A note on adapting methods for continuous global optimization to the discrete case, Separable concave minimization via partial outer approximation and branch and bound, Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation, Subdivision of simplices relative to a cutting plane and finite concave minimization, A branch and bound-outer approximation algorithm for concave minimization over a convex set
Uses Software
