Solution of some convex separable resource allocation and production planning problems with bounds on the variables

DOI10.1080/09720502.2010.10700719zbMath1220.90091OpenAlexW2019453515MaRDI QIDQ3008595

Stefan M. Stefanov

Publication date: 22 June 2011

Published in: Journal of Interdisciplinary Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.connectjournals.com/file_html_pdf/900705H_jim358_541-569A.pdf

zbMATH Keywords

computational complexityconvex programmingresource allocationproduction planningseparable programmingpolynomial algorithms

Mathematics Subject Classification ID

Convex programming (90C25) Production models (90B30) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (2)

On the solution of multidimensional convex separable continuous knapsack problem with bounded variables ⋮ Well-posedness and primal-dual analysis of some convex separable optimization problems

Uses Software

• WinGULF

Cites Work

• Unnamed Item
• Unnamed Item
• A compromise procedure for the multiple objective linear fractional programming problem
• An algorithm for generalized fractional programs
• Fractional programming revisited
• Fractional programming - a survey
• Fractional programming: Applications and algorithms
• Duality in generalized fractional programming via Farkas' lemma
• Algorithms for generalized fractional programming
• Convex dual for quadratic concave fractional programs
• Financial planning with fractional goals
• Linear-fractional programming. Theory, methods, applications and software.
• A new algorithm for generalized fractional programs
• On polynomiality of the method of analytic centers for fractional problems
• A survey on the continuous nonlinear resource allocation problem
• Convex separable minimization problems with a linear constraint and bounded variables
• Duality in generalized linear fractional programming
• Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables
• Convex quadratic programming with one constraint and bounded variables
• On Maximizing a Sum of Ratios
• Fractional programming duality via geometric programming duality
• Simple Ranking Methods for Allocation of One Resource
• A polynomially bounded algorithm for a singly constrained quadratic program
• Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
• Multiple Objective Linear Fractional Programming
• Technical Note—Allocation of Effort Resources among Competing Activities
• Duality in Fractional Programming: A Unified Approach
• Duality and Sensitivity Analysis for Fractional Programs
• A measure of obtaining representative pointwise source and its availability for air pollution control
• Fractional knapsack problems
• An Algorithm for solving the Integer Linear Fractional Programs
• Duality for multiobjective fractional programming involvingn-set functions sup^*
• Hyperbolic programming
• A Class of Fractional Programming Problems
• Generalized convex duality for multiobjective fractional programs

This page was built for publication: Solution of some convex separable resource allocation and production planning problems with bounds on the variables