{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008867837,0.0002863539,0.0004180433,0.0001374968,0.0001062276,0.00005547777,0.0001266051,0.0001513376,0.00003373404],"category_scores_gemma":[0.00009065887,0.0002662672,0.0001045248,0.000259359,0.00003106941,0.00009319754,0.00003058836,0.000233247,0.00003206623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000896323,"about_ca_system_score_gemma":0.00001363877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001383951,"about_ca_topic_score_gemma":4.757496e-7,"domain_scores_codex":[0.9981654,0.00002434606,0.0005878506,0.0002582711,0.0002284179,0.0007357125],"domain_scores_gemma":[0.9989476,0.000569073,0.00006148066,0.0001939556,0.00004679818,0.0001810836],"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.00001044192,0.0002241373,0.000002150141,0.0005688483,0.0000154549,2.814964e-7,0.001161198,0.9438359,0.0008912427,0.04174926,0.000002733879,0.01153835],"study_design_scores_gemma":[0.0005894105,0.00001439632,2.766363e-7,0.00008434423,0.00003159892,0.000001426779,0.0003693984,0.989708,0.005089179,0.003682768,0.0001185099,0.0003106958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006320272,0.0001016771,0.9896669,0.00001666735,0.00007276405,0.001480868,0.000003067238,0.0004254129,0.001912361],"genre_scores_gemma":[0.3813719,0.000001329266,0.617964,0.00002121793,0.00006638973,0.0005046903,0.000007140877,0.00005644775,0.000006874136],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3750517,"threshold_uncertainty_score":0.999979,"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."}}