Maximin Problem and a Duality Theorem for Mixed‐Integer Quadratic Programming
From MaRDI portal
Recommendations
- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- scientific article; zbMATH DE number 1560354
- Minimization of a convex linear-fractional separable function subject to a convex inequality constraint or linear inequality constraint and bounds on the variables
- Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation
- Convex separable minimization problems with a linear constraint and bounded variables
Cited in
(11)- Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
- Piecewise linear bounding functions in univariate global optimization
- An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
- A nonconvex, piecewise linear optimization problem
- Relationships among linear formulations of separable convex piecewise linear programs
- scientific article; zbMATH DE number 20273 (Why is no real title available?)
- Fitting piecewise linear continuous functions
- Reduction of a Minimization Problem of a Separable Convex Function Under Linear Constraints to a Fixed Point Problem
- scientific article; zbMATH DE number 5270560 (Why is no real title available?)
- Integer Programming and Combinatorial Optimization
- Minimizing a monotone concave function with laminar covering constraints
This page was built for publication: Maximin Problem and a Duality Theorem for Mixed‐Integer Quadratic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5902903)
