Management based on the application of operation research methods



Download 69,41 Kb.
bet2/3
Sana04.06.2022
Hajmi69,41 Kb.
#635092
1   2   3
Bog'liq
Sarimsaqov D - Article

xjf - sales volume of product j on segment f; where j ∈ J1 and j ∈ J2,
where J1 is the set of products j with which the company is already working in the market;
J2 - the set of products j, according to which the company must make a decision on entering the market;
f ∈ F, F - the set of segments f on which the enterprise can work with its products;
wjf - Boolean variables that control the inclusion plan of production and sale of "new", previously developed products; moreover, the variables wjf are such that wjf = 1 if the product j is to be sold on the market segment f and wjf = 0 otherwise;
gjf - unit price of product j at which the product will be sold on segment f;
kjf - Boolean variables that track the fact that the calculated prices kjf exceed the specified marginal prices qjfпр for segment f;

The variables kjf are such that kjf = 1, if gjfqjfпр and kjf = 0, if gjf > qjfпр.


The system restrictions on the values of controlled variables describes the operating conditions that investigated production system.
The limitation that guarantees the enterprise achievement in the planned period of a given level profit from the production and sale products has the form:
,
where Sjf is the cost of selling unit product j on segment f;
- unit price of the resource l;
mjl is the rate of consumption resource l per unit of product j;
L is the set of items production resources l;
P0– the desired value of the company's profit from product sales for the planning period;

The restrictions guaranteeing the company to achieve a given value market share for each segment under study are reduced to a system of inequalities form:



where bf is the desired value of the market share of the f-th segment;
Ef is the market capacity of segment f.
Restrictions on the values volume product supply in various market segments are:



,
where ajf, ājf are the lower and upper bounds of the supply volume product j in the f segment (ajf, is the mandatory part of the production volume product j to sell it in the f segment; ājf is the solvent demand for product j in the f segment).
Restrictions on production resources, guaranteeing that the estimated resource requirements do not exceed the levels of available resources, are reduced to the following inequalities:

where Ml is the level of available resources that type l in the planning period. Restrictions on product price values are written as follows:

where qjf is the lower bound on the unit price of product j on segment f (for example, the cost of the product).
qjfпр – marginal price of product j on segment f.
The optimality criterion (objective function) of the task is to maximize the expected profit from product sales for the planning period:

As a result, we obtain the following statement of the problem: it is required to find such values ​​ x*=||xjf*||, w*=||wjf*||, g*=||qjf*|| и k*=||kjf*|| controlled variables that would satisfy the constraint system and at the same time deliver the maximum objective function P (x, w, q, k).
The optimization model belongs to the class of nonlinear programming models with controlled variables integer (Boolean) and continuous type [3, 4].
To analyze the model, it is proposed to use a heuristic algorithm based on a phased increase in the prices of products and the solution at each stage corresponding problem to the partially integer programming using the branch and bound method (Land and Doig method). With an iterative increase in prices (starting from the cost of products), the expected profit should initially grow due to the growth in revenue. In the future, certain types of products for which the current price values ​​will exceed the marginal prices for the segments will begin to “drop out” of the segments. As a result, profit growth should slow down and starting a certain iteration, profit will decrease. The values ​​of supply volumes and product prices, as well as the many remaining segments at a certain step iterative process, at which the maximum profit enterprise is achieved, will correspond to the optimal solution to the problem.
As a result of solving the problem, it seems possible to optimize the choice of target segments, assortment and sales volumes products, as well as product prices in each segment; most fully take into account consumer demand; maximize the expected profit from product sales and the efficiency of using production resources.


The solution to the problem on the PC in relation to the communications industry.

Initial data. The distribution has already developed and alternative types of services by market segments are presented in Table 1. The symbol "*" means the possibility of the communications enterprise working with this service in the market segment, and the symbol "**" - a new (alternative) service.
TABLE 1 Distribution of services by market segment

Service Code

Service

Segment Code


Download 69,41 Kb.

Do'stlaringiz bilan baham:
1   2   3




Ma'lumotlar bazasi mualliflik huquqi bilan himoyalangan ©hozir.org 2024
ma'muriyatiga murojaat qiling

kiriting | ro'yxatdan o'tish
    Bosh sahifa
юртда тантана
Боғда битган
Бугун юртда
Эшитганлар жилманглар
Эшитмадим деманглар
битган бодомлар
Yangiariq tumani
qitish marakazi
Raqamli texnologiyalar
ilishida muhokamadan
tasdiqqa tavsiya
tavsiya etilgan
iqtisodiyot kafedrasi
steiermarkischen landesregierung
asarlaringizni yuboring
o'zingizning asarlaringizni
Iltimos faqat
faqat o'zingizning
steierm rkischen
landesregierung fachabteilung
rkischen landesregierung
hamshira loyihasi
loyihasi mavsum
faolyatining oqibatlari
asosiy adabiyotlar
fakulteti ahborot
ahborot havfsizligi
havfsizligi kafedrasi
fanidan bo’yicha
fakulteti iqtisodiyot
boshqaruv fakulteti
chiqarishda boshqaruv
ishlab chiqarishda
iqtisodiyot fakultet
multiservis tarmoqlari
fanidan asosiy
Uzbek fanidan
mavzulari potok
asosidagi multiservis
'aliyyil a'ziym
billahil 'aliyyil
illaa billahil
quvvata illaa
falah' deganida
Kompyuter savodxonligi
bo’yicha mustaqil
'alal falah'
Hayya 'alal
'alas soloh
Hayya 'alas
mavsum boyicha


yuklab olish