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

Cites work

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

Cited in

(8)

Global optimization algorithms for linearly constrained indefinite quadratic problems
Linear programs with an additional reverse convex constraint
A general purpose exact solution method for mixed integer concave minimization problems
On the structure and properties of a linear multilevel programming problem
Separable concave minimization via partial outer approximation and branch and bound
Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints
Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual
On the global minimization of concave functions

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)