Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization (Q2168048): Difference between revisions

Revision as of 00:24, 30 July 2024

scientific article

Language	Label	Description	Also known as
English	Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization	scientific article

Statements

instance of

scholarly article

0 references

title

Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization (English)

0 references

0 references

0 references

0 references

0 references

Mathematical Methods of Operations Research

0 references

publication date

31 August 2022

0 references

zbMATH Keywords

semi-infinite programming

0 references

continuous set covering

0 references

product portfolio optimization

0 references

mathematical modelling

0 references

optimization

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1007/s00186-022-00776-y

0 references

cites work

Tools of mathematical modeling of arbitrary object packing problems

0 references

Q4163968

0 references

Infinitely constrained optimization problems

0 references

Smoothing methods for nonsmooth, nonconvex minimization

0 references

A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs

0 references

Joint optimization of product family configuration and scaling design by Stackelberg game

0 references

Optimization of multiple covering of a bounded set with circles

0 references

Q4198056

0 references

John and Loewner ellipsoids

0 references

Semi-Infinite Programming: Theory, Methods, and Applications

0 references

A continuous set covering problem as a quasidifferentiable optimization problem

0 references

A heuristic genetic algorithm for product portfolio planning

0 references

Reducibility among Combinatorial Problems

0 references

Solution of continuous problems of optimal covering with spheres using optimal set-partition theory

0 references

Optimal product design using conjoint analysis: Computational complexity and algorithms

0 references

An efficient approach to a class of non-smooth optimization problems

0 references

On the entropic regularization method for solving min-max problems with applications

0 references

Semi-infinite programming

0 references

Covering a rectangle with six and seven circles

0 references

Global optimization of generalized semi-infinite programs via restriction of the right hand side

0 references

Q5491447

0 references

On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems

0 references

Optimization. Algorithms and consistent approximations

0 references

Algorithms with adaptive smoothing for finite minimax problems

0 references

A transformation-based discretization method for solving general semi-infinite optimization problems

0 references

An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence

0 references

Semi-infinite programming, duality, discretization and optimality conditions†

0 references

Bi-level strategies in semi-infinite programming.

0 references

Discretization in semi-infinite programming: the rate of convergence

0 references

Covering a polygonal region by rectangles

0 references

A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming

0 references

A smoothing algorithm for finite min-max-min problems

0 references

An efficient solution method to design the cost-minimizing platform portfolio

0 references

Smoothing method for minimax problems

0 references

Q5393147

0 references

Identifiers

zbMATH Open document ID

1500.90077

0 references

DOI

10.1007/s00186-022-00776-y

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2168048

@@ Property / cites work @@
+Tools of mathematical modeling of arbitrary object packing problems
+Normal rank
@@ Property / cites work @@
+Q4163968
@@ Property / cites work: Q4163968 / rank @@
+Normal rank
@@ Property / cites work @@
+Infinitely constrained optimization problems
@@ Property / cites work: Infinitely constrained optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+Smoothing methods for nonsmooth, nonconvex minimization
+Normal rank
@@ Property / cites work @@
+A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
+Normal rank
@@ Property / cites work @@
+Joint optimization of product family configuration and scaling design by Stackelberg game
+Normal rank
@@ Property / cites work @@
+Optimization of multiple covering of a bounded set with circles
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+John and Loewner ellipsoids
@@ Property / cites work: John and Loewner ellipsoids / rank @@
+Normal rank
@@ Property / cites work @@
+Semi-Infinite Programming: Theory, Methods, and Applications
+Normal rank
@@ Property / cites work @@
+A continuous set covering problem as a quasidifferentiable optimization problem
+Normal rank
@@ Property / cites work @@
+A heuristic genetic algorithm for product portfolio planning
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Solution of continuous problems of optimal covering with spheres using optimal set-partition theory
+Normal rank
@@ Property / cites work @@
+Optimal product design using conjoint analysis: Computational complexity and algorithms
+Normal rank
@@ Property / cites work @@
+An efficient approach to a class of non-smooth optimization problems
+Normal rank
@@ Property / cites work @@
+On the entropic regularization method for solving min-max problems with applications
+Normal rank
@@ Property / cites work @@
+Semi-infinite programming
@@ Property / cites work: Semi-infinite programming / rank @@
+Normal rank
@@ Property / cites work @@
+Covering a rectangle with six and seven circles
@@ Property / cites work: Covering a rectangle with six and seven circles / rank @@
+Normal rank
@@ Property / cites work @@
+Global optimization of generalized semi-infinite programs via restriction of the right hand side
+Normal rank
@@ Property / cites work @@
+Q5491447
@@ Property / cites work: Q5491447 / rank @@
+Normal rank
@@ Property / cites work @@
+On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems
+Normal rank
@@ Property / cites work @@
+Optimization. Algorithms and consistent approximations
+Normal rank
@@ Property / cites work @@
+Algorithms with adaptive smoothing for finite minimax problems
+Normal rank
@@ Property / cites work @@
+A transformation-based discretization method for solving general semi-infinite optimization problems
+Normal rank
@@ Property / cites work @@
+An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence
+Normal rank
@@ Property / cites work @@
+Semi-infinite programming, duality, discretization and optimality conditions†
+Normal rank
@@ Property / cites work @@
+Bi-level strategies in semi-infinite programming.
@@ Property / cites work: Bi-level strategies in semi-infinite programming. / rank @@
+Normal rank
@@ Property / cites work @@
+Discretization in semi-infinite programming: the rate of convergence
+Normal rank
@@ Property / cites work @@
+Covering a polygonal region by rectangles
@@ Property / cites work: Covering a polygonal region by rectangles / rank @@
+Normal rank
@@ Property / cites work @@
+A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
+Normal rank
@@ Property / cites work @@
+A smoothing algorithm for finite min-max-min problems
+Normal rank
@@ Property / cites work @@
+An efficient solution method to design the cost-minimizing platform portfolio
+Normal rank
@@ Property / cites work @@
+Smoothing method for minimax problems
@@ Property / cites work: Smoothing method for minimax problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q5393147
@@ Property / cites work: Q5393147 / rank @@
+Normal rank