亚洲免费av电影一区二区三区,日韩爱爱视频,51精品视频一区二区三区,91视频爱爱,日韩欧美在线播放视频,中文字幕少妇AV,亚洲电影中文字幕,久久久久亚洲av成人网址,久久综合视频网站,国产在线不卡免费播放

        ?

        Application of Computer Lingo Software in Production Efficiency

        2019-12-26 03:18:06XiongLi
        中阿科技論壇(中英文) 2019年4期

        Xiong Li

        (Hubei Communication Technical College,Wuhan,Hubei 430079)

        Abstract:This paper comes from the problem of production efficiency when the author reads the story of mathematician,and expounds the importance of production efficiency when arranging production and the application of lingo from three aspects.

        Key words:production efficiency;lingo

        The author read about some books about the life and deeds of Mr.Hua luogeng,a mathematician,in spare time.Mr.Hua luogeng was the first mathematician in modern China who applied mathematical theory research to production practice and promoted the development of economic mathematics.In his later years,he vigorously promoted the unification and selection methods.

        In normal production,if the way of production arrangement is different,the efficiency will be very different,here is an example to illustrate.

        Suppose a factory has three workers produce two different components,in unit time,worker A can produce 80 components A or 40 components B,worker B can produce 30 components A or 90 components B,and worker C can produce 15 components A or 60 components B,each of the components is fitted into a set.So,how should the factory arrange production?

        In order to facilitate the understanding,we list the key data in the above conditions as follows:

        I.First of all,Suppose that Each Worker is in a Row,and Each of Them Can Produce Matching A and B Parts

        If unit time is 1,worker A's time to produce part A isx,and the time to product part B is1-x,then:80x=40(1-x),solved to getx=

        At this time,the production of parts componentspieces each,constituting 27 sets.

        Similarly,the unit time is 1,and the time worker B spent to produce part A isy,and the time to product part B is1-y,then:30y=90(1-y),solved to gety=At this time,the production of parts componentspieces each,constituting 23 sets.

        As for worker C,the time worker C spent to produce part A isz,and the time to product part B is 1-z,then 15z=60(1-z),solved to getz=At this time,the production of parts componentspieces each,constituting 12 sets.

        The data list is as follows:

        Therefore,the total number of sets of parts produced is 27+23+12=62sets.

        Obviously,this method does not give full play to the advantages of each worker,the speed of A,B and C is different.Within the unit time,worker A produces the largest number of parts A and worker B produces the largest number of parts B.If the workers with the largest number of parts are arranged to produce only the parts,there are the following ways.

        II.Whoever Produces More of That Parts will be Arranged to Produce that Parts

        Worker A produces part A in the largest quantity within the unit time,worker A shall be arranged to produce part A;Worker B produces part B in the largest quantity within the unit time,worker B shall be arranged to produce part B;in order to match the A and B,worker C shall produce two parts.Set the time of worker C used to produce part A asx,then the time of producing part B isxx,and we can get:

        Solved to getx=,the quantity of part A produced by worker C issets,the quantity of parts B produced by worker C is.The total number of parts is listed below:

        Therefore,the total number of sets of parts produced is 80+14=90+4=94sets.

        It can be seen that when worker produces complete set of parts severally,the total production number is 62;after considering which parts they produced more per unit time,the production plan was adjusted,and the total number of production sets was 94,which increased by half,resulting in a 50%increase in efficiency.Then,is 94 sets the maximum production?

        Let's consider that worker A produces parts A and B are 80 and 40 respectively,and the efficiency ratio of producing two parts per unit time is 80:40=2:1;similarly,the efficiency ratio of worker b is 30:90=1:3;the efficiency ratio of worker C is 15:60=1:4.This shows that A has the highest efficiency in producing part A and C has the highest efficiency in producing part B.

        III.Whoever Makes Which Part is the Most Efficient Will Be Arranged to Make the Part

        We adjust the production plan,so that worker A only produces part A and worker c only produces part b.In order to form complete set,worker B makes both part A and part B.Set the time of worker B used to produce part A asx,then the time of producing part B is11xx,in order to match the A and B,we can get:

        That is,the quantity that arrange worker B to produce part A issets,the quantity that arrange worker B to produce part B issets.The total number of parts is listed below:

        Therefore,the total number of sets of parts produced is 80+18=38+60=98sets,4 more than the previous scheme.

        It can be seen that,in the production process,the results may vary greatly with different production arrangements.In the 1960s and 1970s of the last century,we also seem to be able to appreciate Mr.Hua luogeng's efforts to promote the role of the unified planning method and the excellent selection method under the circumstances,and made outstanding contributions to the national economic construction.

        Problems of increasing efficiency through scheduling can sometimes be solved by computers.For example,the following problems in linear programming:

        A food factory uses rice as the main raw material to process A and B food,after 12 hours' processing,a bag of rice can get 3kg of A,with the profit of 24 yuan per kg.4 kg of B can also be obtained after 8 hours of processing,and each kg of B can earn 16 yuan.At present,the daily supply of rice raw materials is 50 bags,and the controlled quantity of labor hours is 480 hours,and due to the control of market demand,the maximum amount of processing is 100 kg of A.

        How should the factory arrange production so as to maximize the profit after sales? What is the maximum?

        We analyze the constraints,decision variables and objective functions of the linear programming problem,letx1bag of rice produce A,x2bag of rice produce B,and get the mathematical expression of the problem:

        Because it's a linear programming problem with two variables,using graphical method then we can get:x1=20,x2=30.The maximum profit value is:(yuan).

        However,if analyze the following problems:(1)Raw material supply is controlled.If you can buy a bag of rice for 35 yuan now,do you want to buy it?(2)Processing hours are controlled,if workers can be temporarily hired,what is the maximum hourly wage? (3)If the profit of product A increases to 30 yuan/kg,does the original production plan need to be adjusted? Even using graphical method these problems won’t be solved.It is a time of information age,the application of computer software is very wide,LINGO is a mathematical software to solve planning problems,the interface is simple,intuitive,and easy to understand,we can use it to solve the problem.

        As shown in figure 1,input in LINGO interface:

        After checking that there is nothing wrong with the program,clickon the menu,the following results are obtained:

        It can be seen from the operation results in figure 2x1=20,x2=30,the maximum profit value is(yuan).The result is consistent with the graphic method.

        Figure 1

        Figure 2

        In addition,according to the shadow price in the above results,the surplus amount of raw rice is 0,and every additional bag of rice will increase the profit by 48 yuan.Since the cost of a bag of rice is 35 yuan,less than the 48 yuan increase in profit,it can be bought.The remaining amount of working hours is 0,and the profit will be increased by 2 yuan for each additional unit of working hours.Therefore,if the working hours are increased,the wages of temporary workers should not be more than 2 yuan/hour.The processing capacity of A is 40,and the increase of the processing capacity will not affect the profit,so the production plan will not be changed when A's profit increases to 30 yuan/kg.

        You can't do it graphically if you increase the variables in the previous example,but LINGO still works,and graphical methods cannot analyze information such as shadow prices,which are important in the economy,for reference in economic decisions.However,with LINGO,it can be extended to the nonlinear programming problem,which can achieve many things at one stroke.

        亚洲又黄又大又爽毛片| 国产日韩精品中文字无码| 天天夜碰日日摸日日澡性色av| 亚洲精品无码av中文字幕| 亚洲自拍另类欧美综合| 国产乱人伦AⅤ在线麻豆A| 精品高清一区二区三区人妖| 成年免费a级毛片免费看无码 | 中文字幕人妻互换av| 又爽又黄又无遮挡网站| 国产精品爽爽va在线观看无码| 亚洲精品一二区| 尤物成av人片在线观看| 国产自拍av在线观看视频| 天天综合网天天综合色| 久久半精品国产99精品国产| 亚洲一级天堂作爱av| 亚洲国产一区二区三区精品| 浪货趴办公桌~h揉秘书电影| 久久久久99精品成人片试看| 无码中文字幕av免费放| 精品自拍偷拍一区二区三区| 精品一区二区三区四区国产| 永久免费看啪啪网址入口| 日韩另类在线| 亚洲成A人A∨久在线观看| 人妻有码av中文幕久久| 国产爆乳美女娇喘呻吟| 亚洲日韩精品无码专区网站| 国产91吞精一区二区三区| 国产成人高清视频在线观看免费| 狠狠色欧美亚洲狠狠色www| 久久国产精品久久久久久| 国产精品乱一区二区三区| 久久偷拍国内亚洲青青草| 国产精品久久国产精麻豆99网站 | 视频福利一区| 99热久久只有这里是精品| 国产手机在线观看一区二区三区| 国产亚洲精品bt天堂精选| 国产欧美日韩不卡一区二区三区|