Bibliographic record
Abstract
Parametric programming is one of the broadest areas of applied mathematics.Practical problems, that can be described by parametric programming, were recorded in the rock art about thirty millennia ago.As a scientific discipline, parametric programming began emerging only in the 1950's.In this tutorial we introduce, briefly study, and illustrate some of the elementary notions of parametric programming.This is done using a limited theory (mainly for linear and convex models) and by means of examples, figures, and solved real-life case studies.Among the topics discussed are stable and unstable models, such as a projectile motion model (maximizing the range of a projectile), bilevel decision making models and von Stackelberg games of market economy, law of refraction and Snell's law for the ray of light, duality, Zermelo's navigation problems under the water, restructuring in a textile mill, ranking of efficient DMU (university libraries) in DEA, minimal resistance to a gas flow, and semi-abstract parametric programming models.Some numerical methods of input optimization are mentioned and several open problems are posed.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.005 | 0.010 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.004 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.053 | 0.025 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".