Location of a discrete resource and its allocation according to a fractional objective

DOI10.1016/0377-2217(80)90039-9MaRDI QIDQ1136705zbMATH OpenOpenAlexFDO

Authors K. M. Mjelde

Publication date 1979

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(80)90039-9

zbMATH Keywords

associated problem in continuous variablesfractional objectiveinteger variablesresource allocation

Mathematics Subject Classification ID

Integer programming (90C10) Fractional programming (90C32)

Cites work

• A Branch and Bound Procedure for a Class of Discrete Resource Allocation Problems with Several Constraints
• Allocation of resources according to a fractional objective
• Convex-concave fractional programming with each variable occurring in a single constraint
• Discrete Allocation and Replenishment of Resources with Binary Effectiveness
• Discrete Resource Allocation by a Branch and Bound Method
• Einzelschrittverfahren zur Lösung konvexer und dual‐konvexer Minimierungsprobleme
• Fractional Programming with Homogeneous Functions
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3628733 (Why is no real title available?)
• On Nonlinear Fractional Programming
• The Optimality of an Incremental Solution of a Problem Related to Distribution of Effort

Cited in

(2)

• Cost-effective allocations of bounded and binary resources in polynomial time
• Bibliography in fractional programming

This page was built for publication: Location of a discrete resource and its allocation according to a fractional objective

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