Name | Modified | Size | Downloads / Week |
---|---|---|---|
optimtask_learn_alfa_win_demo_i386.rar | 2010-09-28 | 743.0 kB | |
OPTIMTASK_readme_instryk.txt | 2010-06-22 | 4.6 kB | |
optimtask5_tranc_alfa_win_demo_i386.zip | 2010-06-22 | 552.3 kB | |
optimtask5_tranc_alfa_suse_i386.tar.gz | 2010-06-22 | 163.7 kB | |
Totals: 4 Items | 1.5 MB | 0 |
OPTIMTASK ERP technology ALFA - the basic algorithm for solving the optimization problem (simplex method) BETA - analysis of the impact of changes (prices, regulations, resources) on the final cost GAMA - a study of factors of production to final cost OPTIMTASK1 - Industrial Logistics Search for the optimal production plan for given portfolio minimum Hmin and maximum Hmah, providing minimal total cost of resources OPTIMTASK2 - Marketing Logistics OPTIMTASK3 - choose from a set of initial components OPTIMTASK4 - Distribution Logistics OPTIMTASK5 - Transportation Logistics OPTIMTASK6 - Commercial Logistics OPTIMTASK1 - Industrial Logistics Optimization model of industrial activity is formulated: - For a given portfolio Hmin minimum and maximum Hmah, - To determine the total cost of procurement, manufacturing assembly operations of main production minimizing the cost Z1 = SUMM (C i * Xi) -> MIN, with constraints on resources available to the company SUMM (Aij * Xi) <Rj, where Xi, C i - the volume and cost of producing the i-th type of product; Aij Aij - consumption rate j-th resource for the production of the i-th type of product; Rj - j-th resources are available to the firm (fund work units or resource availability in stock) Find such production X1-X3 products Sebesta st Z1 = SUMM (C i * Xi) -> minimal with constraints on resources available to the company 2.38 * X1 + 2.4 * X2 + 2.9 * X3 ---> min Sebesta stSi 3.8 * X1 + 3.2 * X2 + 3.7 * X3 <120.0 Resource blank production <120 8.9 * X1 + 5.1 * X2 + 3.2 * X3 <230.0 Electro-assembly 0.19 * X1 + 0.15 * X2 + 0.16 * X3 <40.9 Mechanical Processing 0.11 * X1 + 0.13 * X2 + 0.17 * X3 <30.7 Control operation 5.4 * X1 + 5.1 * X2 + 5.1 * X3 <40.9 assembling 1.0 * X1 + 0.0 * X2 + 0.0 * X3> 15.0 Pattern of the product, 1> 15 units 0.0 * X1 + 1.0 * X2 + 0.0 * X3> 5.0 Plan of the product 2> 5 units 0.0 * X1 + 0.0 * X2 + 1.01 * X3> 5.0 Plan of the product 3> 5 units OPTIMTASK ERP òåõíîëîãèè ALFA - áàçîâûé àëãîðèòì ðåøåíèÿ îïòèìèçàöèîííîé çàäà÷è (ñèìïëåêñ ìåòîä) BETA - àíàëèç âëèÿíèÿ èçìåíåíèÿ ( öåí , íîðì ,ðåñóðñîâ ) íà èòîãîâûå çàòðàòû GAMA - èññëåäîâàíèå ïðîèçâîäñòâåííûé ôàêòîðîâ íà èòîãîâûå çàòðàòû OPTIMTASK1 - ïðîèçâîäñòâåííàÿ ëîãèñòèêà Ïîèñê îïòèìàëüíîãî ïðîèçâîäñòâåííîãî ïëàíà äëÿ çàäàííîãî ïîðòôåëÿ çàêàçîâ ìèíèìàëüíîãî Õìèí è ìàêñèìàëüíîãî Õìàõ, îáåñïå÷èâàþùåãî ìèíèìàëüíûå ñóììàðíûå çàòðàòû ðåñóðñîâ OPTIMTASK2 - ìàðêåòèíãîâàÿ ëîãèñòèêà OPTIMTASK3 - âûáîð èç íàáîðà èñõîäíûõ êîìïîíåíò OPTIMTASK4 - ðàñïðåäåëèòåëüíàÿ ëîãèñòèêà OPTIMTASK5 - òðàíñïîðòíàÿ ëîãèñòèêà OPTIMTASK6 - êîìåð÷åñêàÿ ëîãèñòèêà OPTIMTASK1 - ïðîèçâîäñòâåííàÿ ëîãèñòèêà Îïòèìèçàöèîííàÿ ìîäåëü ïðîèçâîäñòâåííîé äåÿòåëüíîñòè ôîðìóëèðóåòñÿ: - äëÿ çàäàííîãî ïîðòôåëÿ çàêàçîâ ìèíèìàëüíîãî Õìèí è ìàêñèìàëüíîãî Õìàõ, - îïðåäåëèòü ñóììàðíûå çàòðàòû íà çàãîòîâèòåëüíûå , îáðàáàòûâàåìûå è ñáîðî÷íûå îïåðàöèè îñíîâíîãî ïðîèçâîäñòâà îáåñïå÷èâàþùèå ìèíèìèçàöèþ çàòðàò Z1 = SUMM ( Ñi * Xi )--> MIN, ïðè îãðàíè÷åíèÿõ íà ðåñóðñû ðàñïîëàãàåìûå ïðåäïðèÿòèåì SUMM ( Aij * Xi ) < Rj, ãäå Õi, Ñi - îáúåì è ñåáåñòîèìîñòü ïðîèçâîäñòâà i- îãî âèäà ïðîäóêöèè; Aij Aij - íîðìà ðàñõîäà j îãî ðåñóðñà íà ïðîèçâîäñòâî i- îãî âèäà ïðîäóêöèè; Rj - j ûé ðåñóðñ ðàñïîëàãàåìûé ôèðìîé ( ôîíä ðàáîòà ïîäðàçäåëåíèé èëè íàëè÷èå ðåñóðñà íà ñêëàäå ) Íàéòè òàêèå îáúåìû ïðîèçâîäñòâà Õ1-Õ3 èçäåëèé Ñåáåñò-ñòü Z1= SUMM ( Ñi * Xi ) --> ìèíèìàëüíà ïðè îãðàíè÷åíèÿõ íà ðåñóðñû ðàñïîëàãàåìûå ïðåäïðèÿòèåì 2.38 *X1 + 2.4 *X2 + 2.9 *X3 ---> min Ñåáåñò-ñòüÑi 3.8 *X1 + 3.2 *X2 + 3.7 *X3 < 120.0 ðåñóðñ çàãîòîâèòåëüíîãî ïðîèçâîäñòâà < 120 8.9 *X1 + 5.1 *X2 + 3.2 *X3 < 230.0 Ýëåêòðî-ìîíòàæ 0.19 *X1 + 0.15 *X2 + 0.16 *X3 < 40.9 Ìåõ îáðàáîòêà 0.11 *X1 + 0.13 *X2 + 0.17 *X3 < 30.7 Êîíòðîëüíàÿ îïåðàöèÿ 5.4 *X1 + 5.1 *X2 + 5.1 *X3 < 40.9 Ñáîðî÷íîå 1.0 *X1 + 0.0 *X2 + 0.0 *X3 > 15.0 Ïëàí ïî èçäåëèþ 1 > 15 åäèíèö 0.0 *X1 + 1.0 *X2 + 0.0 *X3 > 5.0 Ïëàí ïî èçäåëèþ 2 > 5 åäèíèö 0.0 *X1 + 0.0 *X2 + 1.01 *X3 > 5.0 Ïëàí ïî èçäåëèþ 3 > 5 åäèíèö