{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1069860","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1069860","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q1069860","kernelVersion":"v1","immutable":true,"modified":"2026-01-06T02:18:33Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q1069860","name":"An incremental and parametrical algorithm for convex-concave fractional programming with a single constraint","headline":"An incremental and parametrical algorithm for convex-concave fractional programming with a single constraint","description":"scientific article; zbMATH DE number 3932813","url":"https://portal.mardi4nfdi.de/entity/Q1069860","datePublished":"1986-00-00","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q595528"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q62319"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/0377-2217(86)90304-8","url":"https://doi.org/10.1016/0377-2217(86)90304-8"},"sameAs":["https://doi.org/10.1016/0377-2217(86)90304-8"],"comment":"A problem of the maximization of the ratio of a concave function to a convex function is considered, subject to an upper bound on a single convex constraint function; all these functions are assumed to be differentiable. An incremental algorithm is defined, which solves the problem parametrically for different values of the constraint function by the solution of a set of ordinary first order differential equations. If K is the number of variables in the problem and B(K) is an upper bound - dependent of K - of the time needed to evaluate any function value or any first or second order derivative, the complexity of the algorithm is of the order \\(O[(B(K)K+K)a]\\), where a is the number of integration steps applied in the solution of the differential equations. In particular, a cost-effectiveness resource allocation problem with separable functions is solved numerically in a time of the order O[Ka] if B(K) is independent of K; an example of such a problem is given with analytically solvable differential equations.","citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q5531569"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3318566"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5896201"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5589748"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3763585"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1243666"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4750414"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4766808"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5682160"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4069777"}]},"provenance":{"prov:generatedAtTime":"2026-01-06T02:18:33Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}