Minimizing a quasi-concave function subject to a reverse convex constraint

DOI10.1007/BF01443624zbMath0653.90059OpenAlexW2086640159MaRDI QIDQ1108198

L. V. Dien

Publication date: 1988

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01443624

zbMATH Keywords

global optimizationbranch and boundcutting planereverse convex constraintconcave program

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (1)

A counterexample to a global optimization algorithm

Cites Work

• Unnamed Item
• Linear programs with an additional reverse convex constraint
• A method for globally minimizing concave functions over convex sets
• Convergent Algorithms for Minimizing a Concave Function
• An algorithm for nonconvex programming problems
• A Successive Underestimation Method for Concave Minimization Problems
• Convex Analysis

This page was built for publication: Minimizing a quasi-concave function subject to a reverse convex constraint