A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
An Algorithm for Separable Nonconvex Programming Problems
Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
Decomposition Principle for Linear Programs
Title not available (Why is that?)
The Validity of a Family of Optimization Methods
Title not available (Why is that?)
Iterative Solution of Nonlinear Optimal Control Problems
Finding all vertices of a convex polyhedron
Solving the Fixed Charge Problem by Ranking the Extreme Points
On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
The Direct Power of Adjacent Vertex Programming Methods
A Successive Underestimation Method for Concave Minimization Problems
Quasi-concave minimization subject to linear constraints
Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
An Algorithm for Finding All Vertices of Convex Polyhedral Sets
Variations on a cutting plane method for solving concave minimization problems with linear constraints
Global Maximization of a Convex Function with Linear Inequality Constraints
Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
Convexity Cuts and Cut Search
Concave minimization over a convex polyhedron
Title not available (Why is that?)
A method for solving maximum-problems with a nonconcave quadratic objective function
Eine Methode zur Berechnung des optimalen Produktionsprogramms bei konkaver Zielfunktion

Cited In (8)

On the structure and properties of a linear multilevel programming problem
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
On the global minimization of concave functions
Global optimization algorithms for linearly constrained indefinite quadratic problems
Linear programs with an additional reverse convex constraint
Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual
Separable concave minimization via partial outer approximation and branch and bound

This page was built for publication: A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4136974)