{"id":"W2069540826","doi":"10.1016/j.apm.2012.01.034","title":"Adjacency based method for generating maximal efficient faces in multiobjective linear programming","year":2012,"lang":"en","type":"article","venue":"Applied Mathematical Modelling","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria; Defence Research and Development Canada","funders":"","keywords":"Extreme point; Adjacency list; Simplex; Linear programming; Mathematical optimization; Mathematics; Face (sociological concept); Feasible region; Simplex algorithm; Set (abstract data type); Regular polygon; Algorithm; Point (geometry); Polyhedron; Computer science; Combinatorics; 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.000734945,0.0006990404,0.0008119414,0.001115908,0.000739481,0.000669845,0.001136905,0.001018087,0.005512627],"category_scores_gemma":[0.001972415,0.0005046603,0.0009822648,0.000753941,0.0006242718,0.0008916206,0.001229671,0.001293701,0.0007255597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004835759,"about_ca_system_score_gemma":0.0007440973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00175999,"about_ca_topic_score_gemma":0.002600898,"domain_scores_codex":[0.9996424,0.0001526983,0.00001260502,0.00004832571,0.0001114526,0.00003254459],"domain_scores_gemma":[0.9991975,0.000538054,0.00003371103,0.00004830227,0.000150391,0.00003197796],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009777619,0.0001284799,0.0003347242,0.0002071901,0.00003826412,0.0001074605,0.0001868591,0.6943172,0.008712923,0.1240208,0.00408092,0.1677675],"study_design_scores_gemma":[0.000007506746,0.00003697502,0.00005410253,0.0000126247,0.000009547213,0.00002384113,0.00001837986,0.9725147,0.001353649,0.02461076,0.001349699,0.000008111258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007756122,0.00005226687,0.9892363,0.0000457076,0.00002568967,0.00004180452,0.0000338761,0.00009245031,0.002715836],"genre_scores_gemma":[0.200073,0.000153289,0.7931563,0.00008973402,0.00004723247,0.0003904167,0.0002024644,0.0001800819,0.005707436],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005512627,"threshold_uncertainty_score":0.01844156,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03284012179857119,"score_gpt":0.2804229922279768,"score_spread":0.2475828704294057,"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."}}