Quasi-concave minimization subject to linear constraints
type: Item
instance of: scholarly article
title: Quasi-concave minimization subject to linear constraints
zbMATH Open document ID: 0301.90037
DOI: 10.1016/0012-365X(74)90070-3
author: Antal Majthay
author: Andrew B. Whinston
published in: Discrete Mathematics
publication date: 1974-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3471798
MaRDI profile type: Publication
cites work: The fractional fixed-charge problem
cites work: Intersection Cuts—A New Type of Cutting Planes for Integer Programming
cites work: An Algorithm for Finding All Vertices of Convex Polyhedral Sets
cites work: Fixed-cost transportation problems
cites work: Integer Programming: Methods, Uses, Computations
cites work: An approximate solution method for the fixed charge problem
cites work: An approximative algorithm for the fixed charge problem
cites work: Convexity cuts for multiple choice problems
cites work: The Generalized Lattice-Point Problem
cites work: The fixed charge problem
cites work: Solving the Fixed Charge Problem by Ranking the Extreme Points
cites work: On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
cites work: A method for solving maximum-problems with a nonconcave quadratic objective function
cites work: Eine Methode zur Berechnung des optimalen Produktionsprogramms bei konkaver Zielfunktion
cites work: Hypercylindrically Deduced Cuts in Zero-One Integer Programs
description: scientific article; zbMATH DE number 3471798