An algebra-based approach for linearly constrained concave minimization

DOI10.1016/S0898-1221(02)80006-2zbMath1050.65063OpenAlexW2060078637MaRDI QIDQ1876470

Hong Yan, Quan-Ling Wei

Publication date: 20 August 2004

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(02)80006-2

zbMATH Keywords

numerical examplesquasi-concave functionExtreme pointsLinear constraintsalgebra-based methodquasi-concave minimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Cites Work

• An Automatic Method of Solving Discrete Programming Problems
• A method of transferring cones of intersection form to cones of sum form and its applications in data envelopment analysis models
• On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
• A bilinear programming formulation of the 3-dimensional assignment problem
• Characterization of linear complementarity problems as linear programs
• On solving linear complementarity problems as linear programs
• A linear max—min problem
• Deterministic algorithms for constrained concave minimization: A unified critical survey
• Solving the Fixed Charge Problem by Ranking the Extreme Points
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item