set of lower bounds 中文意思是什麼

set of lower bounds 解釋
下界集
  • set : SET =safe electronic transaction 安全電子交易〈指用信用卡通過因特網支付款項的商業交易〉。n 【埃...
  • of : OF =Old French 古法語。
  • lower : adj 〈low 的比較級〉1 較低的。2 下級的,低級的。 lower animals 下等動物。3 南部的。 in lower Manh...
  • bounds : 邦茲
  1. In chapter two, concepts of integrity, integral set and integral number are introduced firstly, and then some relationships between the integrity and some other parameters of graphs are given, then the upper and lower bounds of the integrity are investigated on the basis of integral number determined. the final result is the upper and lower bounds of integral number if the integrity is known

    第二部分主要討論了完整度與圖的其它參數之間的關系;給出了完整度給定條件下完整數的最大可能值及完整數給定條件下,完整度的最大最小可能值;給出了圖的完整度與此圖的刪點子圖的完整度之間的關系。
  2. 2. for the problem with size, stress and displacement constraints, the stress constraint is transformed into movable lower bounds of sizes, the displacement constraint is transformed into an approximate function which explicitly includes design variables by using mohr integral theory. a mathematical programming model of the optimization problem is set up. the dual programming of the model is approached into a quadratic programming model

    2 .對于尺寸、應力和位移約束的問題,將應力約束化為動態下限,用單位虛荷載方法將位移約束近似顯式化,構造優化問題的數學規劃模型,將其對偶規劃處理為二次規劃問題,採用lemke演算法進行求解,得到滿足尺寸、應力和位移約束條件的截面最優解。
  3. First we give some notations : where r lti : the load of the machine at step t ( i. e., immediately after the ith job has been scheduled ) optt : the current optimum makespan in step t ( for the job set { j1 ; …, jt } ) lbt : the lower bound of the length in step t for a set of jobs with processing times p1, …, pn, there are three straightforward lower bounds for the makespan of any preemptive schedule on m identical machines : max so we have lb = max ( 3. 2. 1 ) the algorithm will schedule jobs in such a way that, at any step t algorithm : a new job jt + 1 ( which arrives at time t + 1 ) is assigned as follows : step 1 compute the new lower bound lbi + 1 according to ( 3. 2. 1 ) step 2 research the following reserved intervals

    需加工n個工件人; … ;人,每個工件是在線到達( oneb , olle )且可打斷的,機器人人的準備時間為az ,怎樣安排加工順序,使工件的最大完工時間( makespan )盡可能地小,稱此問題為帶機器準備時間的平行機在線排序問題。它是帶機器準備時間的平行機排序和平行機在線排序問題的綜合和推廣;具有廣泛的應用背景。這里工件在線到達( onebyone )指的是工件的情況並不是提前知道的,只有將工件jj人安排完以後我們才能知道工jj的一些情況p工件的加工時間p 。
分享友人