TBD * programming의 번역을 대체 뭐로 하는게 최선인가? <> = Topics = == feasible region == https://en.wikipedia.org/wiki/Feasible_region "a '''feasible region, feasible set, search space,''' or '''solution space''' is the set of all possible points (sets of values of the [[choice_variable]]s) of an [[optimization_problem]] that satisfy the problem's [[constraint]]s,"... feasible region, feasible set, search space, or solution space feasible_region feasible_set search_space solution_space =,feasible_region =,feasible_set =,search_space =,solution_space . == constraint == [[WpEn:Constraint_(mathematics)]] = https://en.wikipedia.org/wiki/Constraint_(mathematics) == objective function == https://en.wikipedia.org/wiki/Objective_function == 각종 programming == see [[프로그래밍,programming]]. 최적화쪽의 programming은 computer programming과 많이 다른데 대개 [[계획법,programming]]으로 번역이 많이 되는듯... mentioned at there. === linear programming === https://en.wikipedia.org/wiki/Linear_programming [[linear_programming]] [[선형성,linearity]]? === integer programming === [[integer_programming]] https://en.wikipedia.org/wiki/Integer_programming [[정수,integer]] === integer linear programming (ILP) === abbr ILP =,ILP . Ggl:"integer linear programming" MKL [[linear_programming]] [[integer_programming]] === quadratic programming === [[quadratic_programming]] === nonlinear programming === [[nonlinear_programming]] or [[non-linear_programming]] Ggl:"nonlinear programming" [[비선형성,nonlinearity]]? === 각종프로그래밍여기추가 === === 각종프로그래밍여기추가 === === 각종프로그래밍여기추가 === === 각종프로그래밍여기추가 === == optimum == =,optimum . WtEn:optimum https://en.wikipedia.org/wiki/Local_optimum https://en.wikipedia.org/wiki/Global_optimum == (geom. shapes?) == 단체 심플렉스 simplex [[simplex_method]] =,simplex_method =,simplex_method . simplex_method WtEn:simplex_method https://en.wikipedia.org/wiki/Simplex_method hyperplane https://en.wikipedia.org/wiki/Hyperplanes === convex * === convex_polytope is [[polytope]] - WtEn:polytope https://en.wikipedia.org/wiki/Polytope convex_set [[볼록성,convexity]] = Sub = == 볼록최적화 convex optimization == [[볼록최적화,convex_optimization]] Ndict:볼록최적화 == 수학적최적화? mathematical optimization == [[mathematical_optimization]] =,mathematical_optimization =,mathematical_optimization . mathematical_optimization { WtEn:mathematical_optimization ?? qqqqqqqqiiiiiiii [[WpKo:수학적_최적화]] = https://ko.wikipedia.org/wiki/수학적_최적화 [[WpSp:Mathematical_optimization]] = https://simple.wikipedia.org/wiki/Mathematical_optimization [[WpJa:数理最適化]] = https://ja.wikipedia.org/wiki/数理最適化 } Ndict:"mathematical optimization" === 조합최적화 ? 조합적최적화? 조합론적최적화? combinatorial optimization === [[combinatorial_optimization]] =,combinatorial_optimization =,combinatorial_optimization . combinatorial_optimization { 조합최적화 ? combinatorial optimization WtEn:combinatorial_optimization ? x [[Date(2024-01-03T10:57:55)]] [[WpSp:Combinatorial_optimization]] = https://simple.wikipedia.org/wiki/Combinatorial_optimization [[WpEn:Combinatorial_optimization]] = https://en.wikipedia.org/wiki/Combinatorial_optimization [[WpJa:組合せ最適化]] = https://ja.wikipedia.org/wiki/組合せ最適化 "Examples are finding the [minimum_spanning_tree] in a graph or the Travelling Salesman Problem. Many of the problems looked at have also been solved using [linear_programming]." } // combinatorial optimization Ggl:"combinatorial optimization" == continuous optimization == [[continuous_optimization]] =,continuous_optimization =,continuous_optimization . continuous_optimization { 연속최적화 ? 연속적최적화 ? https://en.wikipedia.org/wiki/Continuous_optimization [objective_function]에 쓰이는 [변수,variable]가 [[연속변수,continuous_variable]]? 여야 한다는 조건. xxx WtEn:continuous_optimization = https://en.wiktionary.org/wiki/continuous_optimization x [[Date(2024-01-03T10:57:55)]] } // continuous optimization Ggl:"continuous optimization" == discrete optimization == [[discrete_optimization]] =,discrete_optimization =,discrete_optimization . discrete_optimization { 이산최적화 ? 이산적최적화 ? discrete optimization https://en.wikipedia.org/wiki/Discrete_optimization xxx WtEn:discrete_optimization ? x [[Date(2024-01-03T10:57:55)]] "discrete optimization" Ndict:"discrete optimization" Ggl:"discrete optimization" } // discrete optimization Ggl:"discrete optimization" == process optimization == [[process_optimization]] =,process_optimization =,process_optimization . process_optimization { 과정최적화 프로세스최적화 [[과정,process]] https://ko.wikipedia.org/wiki/프로세스_최적화 [[WpEn:Process_optimization]] = https://en.wikipedia.org/wiki/Process_optimization } // process optimization Ggl:"process optimization" == 최적화문제 optimization problem == [[최적화문제]] =최적화문제, // 따로 page 필요 없음? 이걸 만든다면 연속최적화문제 이산최적화문제 조합최적화문제 ....등등 다 .... 현재로서는 필요 없음. /// 암튼 [[문제,problem]]. { optimization problem optimization_problem WtEn:optimization_problem ? "optimization problem" 최적화문제 https://ko.wikipedia.org/wiki/최적화_문제 WpEn:Optimization_problem = https://en.wikipedia.org/wiki/Optimization_problem WpJa:最適化問題 = https://ja.wikipedia.org/wiki/最適化問題 Up: [[최적화,optimization]] [[문제,problem]] "optimization problem" Ggl:"optimization problem" ... 최적화문제 } // optimization problem == logic optimization == [[logic_optimization]] =,logic_optimization =,logic_optimization . logic_optimization { WtEn:logic_optimization x [[Date(2024-01-03T10:57:55)]] [[WpEn:Logic_optimization]] = https://en.wikipedia.org/wiki/Logic_optimization } // logic optimization Ggl:"logic optimization" = 관련분야 = [[산업공학,industrial_engineering]]이 이것에 가장 집중하는 학문분야. 기타 그 유용성때문에 다양한 곳에서 쓰이고 연구되는데....tbw = Programming/executable code에서 최적화 = Rel [[컴파일러,compiler]] [[executable_code]] [[실행,execution]] == inlining == aka inline expansion WtEn:inlining https://ko.wikipedia.org/wiki/인라인_확장 == IPO = interprocedural optimization == { https://ko.wikipedia.org/wiki/프로시저_간_최적화 "interprocedural optimization" Ggl:"interprocedural optimization" } // interprocedural optimization == TOFORK - assembly_language 직접 작성하는 level에서의 최적화 == Assembly Optimization Tips https://mark.masmcode.com/ ---- SEEALSO VG: 최적화,optimization