Convex-concave fractional programming with each variable occurring in a single constraint

DOI10.1007/BF01931696MaRDI QIDQ4156149zbMATH OpenFDO

Authors K. M. Mjelde

Publication date 1978

Published in BIT (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Cites work

• Allocation of resources according to a fractional objective
• Einzelschrittverfahren zur Lösung konvexer und dual‐konvexer Minimierungsprobleme
• Evaluation and Incremental Determination of Almost Optimal Allocations of Resources
• Fractional Programming with Homogeneous Functions
• On Nonlinear Fractional Programming
• State Constraints in Convex Control Problems of Bolza

Cited in

(4)

• Location of a discrete resource and its allocation according to a fractional objective
• Bibliography in fractional programming
• Sufficiency of Kuhn-Tucker optimality conditions for a fractional programming problem
• Convex-concave fractional programming—Evaluation of solutions and optimality conditions

This page was built for publication: Convex-concave fractional programming with each variable occurring in a single constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4156149)