An incremental and parametrical algorithm for convex-concave fractional programming with a single constraint

DOI10.1016/0377-2217(86)90304-8zbMATH Open0582.90094OpenAlexW1987896862MaRDI QIDQ1069860FDOQ1069860

K. M. Mjelde

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0377-2217(86)90304-8

Recommendations

• An algorithm for generalized fractional programs
• An efficient algorithm for solving convex-convex quadratic fractional programs
• Fractional Programming
• On Maximizing a Sum of Ratios
• Publication:3200903

zbMATH Keywords

resource allocationincremental algorithmparametrical algorithmratio of a concave function to a convex functionsingle convex constraint function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Fractional programming (90C32) Analysis of algorithms and problem complexity (68Q25) Sensitivity, stability, parametric optimization (90C31)

Cites Work

• On Nonlinear Fractional Programming
• Parallelism in Comparison Problems
• Title not available (Why is that?)
• Fractional programming
• Title not available (Why is that?)
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Allocation of resources according to a fractional objective
• Title not available (Why is that?)
• Einzelschrittverfahren zur Lösung konvexer und dual‐konvexer Minimierungsprobleme
• Title not available (Why is that?)

Cited In (3)

• Minisymposium 2 : Optimierung
• A Fourth bibliography of fractional programming
• An efficient algorithm for solving convex-convex quadratic fractional programs

This page was built for publication: An incremental and parametrical algorithm for convex-concave fractional programming with a single constraint

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