Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization
From MaRDI portal
Publication:2168048
DOI10.1007/s00186-022-00776-yzbMath1500.90077OpenAlexW4220985282MaRDI QIDQ2168048
Jan Schwientek, Helene Krieg, Karl-Heinz Küfer, Tobias Seidel
Publication date: 31 August 2022
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-022-00776-y
optimizationsemi-infinite programmingmathematical modellingcontinuous set coveringproduct portfolio optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Covering a polygonal region by rectangles
- Algorithms with adaptive smoothing for finite minimax problems
- Tools of mathematical modeling of arbitrary object packing problems
- A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
- John and Loewner ellipsoids
- Smoothing methods for nonsmooth, nonconvex minimization
- A heuristic genetic algorithm for product portfolio planning
- Semi-infinite programming
- A smoothing algorithm for finite min-max-min problems
- Solution of continuous problems of optimal covering with spheres using optimal set-partition theory
- Optimal product design using conjoint analysis: Computational complexity and algorithms
- Infinitely constrained optimization problems
- On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems
- An efficient approach to a class of non-smooth optimization problems
- Optimization. Algorithms and consistent approximations
- On the entropic regularization method for solving min-max problems with applications
- Bi-level strategies in semi-infinite programming.
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
- An efficient solution method to design the cost-minimizing platform portfolio
- Covering a rectangle with six and seven circles
- Joint optimization of product family configuration and scaling design by Stackelberg game
- A transformation-based discretization method for solving general semi-infinite optimization problems
- Optimization of multiple covering of a bounded set with circles
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semi-infinite programming, duality, discretization and optimality conditions†
- A continuous set covering problem as a quasidifferentiable optimization problem
- Reducibility among Combinatorial Problems
- An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence
- Smoothing method for minimax problems
- Discretization in semi-infinite programming: the rate of convergence
