Sufficient optimality criterion for linearly constrained, separable concave minimization problems
From MaRDI portal
Publication:2569195
DOI10.1007/s10957-005-2089-zzbMath1079.90149OpenAlexW1966484781MaRDI QIDQ2569195
Publication date: 18 October 2005
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-005-2089-z
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- Sufficient conditions for solving linearly constrained separable concave global minimization problems
- An algorithm for a concave production cost network flow problem
- 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
- A finite algorithm for global minimization of separable concave programs
- Concave programming in control theory
- Nonconvex optimization over a polytope using generalized capacity improvement
- On the solution of concave knapsack problems
- Separable concave minimization via partial outer approximation and branch and bound
- Practical Piecewise-Linear Approximation for Monotropic Optimization
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
- The Complexity of Vertex Enumeration Methods
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- A branch and bound algorithm for solving a class of nonlinear integer programming problems
- Some NP-complete problems in quadratic and nonlinear programming
- A method for globally minimizing concave functions over convex sets
- An algorithm for determining all extreme points of a convex polytope
- Process network synthesis: Problem definition
- An Algorithm for Separable Nonconvex Programming Problems
- A Lagrangian based branch-and-bound algorithm for production-transportation problems
- Finite exact branch-and-bound algorithms for concave minimization over polytopes
This page was built for publication: Sufficient optimality criterion for linearly constrained, separable concave minimization problems
