Pages that link to "Item:Q2575941"
From MaRDI portal
The following pages link to Convex separable minimization problems with a linear constraint and bounded variables (Q2575941):
Displaying 6 items.
- Probabilistic solutions for a class of deterministic optimal allocation problems (Q1696457) (← links)
- Well-posedness and primal-dual analysis of some convex separable optimization problems (Q1953228) (← links)
- An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint (Q2491532) (← links)
- Solution of some convex separable resource allocation and production planning problems with bounds on the variables (Q3008595) (← links)
- Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints (Q3559429) (← links)
- A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph (Q5024918) (← links)
