Convex separable minimization problems with a linear constraint and bounded variables
Summary: Consider the minimization problem with a convex separable objective function over a feasible region defined by linear equality constraint(s)/linear inequality constraint of the form ``greater than or equal to and bounds on the variables. A necessary and sufficient condition and a sufficient condition are proved for a feasible solution to be an optimal solution to these two problems, respectively. Iterative algorithms of polynomial complexity for solving such problems are suggested and convergence of these algorithms is proved. Some convex functions, important for problems under consideration, as well as computational results are presented.
- Convex separable minimization subject to bounded variables
- Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
- Minimization of a convex linear-fractional separable function subject to a convex inequality constraint or linear inequality constraint and bounds on the variables
- Convex programming with single separable constraint and bounded variables
- scientific article; zbMATH DE number 5270560
- Probabilistic solutions for a class of deterministic optimal allocation problems
- Well-posedness and primal-dual analysis of some convex separable optimization problems
- An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
- Sufficient optimality criterion for linearly constrained, separable concave minimization problems
- A polynomial-time descent method for separable convex optimization problems with linear constraints
- Bounding duality gap for separable problems with linear constraints
- Solution of some convex separable resource allocation and production planning problems with bounds on the variables
- Minimization of a convex linear-fractional separable function subject to a convex inequality constraint or linear inequality constraint and bounds on the variables
- Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables
- Convex minimization problems with weak constraint qualifications
- Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
- Separable convex optimization problems with linear ascending constraints
- scientific article; zbMATH DE number 3918096 (Why is no real title available?)
- On the Resolution of Linearly Constrained Convex Minimization Problems
- Minimizing Separable Convex Functions Subject to Simple Chain Constraints
- Reduction of a Minimization Problem of a Separable Convex Function Under Linear Constraints to a Fixed Point Problem
- A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph
- Minimization of a strictly convex separable function subject to a convex inequality constraint or linear equality constraints and bounds on the variables
- scientific article; zbMATH DE number 5270560 (Why is no real title available?)
- Maximin Problem and a Duality Theorem for Mixed‐Integer Quadratic Programming
- Convex separable minimization subject to bounded variables
- Convex programming with single separable constraint and bounded variables
This page was built for publication: Convex separable minimization problems with a linear constraint and bounded variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2575941)
