Reduction and Discrete Approximation in Linear Semi-Infinite Programming (Q3780757)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4043609
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reduction and Discrete Approximation in Linear Semi-Infinite Programming |
scientific article; zbMATH DE number 4043609 |
Statements
Reduction and Discrete Approximation in Linear Semi-Infinite Programming (English)
0 references
1987
0 references
approximation
0 references
discretization
0 references
finite reduction
0 references
Haar's duality
0 references
linear semi-infinite system
0 references
reductible
0 references
finite subproblem
0 references
discretizable
0 references
sequence of perturbed finite subproblems
0 references
countable subproblems
0 references
0 references
0 references
0.8363313674926758
0 references
0.8040914535522461
0 references
0.797137439250946
0 references
0.7968927025794983
0 references
A problem (P): Inf\(\{\) c'x\(|\) \(x\in F(\sigma)\}\), where F(\(\sigma)\) is the set of the solutions of a linear semi-infinite system \(\sigma\), is called reductible if there exists a finite subproblem with the same value, v(P). On the other hand we say that (P) is discretizable if \(v(P)=\lim_{k\to \infty}v(P_ k)\) for some sequence \(\{(P_ k)\), \(k=1,2,...\}\) of finite subproblems of (P). Here we establish a classification theorem which shows that (P) is always discretizable, unless c belongs to the relative boundary of the moment cone associated with \(\sigma\). In the last case we prove that, at least, (P) can be approximated by means of a sequence of perturbed finite subproblems. The first part of the paper provides, then, a theory which extends and embeds earlier results. In the second part we prove that optimal solutions of (P) or, alternatively, descent directions, can be obtained by discretization, except in the uncertain case. The third part is devoted to the reducibility of (P), characterizing those systems for which (P) is reducible whichever the objective function is. At last we discuss the role of countable subproblems.
0 references