{"id":"W1966613145","doi":"10.3329/dujs.v60i2.11487","title":"A Computer Technique for Solving LP Problems with Bounded Variables","year":2012,"lang":"en","type":"article","venue":"Dhaka University Journal of Science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Bounded function; Linear programming; Code (set theory); Simplex algorithm; Simplex; Basis (linear algebra); Mathematics; Matrix (chemical analysis); Mathematical optimization; Computer science; Algorithm; Combinatorics; Programming language; Mathematical analysis; Geometry","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001451513,0.00007115796,0.0001387962,0.0003218776,0.0003904271,0.00004869124,0.0004729823,0.00003026608,0.00001863884],"category_scores_gemma":[0.0001658935,0.00005777545,0.00003564618,0.0006618664,0.0005203369,0.001482905,0.0001035905,0.0001504278,8.063894e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002302109,"about_ca_system_score_gemma":0.000318412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001877415,"about_ca_topic_score_gemma":9.461215e-7,"domain_scores_codex":[0.9989669,0.00002121548,0.0001355471,0.00009950197,0.0004578232,0.0003190232],"domain_scores_gemma":[0.9984279,0.0002134071,0.0002441344,0.0001163646,0.0008206133,0.0001776227],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001688496,0.004105805,0.01494221,0.00154537,0.000533202,0.0002494973,0.03910526,0.06375475,0.1672946,0.6771264,0.009372558,0.02028186],"study_design_scores_gemma":[0.02703915,0.009466887,0.003922503,0.004981943,0.00077148,0.007936534,0.02833887,0.3562248,0.1976725,0.2652606,0.09371491,0.004669773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007674325,0.00001213327,0.9914634,0.00008919279,0.00006471924,0.0002808389,0.000002220328,0.00001376712,0.0003994207],"genre_scores_gemma":[0.06080886,0.0000110473,0.9388191,0.00001392525,0.00006035963,5.014589e-7,1.736278e-7,0.000007059773,0.0002789994],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4118658,"threshold_uncertainty_score":0.3002889,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04193085280311634,"score_gpt":0.301897833840958,"score_spread":0.2599669810378417,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}