A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
From MaRDI portal
Publication:4136974
DOI10.1007/BF01584324zbMath0362.90108MaRDI QIDQ4136974
Publication date: 1977
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items (8)
On the structure and properties of a linear multilevel programming problem ⋮ Linear programs with an additional reverse convex constraint ⋮ A general purpose exact solution method for mixed integer concave minimization problems ⋮ Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints ⋮ Separable concave minimization via partial outer approximation and branch and bound ⋮ Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual ⋮ On the global minimization of concave functions ⋮ Global optimization algorithms for linearly constrained indefinite quadratic problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quasi-concave minimization subject to linear constraints
- Finding all vertices of a convex polyhedron
- Decomposition Principle for Linear Programs
- An Algorithm for Finding All Vertices of Convex Polyhedral Sets
- Global Maximization of a Convex Function with Linear Inequality Constraints
- Variations on a cutting plane method for solving concave minimization problems with linear constraints
- A Successive Underestimation Method for Concave Minimization Problems
- Concave minimization over a convex polyhedron
- Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
- A method for solving maximum-problems with a nonconcave quadratic objective function
- The Direct Power of Adjacent Vertex Programming Methods
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
- An Algorithm for Separable Nonconvex Programming Problems
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
- The Validity of a Family of Optimization Methods
- Eine Methode zur Berechnung des optimalen Produktionsprogramms bei konkaver Zielfunktion
- Iterative Solution of Nonlinear Optimal Control Problems
- Solving the Fixed Charge Problem by Ranking the Extreme Points
- Convexity Cuts and Cut Search
- An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
This page was built for publication: A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
