Investigation of quantitative , decision - making techniques available to management . topics include linear programming , integer programming , game theory , simulation , queuing theory , networking , project management , and inventory control 本課程旨在研究量化與決策技術(shù)在管理的應(yīng)用。課程內(nèi)容包括線性規(guī)劃、數(shù)理規(guī)劃、競賽理論、仿真程序、排隊(duì)理論、網(wǎng)絡(luò)建立、項(xiàng)目管理及庫存控制理論。
First of all , it summarized predecessors " research methods and results , and then art1 artificial neural networks and integer program based on the p - median method were utilized to simulate a classic example respectively 首先總結(jié)了這方面前人的研究方法和成果,其次運(yùn)用了基于p - median技術(shù)的art1人工神經(jīng)網(wǎng)絡(luò)和整數(shù)規(guī)劃的方法分別對一個(gè)經(jīng)典范例進(jìn)行了仿真,并與前人的結(jié)果進(jìn)行了比較。
On base of consulting a great amount of material , a deep research on the optimized method of the transformer maintenance schedule design is done in this paper , the integer programming model is set up and the ga ( genetic algorithm ) is adopted to get the optimized result 本文深入研究了變壓器檢修計(jì)劃的優(yōu)化決策方法,建立整數(shù)規(guī)劃數(shù)學(xué)模型,并采用魯棒性很強(qiáng)遺傳算法進(jìn)行優(yōu)化求解。
Selecting cultivated land into prime farmland is the process of determining every cultivated land plot wether being selected into prime farmland or not according to the ranking results and the quantity of prime farmland . a 0 - 1 integer programming model can solve this problem 耕地入選基本農(nóng)田是根據(jù)耕地排序結(jié)果,以基本農(nóng)田數(shù)量為約束,確定每塊耕地是否被選為基本農(nóng)田,具體采用0 - 1整數(shù)規(guī)劃模型。
In order to minimize total ordering and holding costs , a simple solution model using mixed integer programming techniques is presented to determine the optimal solution of the number of orders and timing of replenishment points , and quantity to be ordered at each replenishment 此外,為達(dá)到極小化總訂購成本及總持有成本,本模型?用混合整?規(guī)劃技巧提供一個(gè)簡單求解方法,可同時(shí)求得最佳訂購次? 、訂購點(diǎn)及每次訂購? ? 。
Based on the modified house of quality , the chance - constrained programming model is developed to determine the optimal striving targets by stochastic simulation and genetic algorithm , and the 0 - 1 integer programming model is derived for the decision - making of reengineering objectives 基于改進(jìn)的質(zhì)量屋建立了機(jī)會(huì)約束規(guī)劃模型,通過隨機(jī)類比和遺傳算法確定最佳奮斗目標(biāo);建立了0 - 1整數(shù)規(guī)劃模型,用于經(jīng)營過程重構(gòu)目標(biāo)的決策。
Then , the four procedures of controller synthesis , namely , the constraint transformation method ( ctm ) , the eigen marking method ( emm ) , the linear integer program method ( lip ) and the extended linear integer program method ( elip ) are discussed one by one 監(jiān)控理論部分:首先討論了禁止?fàn)顟B(tài)問題的最大允許控制器存在的充分必要條件;接著研究了四種具體的控制器綜合方法,即約束變換法、特征標(biāo)識法、線性整數(shù)規(guī)劃法和擴(kuò)展線性整數(shù)規(guī)劃法。
With the mixing ratio calculated from the production scheduling , a mixed integer programming model of crude oil storage scheduling is presented based on the crude oil inventory and input planning , the relationship between crude oil storage in the port tank and in the refinery tank is fully considered 根據(jù)煉油生產(chǎn)調(diào)度得到的原油混煉比,結(jié)合原油庫存和進(jìn)廠計(jì)劃,對原油儲運(yùn)調(diào)度問題建立了混合整數(shù)規(guī)劃模型,分別就廠內(nèi)罐區(qū)和碼頭罐區(qū)進(jìn)行了詳細(xì)的描述。
This paper also suggests an effective method of preventing premature of genetic algorithm is presented based on the analysis of causes of premature of genetic algorithms . some different local optima are found firstly and the best of these solutions is regarded as the last result . 0 - 1 integer linearity programming is an important integer programming model 另外ga在應(yīng)用中還存在早熟收斂的問題,本文介紹了解決該問題的一種策略,對一個(gè)優(yōu)化問題連續(xù)多次運(yùn)行g(shù)a以求得多個(gè)不同的局部最優(yōu)解,再從這多個(gè)局部最優(yōu)解中挑選一個(gè)最優(yōu)的作為算法的最后結(jié)果,該方法可大大提高了ga求得真正全局最優(yōu)解的可能性。
Then , with respect to the objective of minimizing the total experimental cost , the optimal test plan ( including the sample size , inspection frequency , and the termination time needed by the classification rule for each of competing designs ) is derived by solving a nonlinear integer programming with a minimum probability of correct classification and a maximum probability of misclassification 首先,我們提出一種具直觀優(yōu)點(diǎn)的分?法則,然后以總試驗(yàn)成本的最小化為目標(biāo),并賦予一正確分?的最小機(jī)?要求和錯(cuò)誤分?的最大容許機(jī)? ?個(gè)限制條件,以決定出在所提出的分?法則下,各競標(biāo)設(shè)計(jì)樣式所需的樣本? 、 ?測頻?和試驗(yàn)終止時(shí)間的最佳組合。
An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming (ILP).