Robust Multi-Objective Optimization Model for Reserve and Credit Fund Allocation in Banking Under Conditional Value-at-Risk Constraints
Bibliographic record
Abstract
In the realm of financial management, optimizing the allocation of funds in banking companies is vital to their operational efficiency. Banks manage their funds by allocating them into reserve and credit funds as the main activities of banking. Optimizing these allocations ensures that all assets are effectively utilized. However, real-life optimization problems often involve uncertainty, making deterministic data assumptions insufficient. Robust Optimization is a methodology that addresses these uncertainties by incorporating computational tools to solve optimization problems with uncertain data. The uncertainty approach used in robust optimization is polyhedral sets. In the context of banking, uncertainties influencing the allocation of reserve and credit funds include financial risks and returns. These risks can be quantified using Conditional Value-at-Risk (CVaR), a suitable measure for banking fund allocation due to its ability to accommodate varying risk characteristics under different business conditions. This study focuses on developing an optimization model for reserve and credit fund allocation in banking companies using a Multi-objective Robust CVaR approach with lexicographic, informed by business risk data and credit instruments. The resulting optimization model yields optimal allocations for reserve and credit funds, ensuring efficient asset utilization to support banking operations. This approach offers new perspectives for banks to achieve fund allocations that are not only regulatory compliant but also optimal. The implications of such optimal allocations include mitigating risks associated with reserve fund imbalances and enhancing profitability through optimal credit returns.
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.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.003 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 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 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".