Quasi-concave minimization subject to linear constraints

DOI10.1016/0012-365X(74)90070-3zbMath0301.90037MaRDI QIDQ1215459

Antal Majthay, Andrew B. Whinston

Publication date: 1974

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (28)

Calculating a minimal sphere containing a polytope defined by a system of linear inequalities ⋮ An algorithm for optimizing over the weakly-efficient set ⋮ A weighting method for 0-1 indefinite quadratic bilevel programming ⋮ A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron ⋮ Using convex envelopes to solve the interactive fixed-charge linear programming problem ⋮ On the structure and properties of a linear multilevel programming problem ⋮ A finite procedure to generate feasible points for the extreme point mathematical programming problem ⋮ Quadratic programming problems and related linear complementarity problems ⋮ A general purpose exact solution method for mixed integer concave minimization problems ⋮ A finite cutting plane method for solving linear programs with an additional reverse convex constraint ⋮ A finitely convergent procedure for facial disjunctive programs ⋮ A finite algorithm for solving the generalized lattice point problem ⋮ Accelerating convergence of cutting plane algorithms for disjoint bilinear programming ⋮ Efficient algorithms for solving rank two and rank three bilinear programming problems ⋮ Degeneracy removal in cutting plane methods for disjoint bilinear programming ⋮ A vector linear programming approach for certain global optimization problems ⋮ Optimization of linear-convex programs ⋮ Linear multiplicative programming ⋮ Minimization of ratios ⋮ A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron ⋮ On measuring the inefficiency with the inner-product norm in data envelopment analysis ⋮ Separable concave minimization via partial outer approximation and branch and bound ⋮ On the nonlinear multilevel programming problems ⋮ A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts ⋮ On generalization performance and non-convex optimization of extended \(\nu \)-support vector machine ⋮ On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs ⋮ On the global minimization of concave functions ⋮ Global optimization algorithms for linearly constrained indefinite quadratic problems

Cites Work

• Convexity cuts for multiple choice problems
• Fixed-cost transportation problems
• An Algorithm for Finding All Vertices of Convex Polyhedral Sets
• The Generalized Lattice-Point Problem
• Integer Programming: Methods, Uses, Computations
• A method for solving maximum-problems with a nonconcave quadratic objective function
• An approximate solution method for the fixed charge problem
• The fixed charge problem
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
• An approximative algorithm for the fixed charge problem
• Eine Methode zur Berechnung des optimalen Produktionsprogramms bei konkaver Zielfunktion
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Hypercylindrically Deduced Cuts in Zero-One Integer Programs
• The fractional fixed-charge problem
• Solving the Fixed Charge Problem by Ranking the Extreme Points

This page was built for publication: Quasi-concave minimization subject to linear constraints