最價解 的英文怎麼說

中文拼音 [zuìjiàjiě]
最價解 英文
optimal solution
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 價 : 名詞1. （價格） price 2. （價值） value 3. [化學] （化合價） valence
  • 解 : 解動詞（解送） send under guard
  1. Not only as being the most valuable of all possible forms of public places but regarded simply as a large space which will seriously interrupt crosstown communication wherever it occurs, the question of the site and bounds of the park requires to be determined with much more deliberation and art than is often secured for any problem of distant and extended municipal interests

    不僅僅是作為公共用地中最有價值的形式，而且當公園不恰當存在時還容易被公眾簡單的理解為巨大的嚴重干擾城市內部交流的地塊，這就使得縝密及藝術性的考慮公園的位置和范圍顯得更加重要，而不是只滿足於以往的將其作為城市邊緣及或擴展的定位。
  2. At last, to be assure that the project can be put into execution effectively, the paper brings forward some suggestions that the plant should reform its system basing on corporation - oriented in order to solve historical debts problems, and should carry out its independent management right, and should reclaim its electricity fee and strive for a reasonable electrovalence, and exploits electric power market, and so on

    最後，為保證成本控制方案的有效實施，提出了對永昌電廠進行公司化改制以解決歷史債務問題、落實企業的經營自主權、進行電費回收並爭取合理的上網電價、開拓電力市場等具體配套性措施和建議。
  3. This paper develops a deterministic inventory model for perishable items with a mixture of back orders and lost sales under inflation and time discounting, where the backlogged demand rate is dependent on the negative inventory level during the stock out period. the main differences from the existing related models are that the present model takes the maximum present value of profit in a repeatable order cycle as the objective function and proposes a more practical constraint of maximum customer - waiting time to ensure a proper customer service level. then the existence and the uniqueness of the solution to relevant systems are examined and a solution algorithm is shown to find the optimal replenishment policy. at last, some numerical examples are presented to illustrate the applicatioh of the model

    本文建立了一種考慮通貨膨脹與時間價值的變質性物品的庫存模型，在模型中允許短缺發生且拖后的需求速率與在缺貨期間已經發生的缺貨量有關.和已有相關模型的主要區別在於本模型把一個可重復的訂貨周期內的最大平均利潤的凈現值作為目標函數，且增加了在缺貨期間最長顧客等待時間的限制，以確保庫存系統擁有較高的服務水平.然後討論了模型最優解的存在性與唯一性，並提供了尋求模型整體最優解的演算法.最後用實例說明了此模型在實際中的應用
  4. Through the approach of investigative questionnaire and ability examination, considering both teachers " teaching practice in senior high school and students " need in analyzing and resolving problem, taking the method of fixing the quality and quantity, we make a demonstration research. at last, we draw a conclusion that the 19 manifestations of chemistry ability can be reduced to three levels : the basal level, called repeating thinking, includes distinguishing and judging the chemical fact and relations of quantity in chemical reaction, comparing and summarizing the chemistry fundamental knowledge ; innovative thinking level includes illogical thinking and logical thinking. illogical thinking mainly contains intuition, association and space imagination of micro - particle

    通過調查問卷、能力測試等途徑，結合教師在中學化學的教學實踐和學生在分析、解決問題的實際需要，採用定性與定量結合的方法，進行實證研究，得出結論：化學學科能力的19種表現形式歸納為3個層次：最基礎的再造性思維能力層次包括對化學事實和化學反應中量的關系的識別和判斷、對化學基礎知識的比較概括；以培養創新能力為核心的創造性思維層次包括化學直覺思維、聯想、對微觀粒子的空間想象為主的非邏輯思維和靈活運用已學的化學知識通過分析、綜合地解決問題為主的邏輯思維；化學實驗能力層次是化學學科能力的最高層次，它以思維能力為基礎，集中體現了化學教學的基本特徵，實驗能力層次包括：選用實驗方法和設計實驗方案，對實驗的評價，研究和處理實驗事實、資料、數據，發現規律，表達實驗及其結果，最終解決問題的能力和發散思維。
  5. The maximal value point s problem of a convex function on a closed convex subset in locally convex space is considered by using the level set of function, - subdifferential and - normal cone. it gives several equivalent characters on the optimal solutions of the problem

    利用函數的水平集， -次微分和-法向錐等工具研究局部凸空間的凸函數在閉凸子集上的最大值點問題，給出了最優解的幾個等價刻劃
  6. Converting a multi - object plan model into a single - object one by applying the method of ideal - point to construct a function, we can get a fine result approaching the ideal - point, with the case of various land use structure in beijie region from 1997 to 2005

    摘要運用理想點法來構造評價函數，將求解多目標規劃問題轉化為求解單目標規劃問題得出最優解，以畢節地區1997年到2005年土地利用結構變化為實例。
  7. According to process management characteristic, the paper established the process on information system management base on ffeb, moreover, the optimum value is achieved through the paper gave an evaluation model after assessing the solutions of multi - production through their economical results by employing fuzzy - theory

    在研究影響工藝方案經濟性因素的基礎上藉助于模糊數學，對多工藝方案在滿足技術條件的情況下，從經濟的角度出發，對各工藝方案的優劣性進行了模糊綜合評價，得出了最優解。
  8. The smaller the value of the merit function is, the closer the iteration point is to the solution

    當價值函數的值越小時，迭代點越靠近最優解。
  9. Redundant force, which is produced through position disturbance, is the most important problem facing aerodynamic loading system. so how to minish the redundant force by selecting proper control strategy is a main aspect discussed in this paper

    加載系統最為關鍵、也是最難解決的問題就是如何減小多餘力，這也是評價加載系統品質的一個重要的指標，因此，如何通過控制策略來減小多餘力是本文主要考慮的問題。
  10. Such methods are generally decreasing method, such as, feasible direction methods, constrained variable metric methods, etc. another class is sub - problems method, which approximates the optimal solution by solving a series of simple sub - problems, such as penalty function methods, trust region methods, and successive quadratic programming sub - problems, etc. the same property of two classes of methods is that they determine whether the next iterative point is " good " or " bad " by comparing the objective function value or merit function value at the current point and next iterative point

    另一類叫做子問題演算法，這種演算法是通過一系列簡單子問題的解來逼近原問題的最優解，如罰函數法、信賴域演算法、逐步二次規劃演算法等。這兩類演算法的一個共同特點是，通過比較當前點和下一個迭代點的目標函數值或評價函數值來確定迭代點的「優」或「劣」 ，若迭代點比當前點「優」則該迭代點可以被接受，否則須繼續搜索或調整子問題。
  11. Petri net switching models and algorithm process are explained in details. system limitations and specific evaluation functions are presented for searching the best solution during the dynamic petri net nodes " transition

    Petri網的開關模型和演算法流程在文中均有詳細解析，系統約束條件和特有的評價函數用於在petri網模型節點的動態躍遷時幫助搜索出最優解。
  12. The main idea of this hybrid algorithm is : at first, all candidates in task collection is lined according to a dispatching rule ( earliest due date, edd ), then this linear queue is divided into some tiers under a criterion that partial order is not allowed to exist in the every tier, many feasible sequences is generated by constructing a neighborhood of a initial sequence in every tier, the allocation of the resources over time is conducted to perform every feasible task sequence, and a set of approximate optimal scheduling schemes is achieved as the precondition of the next tier ’ s disposal in meeting multiple scheduling objectives to obtain the global near - optimal schedule which makes these program run tier by tier until the last task is completed

    該演算法按照最早完工時間優先（ ect ）分派規則，先將參加排序的工序合併成一個串列序列，然後按照同層內不存在偏序關系的原則，將其分解為若干個時間上相互銜接的層次，在每個層次內部，通過構造鄰域產生出多個可行序列，對每個可行序列進行設備配置，採用鄰域搜索演算法進行方案的尋優，保留一組滿足評價要求的可行方案作為下一層設備配置的背景環境，通過層層遞進最終獲取全局的近似最優解。
  13. Especially, on the basis of the current situation that our country " s rural medical security system is much weaker at present, the author proposes solving the rural medical insurance problems from the following respects : to rectify and improve rural medical organization efficiently to utilize resources, stabi lize the medicine price, solve the problems of the peasants " prevention little diseases and small injures ; to launch medical treatment to help each other, strengthen the ability of resisting serious diseases ; third, to develop rural business insurance, to meet the multi - level medical demands and guarantee that it can offer the peasants finally a reliable health network of social safety

    特別是，基於目前我國農村醫療保障體系比較薄弱的現狀，作者重點提出了自己在建立農村醫療保障體系方面的設想，即從三個方面解決農村的醫療保障問題：一是整改鄉村醫療機構，高效利用資源，平抑藥價，解決農民的預防保健及小病、小傷問題；二是開展醫療互助，增強抵禦大病風險的能力；三是發展農村商業保險，滿足多層次的醫療需求。從而保證在最終能為農民提供一個可靠的社會安全健康網路。
  14. At first, it uses the nsga - ii for obtaining the approximate pareto optimization solutions. then, local search is run with previous each solution to find a better solution using the mode search algorithm

    該演算法首先利用nsga -演算法得到近似的pareto最優解；然後以增廣的加權tchebycheff方程作為評價函數，採用模式搜索法對由nsga -演算法得到的每個解再進行局部優化。
  15. Proofs were made that global optimum ( or global pareto optimum ) of the decomposed problem and the original mdo problem are equivalent, and the decomposed problem retains all local optima ( or local pareto optima ) of the original mdo problem. by solving the decomposed problem using coevolutionary algorithms, the revolutionary mdo algorithms were formed

    證明了用這種分解方式分解后的問題與mdo原始問題的全局最優解（或全局pareto最優解）的等價性，以及這種分解方式保留了mdo原始問題的所有局部最優解（或局部pareto最優解） 。
  16. Nowadays, the popular image segmentation methods almost take part in the time space of the image, but in this paper, the processed images are transformed form time space to frequency space. thus avoid dealing with isolated pixels in the image, and use correlated phase function as the judgment rule to search for the optimal threshold value from the global solution space

    目前，大多數圖像分割方法都是在時域進行的;本文將圖像從時域變換到頻域，避免了對圖像中每一個像素進行單獨處理，使用了相位相關性函數作為評價函數，全局搜索最優解。
  17. To make it clear, the article use and analyze numerical value cases from bellmum and zadeh. finally in order to work out the value function in all forms and the expected value of optimization in all aspects easily, we take down all the problem existing in multi - stage stochastic decision processes. the solution of optimum is formed and multi - stage stochastic decision tree - table is introduced

    為說明問題，本文利用bellman和zadeh [ 1 ]的數值例，應用兩種方法進行分析，最後為了更方便的解出對所有形式的評價函數，及其期望值的最優化解對各種進行的發展，把經過多階段概率決策過程的問題記述下來，構成一個最優解的統一圖表，引入了多段概率決策樹表。
  18. In this paper, we will investigate the matrix equation in composition over a complete brouwerian lattice. first, we give an equivalent condition for the solvability of this equation, i. e. theorem 2. 2. 3 in this paper : the matrix equation in composition over a complete brouwerian lattice is solvable iff is the minimal solution of this equation

    本文主要探討完備brouwer格上的型矩陣方程，首先給出該類矩陣方程可解的一個等價條件，即本文的定理2 . 2 . 3 :完備brouwer格上的型矩陣方程可解的充要條件是是它的解，且是最小解
  19. In view of the non - uniqueness of optimal solution to linear programming dual problem, we considered the differences between shadow prices and the accounting prices, between shadow prices opportunity cost definition and the marginal value definition, and between shadow prices of combination resources and single resource, which explain the " non - uniqueness " of shadow prices in linear programming

    摘要針對線性規劃對偶問題最優解的非單一性，從影子價格與會計價格之間的區別、影子價格機會成本定義與邊際定義的區別、組合影子價格與單一影子價格的區別三個方面解釋線性規劃中影子價格的「非唯一性」 。
  20. Enlightened by genetic algorithm, the improved algorithm can find the best position through evaluating each dimension and picking out the bad ones, adopting mutation and improving it during the process of evolution

    受遺傳演算法思想的啟發，在拉子的進化過程中，通過對最優粒子的每一維進行評價，找到導致最終解質量差的維度，對其維上的數據進行變異，進而有針時性地改進，尋找到每一維上的最佳位置。
分享友人
分享到 Line

分享到臉書