Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables (Q3445459): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/09720502.2006.10700438 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2101166808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex quadratic programming with one constraint and bounded variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomially bounded algorithm for a singly constrained quadratic program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Allocation of Effort Resources among Competing Activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex separable minimization subject to bounded variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Ranking Methods for Allocation of One Resource / rank
 
Normal rank

Latest revision as of 21:00, 25 June 2024

scientific article
Language Label Description Also known as
English
Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables
scientific article

    Statements

    Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables (English)
    0 references
    0 references
    11 June 2007
    0 references
    0 references
    exponential function
    0 references
    convex programming
    0 references
    separable programming
    0 references
    polynomial algorithms
    0 references
    computational complexity
    0 references
    0 references