Primal-dual partitions in linear semi-infinite programming with bounded coefficients
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
We consider two partitions over the space of linear semi-infinite programming parameters with a fixed index set and bounded coefficients (the constraint functions are bounded). The first one is the primal-dual partition inspired by consistency and boundedness of the optimal value of the problem. The second one is a refinement of the primal-dual partition that arises by considering also the boundedness of the optimal set. These two partitions have been studied in the continuous case, i.e., when the set of indices is an infinite compact topological space and the constraint functions are continuous. In this paper, we extend these results to the case in which the constraint functions are bounded, but not necessarily continuous. We study the same primal-dual partitions and characterize the interior of the corresponding cells. Through examples, we show that the conditions characterizing the cells of both partitions in the continuous case are neither necessary nor sufficient when the constraint functions are just bounded. In addition, a sufficient condition for the boundedness of the optimal set of the dual problem is established.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it