Optimal value determination using traditional and newly developed method based on using initial basic feasible solution of a transportation problem using northwest and Russell method
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
This paper utilises a transportation problem scenario to conduct a study on optimisation of transportation problems that are formatted as linear programming problem. Initially, Northwest corner rule and the Russell's method are used to obtain the highest initial basic feasible (IBF) solutions and then a Putcha-Bhuiyan method is proposed to obtain an optimal solution. The Putcha-Bhuiyan method provides the optimal solution with fast convergence of transportation problems. This method results in an optimal solution by making appropriate changes to the IBF solution and eliminating the need to conduct iterations using chain reaction or transportation simplex algorithm. To explain and justify the advantages of the Putcha-Bhuiyan method, the solution to the problem scenario was compared with the transportation simplex method. While the justification of the Putcha-Bhuiyan method is with only one problem scenario, it will be very useful for solving multiple and large-scale optimisation problems that are faced in many disciplines. These concepts are dominantly utilised in disciplines like industrial engineering, mechanical engineering, smart manufacturing, and supply chain management.
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.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 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