linear programming problem造句
例句與造句
- Secondly , according to convex geometric characteristics , a common - perpendicular - line algorithm is developed for the distance between the convex nurbs surfaces by making surfaces discrete , approximating the distance by one between convex hulls of discrete surfaces and solving a linear programming problem to get their vertical projective length on common perpendicular direction , that is , the original distance
然后，針對(duì)凸曲面的幾何特征，給出了nurbs凸曲面間距離求解的公垂線法和切平面法。公垂線法是把曲面間的距離求解問題轉(zhuǎn)化成曲面的離散點(diǎn)生成的凸殼間的距離，再歸之為兩凸殼在其公垂線上投影集合間的距離，由此抽象成一個(gè)線性規(guī)劃問題，估算出近點(diǎn)對(duì)。 - In contrast to existing simplex method , this method has several peculiarities as follows : to begin with , applying it to solve linear programming problem . one need n ' t introduce any additional variable such as relaxing variable , artificial variable and other parameters , so that calculation is subtracted on a large scale . in addition to this , as a result of its higher degree of structuralization , this algorithm can be more easily transformed into program language and , of course , more quickly performed by computers
與現(xiàn)有的單純形法相比，新算法具有如下主要特征：第一，求解過程不需要引進(jìn)諸如松馳變量、人工變量等參變量參與運(yùn)算，計(jì)算量大大減少了；第二，新算法較單純形法的結(jié)構(gòu)化程度高，更容易轉(zhuǎn)化為程序語言，進(jìn)而在計(jì)算機(jī)上更快地得以實(shí)現(xiàn)；第三，新算法在運(yùn)算過程中不會(huì)引起攝動(dòng)現(xiàn)象。 - In section one , based on theory of n dimensional euclid space , a new method labeled as " pointlineplane " recycling optimization algorithm is proposed to solve the linear programming problem . this algorithm is proposed on the basis of the thought as follovvs : as for three dimensional euclid space , the feasible region of any linear programming problem is a extended convex polyhedron , of which surface is consisted of some planes , and its objective function can be regarded as a parallel plane pencil with objective function value acting as parameter
第一部分內(nèi)容是在n維歐氏空間理論的基礎(chǔ)上提出了一種求解線性規(guī)劃問題的新算法? “點(diǎn)線面”循環(huán)尋優(yōu)法，本算法是基于如下思想提出來的：我們知道，在三維歐氏空間中，線性規(guī)劃問題的可行域是一個(gè)由若干個(gè)平面圍成的廣義多面體，目標(biāo)函數(shù)可以看作是以目標(biāo)函數(shù)值為參變量的一個(gè)平行平面束。 - According to order relations defined between fuzzy numbers , the pareto less optimal solution and the pareto optimal solution are defined , then a fuzzy evaluation function is introduced into a multiobjective programming problem , this method results in a multiobjective programming problem been converted into a one objective programming problem , accordingly the solution by this method is the pareto less optimal solution to the primitive problem , which is given proof a multiobjective problem with general fuzzy number coefficients is also further discussed , by _ cutset of fuzzy sets a multiobjective problem can be transformed into a interval linear programming problem , and using the method of the previous chapter , we can obtain the pareto less optimal solution
從模糊數(shù)之間的序關(guān)系出發(fā)，分別定義了弱較優(yōu)解和較優(yōu)解，然后對(duì)模糊多目標(biāo)問題引入模糊評(píng)價(jià)函數(shù)，將多目標(biāo)化為單目標(biāo)，在此也證明了求得的解為原問題的弱較優(yōu)解。還討論了系數(shù)為一般模糊數(shù)的多目標(biāo)問題，通過模糊集的水平集可將多目標(biāo)問題轉(zhuǎn)化為區(qū)間數(shù)線性規(guī)劃問題，并利用上一章所講的方法，得到原問題的弱較優(yōu)解。最后，對(duì)變量為模糊數(shù)的線性規(guī)劃問題也進(jìn)行了討論。 - It's difficult to find linear programming problem in a sentence. 用linear programming problem造句挺難的
更多例句： 上一頁