Maximizing pseudoconvex transportation problem: A special type

DOI10.1007/BF01719728zbMath0822.90103OpenAlexW2081672877MaRDI QIDQ1891876

Anju Gupta, Munish C. Puri

Publication date: 1 June 1995

Published in: OR Spektrum (Search for Journal in Brave)

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

zbMATH Keywords

indefinite quadratic programmingproduct of two linear functionsmaximization of a pseudoconvex functionnon-concave fractional programming

Mathematics Subject Classification ID

Fractional programming (90C32) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

A fifth bibliography of fractional programming^*

Cites Work

• Minimizing pseudoconvex functions on convex compact sets
• Fractional programming: Applications and algorithms
• Allocation of resources according to a fractional objective
• On solving three classes of nonlinear programming problems via simple differentiable penalty functions
• Contributions pertaining to indefinite quadratic programming
• Extreme point programming with nonlinear constraints
• On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions
• Calculation of Investment Portfolios with Risk Free Borrowing and Lending
• A finite algorithm to maximize certain pseudoconcave functions on polytopes
• Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
• Solving the Fixed Charge Problem by Ranking the Extreme Points
• Fractional programming
• Unnamed Item
• Unnamed Item
• Unnamed Item