{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006379404,0.000689533,0.0006716771,0.0007167661,0.0006581938,0.0006985376,0.0008868851,0.0006625291,0.007752792],"category_scores_gemma":[0.002471712,0.0003634189,0.0007594429,0.001283991,0.0006735079,0.0008814382,0.0009078143,0.002362302,0.002374216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003382363,"about_ca_system_score_gemma":0.001002361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002280179,"about_ca_topic_score_gemma":0.002068039,"domain_scores_codex":[0.9996125,0.0001343212,0.00001999335,0.00005050189,0.0001595511,0.00002307741],"domain_scores_gemma":[0.9992385,0.0004910559,0.00003257196,0.000102102,0.0001194785,0.00001635408],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001107593,0.0001367736,0.0005344213,0.0007276625,0.0001195604,0.0002468048,0.0003087793,0.3075393,0.0203308,0.2619457,0.01223187,0.3957677],"study_design_scores_gemma":[0.00005142463,0.00005288114,0.000217484,0.00006497751,0.00002027109,0.0001540512,0.00003052756,0.8926439,0.005543191,0.07410954,0.0270902,0.00002160429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001159911,0.0001286301,0.9955009,0.00006561929,0.00002459881,0.00002256476,0.00003039402,0.0003571099,0.002710387],"genre_scores_gemma":[0.03665707,0.0004451833,0.9595508,0.00005833839,0.00003777048,0.0002890287,0.0001223017,0.0002155214,0.002624034],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007752792,"threshold_uncertainty_score":0.02593571,"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."}}