{"id":154075,"date":"2025-05-30T15:21:27","date_gmt":"2025-05-30T12:21:27","guid":{"rendered":"https:\/\/azbuki.bg\/?p=154075"},"modified":"2025-05-30T15:21:27","modified_gmt":"2025-05-30T12:21:27","slug":"how-to-select-projects-and-allocate-funds-to-obtain-the-total-maximum-profit-for-facing-many-different-investment-projects-in-the-production-strategy-management-plan-of-discrete-production-enterprise","status":"publish","type":"post","link":"https:\/\/bel.azbuki.bg\/en\/international-scientific-and-technical-conference-automation-of-discrete-production-engineering-2025\/how-to-select-projects-and-allocate-funds-to-obtain-the-total-maximum-profit-for-facing-many-different-investment-projects-in-the-production-strategy-management-plan-of-discrete-production-enterprise\/","title":{"rendered":"How to select projects and allocate funds to obtain the total maximum profit for facing many different investment projects in the production strategy management plan of discrete production enterprise"},"content":{"rendered":"

Bao Gang<\/a>
\n<\/strong>ORCID iD:0009-0008-5357-9198
\nUniversity of Ruse \u201cAngel Kanchev\u201d,<\/em> Bulgaria<\/em><\/p>\n

Pavel<\/strong> Vitliemov
\n<\/strong><\/a>ORCID iD:0000-0002-1747-7994
\nWeb of Science Researcher ID: H-5795-2018
\nUniversity of Ruse \u201cAngel Kanchev\u201d, Bulgaria<\/em><\/p>\n

https:\/\/doi.org\/10.53656\/adpe-2025.18<\/a><\/p>\n

\"\"
\nPDF<\/a><\/p>\n

Pages 197-216<\/em><\/p>\n

Abstract<\/strong>. The market is developing rapidly, and the choice of production investment projects presents diversity and complexity. Manufacturing enterprises not only need to select high-profit target products (multiple target products) suitable for their own production but also need to reasonably allocate limited resources to ultimately obtain the maximum total income of all investment projects. Therefore, manufacturing enterprises are faced with many challenges when selecting production investment projects and allocating limited resources. In the process of selection and allocation, enterprises need to combine their own conditions to select investment and production, strengthen cost management, and pursue the maximization of investment benefits. Here, our research in this area becomes important.<\/p>\n

This paper proposes a new method to establish an efficient process of investment project selection and resource allocation to obtain maximum total profit and emphasizes the importance of investment project selection and limited resource allocation. The basic steps and modules required for this process are described: the first step is to use the clustering analysis method (K-means) to cluster and screen the products with a high target profit in the market. In the second step, TOPSIS method is used in combination with the limited actual production conditions of the manufacturing enterprise to optimize the sequence of alternative and ideal solutions for the high-net profit products selected by the first step, and the good and bad solutions are sorted. The third step uses the dynamic programming model to optimize the allocation of resources for several target projects selected in the first two steps to obtain the total maximum profit. These 3 steps will be connected through MATLAB software series commands.<\/p>\n

In this paper, theoretical analysis and software programming simulation are carried out to determine the effectiveness and feasibility of the scheme. The advantage of this system is to efficiently screen out high-net profit investment and production projects from many products in the sales market, sort and select the final target projects in combination with the actual production conditions and capabilities of the manufacturing enterprises themselves and rationally allocate limited resources to obtain the maximum profit return of the total investment. This is an investment process with goals and plans, reasonable screening and allocation as well as maximum return on investment.<\/p>\n

Keywords:<\/em> production investment; K-means clustering analysis; TOPSIS method; dynamic programming; screening and allocation; maximum return on investment<\/p>\n

 <\/p>\n

    \n
  1. Introduction<\/strong><\/li>\n<\/ol>\n

    The investment and return of production has always been the focus of manufacturing enterprises. The selection and investment of successful production projects can help enterprises obtain high profit returns, which is the basis for manufacturing enterprises to continue to operate better.<\/p>\n

    But in the actual process, how to find the production investment products and projects that are most suitable for their own production conditions and capabilities in the highly competitive market? This is an important problem that has been plaguing many manufacturing enterprises. If the enterprise finds the most suitable production investment project with high net profit, it can help the manufacturing enterprise to give full play to its own advantages and rationally allocate limited resources to obtain the maximum profit return. If the production investment project selected by the enterprise is not fully in line with the production situation of the enterprise or the investment fails, it will not only waste the resources and time of the enterprise, but also may cause the investment funds to fail to return to the enterprise on time due to the investment failure, the capital chain of the enterprise is broken, and the manufacturing enterprises are heavily indebted and eventually go bankrupt. So, the current research in this field is particularly important. However, most of the existing similar literature studies mainly focus on artificial intelligence or big data analysis on a relative range of past data or use a single model or method to analyze and forecast data and processes, which has certain limitations. Manufacturing enterprises need to expand the market to face a broader market for efficient screening. Enterprises should make use of their own production conditions and limited resources to challenge the possibility of more production investment to obtain the maximum return on investment profit. We seek a more concrete and effective approach.<\/p>\n

    This paper presents a qualitative research method by using model combination for selecting production investment projects, sorting target schemes and selecting the best target schemes, allocating limited resources reasonably. Through the establishment of a combined mathematical model or theoretical model to describe the specific problem, show its working principle and process, while using MATLAB software to demonstrate the solution.<\/p>\n

    The main goal of this paper is to help manufacturing enterprises in the production strategic management plan for facing of a large number of different production investment projects to carry out high net profit production investment products and projects sorting alternatives and ideal schemes and select target schemes reasonable allocation of limited resources and obtain the maximum profit. This process solves the problems of subjective blind investment production, unreasonable allocation of limited resources and low return on investment of manufacturing enterprises.<\/p>\n

      \n
    1. C<\/strong>oncept<\/strong> of<\/strong> p<\/strong>roposed<\/strong> a<\/strong>pproach<\/strong> <\/strong>n<\/strong> t<\/strong>erms<\/strong> of <\/strong>p<\/strong>rofitability <\/strong>b<\/strong>ased<\/strong> o<\/strong>n<\/strong> the s<\/strong>election of<\/strong> <\/strong>nvestment <\/strong>p<\/strong>rojects<\/strong> and<\/strong> the<\/strong> a<\/strong>llocation<\/strong> of<\/strong> r<\/strong>esources<\/strong><\/li>\n<\/ol>\n

      This approach describes the concept of a method for enterprises to obtain strong profitability by selecting investment production projects and rationally allocating limited resources. This method is based on three steps. Figure 1 illustrates the working process of the three steps and analyzes the functions of each step.<\/p>\n

      \"\"<\/p>\n

      Figure 1. <\/strong>The workflow and functions of the three steps<\/pre>\n
      The market is developing rapidly, and the choice of production investment projects presents diversity and complexity. Manufacturing enterprises not only need to select high-profit target products (multiple target products) suitable for their own production but also need to reasonably allocate limited resources to ultimately obtain the maximum total income of all investment projects. Therefore, it is necessary to find a practical and effective method to carry out project screening and resource allocation, which is divided into the following 3 steps:<\/p>\n
      Step 1:<\/strong> use the clustering analysis method (K-means) to cluster and screen the products with high net profit in the market (high net profit = retail price – cost).<\/p>\n
      Step<\/strong> 2:<\/strong> use TOPSIS method combined with the limited actual production conditions of the manufacturing enterprise to optimize the sequence of alternative and ideal solutions for the high-net profit products selected by the first step, and the good and bad solutions are sorted. Further select some ideal target projects. And optimize the allocation of project resources for them in Step 3.<\/p>\n
      Step 3:<\/strong> use the dynamic programming model to optimize the allocation of resources for several target projects selected in the first two steps to obtain the total maximum profit.<\/p>\n
      Theoretical analysis and software programming simulation are carried out to determine the effectiveness and feasibility of the scheme. In this process, enterprises need to continuously screen according to their actual production conditions to obtain target investment projects, reasonably allocate limited resources and pursue the maximum profit return of the total investment project. This process achieves the best results through continuous testing and optimization. Finally, enterprises need to evaluate the proposed solutions to determine their actual application effects and make corresponding improvements or adjustments.<\/p>\n
      Figure 2 shows the entire optimization process of screening and allocation. The series command of MATLAB software will be used to connect the three models in the series to conduct the initial screening of investment production projects, the secondary screening of target investment production projects by combining their own production conditions and the optimal allocation of project resources. The following is the flowchart of the entire working process:<\/p>\n
      \"\"<\/p>\n
      Figure <\/strong>2<\/strong>. <\/strong>The flowchart of the entire working process<\/pre>\n
      Grammar:<\/strong><\/p>\n
        \n
      1. series<\/li>\n
      2. sys = series (sys1, sys2)<\/li>\n
      3. sys = series (sys1, sys2, outputs1, inputs2)<\/li>\n<\/ol>\n
        Description:<\/strong><\/p>\n
        Series connect two model objects in a serial fashion. This function accepts any type of model. Both systems are either continuous or discrete and have the same sampling time. Static gain is neutral and can be specified as a regular matrix.<\/p>\n
        Series 1:<\/strong> Connect the K-means clustering analysis model (sys1) and the TOPSIS method (sys2) in series as follows: sys = series (sys1, sys2, outputs1, inputs2) to form a common series connection (the entire process is shown in Figure 3). Sys1 will filter out dataset d from dataset b and output dataset d to sys2, which will further filter data d and output a new dataset g:<\/p>\n
        \"\"<\/p>\n
        Figure <\/strong>3<\/strong>. <\/strong>K-means clustering analysis model and TOPSIS method in series<\/pre>\n
        The index vectors outputs1 and inputs2 should connect the output d of sys1 and the input d of sys2.The resulting model sys takes b as input and g as output.<\/p>\n
        Series 2:<\/strong> Connect the TOPSIS method (sys 2) and dynamic programming (sys 3) in series as follows: sys=series (sys2, sys3, outputs2, inputs3) to form a common series connection (the entire process is shown in Figure 4), sys 2 will further filter data d and output a new dataset g, the new dataset g will be optimized for resource allocation in sys 3 and finally output dataset h to schedule production:<\/p>\n
        \"\"<\/p>\n
        Figure <\/strong>4<\/strong>. <\/strong>TOPSIS method and dynamic programming model in series<\/pre>\n
        This command is equivalent to direct multiplication: sys = sys2 * sys1<\/p>\n
        Through the above two-step MATLAB instructions, the three models can be arranged in series, the data can be input and processed in sequence, and finally a project dataset arranged to be produced can be output.<\/p>\n
        2.1. Step 1 \u2013 K-means clustering analysis <\/strong><\/p>\n
        Here, the goal of using K-means clustering analysis by manufacturing enterprises (He & Wei, 2024) is to divide the profit data set of various types of products in the market collected roughly in the early stage into K clusters, where one cluster is set to the enterprise’s desired target high profit cluster, and the profit size of each product is equivalent to the length of the Euclidean distance (Al-Ali et al., 2024).<\/p>\n
        By minimizing the sum of squared distances within the cluster, data points are clustered within the cluster, so that each data point belongs to the nearest cluster center. The cluster center is the average of all points in the cluster, representing the center position of the cluster. The enterprise sets the desired target profit as one cluster center, and by repeatedly adjusting the position of the cluster center, K – means continuously optimizes the tightness within the cluster, thereby obtaining clusters that are as compact and separated as possible and accurately identifying the product types belonging to the target profit cluster, completing the first screening (Zhu, 2024).<\/p>\n
        The basic process of K-means cluster analysis screening consists of 5 steps, but the process of screening is divided into two main steps: Assignment and Update. Figure 5 shows the process:<\/p>\n
        \"\"<\/p>\n
        Figure <\/strong>5<\/strong>. <\/strong>The process of K-means cluster analysis screening<\/pre>\n
        The detailed processes are as follows:<\/p>\n
        Step<\/strong> 1: <\/strong>Select K value<\/p>\n
        Set the quantity K of cluster. The quantity of K depends on the target plan of the manufacturing enterprise.<\/p>\n
        Step 2: <\/strong>Initialize cluster centers<\/p>\n
        Select K data points as the center of the initial clusters, set an initial target profit data point as an initial cluster center of K clusters (Agbulu et al., 2024).<\/p>\n
        Step 3:<\/strong> Assignment Step<\/p>\n
        For each point in the initial profit data set of various types of products in the market collected roughly in the early stage, assign it to the cluster corresponding to the nearest cluster center. The term \u201cdistance\u201d is usually used as the Euclidean distance.<\/p>\n
          \n
        • The goal of K-means is to minimize the Within-Cluster Sum of Squares (WCSS), which is the sum of squares of the distance between each point and the center of its cluster (Matlis et al., 2024), as follows:<\/li>\n<\/ul>\n
          \"\"<\/p>\n
          (1)<\/p>\n
          Among them:<\/p>\n
          K is the quantity of clusters.<\/p>\n
          c<\/sub> is the point set of the i-th cluster.<\/p>\n
          e is a data point belonging to c<\/sub>.<\/p>\n
          \u03bc<\/sub> is the center of the i-th cluster.<\/p>\n
          ||e-\u03bc<\/sub>||2 represents the squared Euclidean distance between data point e and cluster center \u03bc<\/sub>.<\/p>\n
            \n
          • K-means uses Euclidean distance to measure the distance between a point and the cluster center, and its formula is as follows:<\/li>\n<\/ul>\n
            \"\"<\/p>\n
            (2)<\/p>\n
            Where n is the dimension of the data (Liu et al., 2023).<\/p>\n
              \n
            • Find the nearest cluster center \u03bcj<\/sub> for each data point:<\/li>\n<\/ul>\n
              \"\"<\/p>\n
              (3)<\/p>\n
              Step 4:<\/strong> Update Step<\/p>\n
              Based on the current cluster allocation, the center of each cluster is recalculated, that is, the mean of all points in the cluster is calculated as the new cluster center:<\/p>\n
              \"\"<\/p>\n
              (4)<\/p>\n
              Step 5:<\/strong> Repeat steps 3 and 4<\/p>\n
              The assignment step and update step are repeated until the cluster center no longer changes (converges) or a specified maximum number of iterations is reached (Akshva, 2023).<\/p>\n
              MATLAB run instructions are as follows:<\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
              1<\/td>\nclc<\/td>\n<\/tr>\n
              2<\/td>\nclear;<\/td>\n<\/tr>\n
              3<\/td>\n <\/td>\n<\/tr>\n
              4<\/td>\n% main variables<\/td>\n<\/tr>\n
              5<\/td>\ndim = n; % (Pattern sample dimension)<\/td>\n<\/tr>\n
              6<\/td>\nk = m;\u00a0\u00a0 % (There are k clustering centers)<\/td>\n<\/tr>\n
              7<\/td>\n <\/td>\n<\/tr>\n
              8<\/td>\nload(‘testSet.txt’);<\/td>\n<\/tr>\n
              9<\/td>\nPM=testSet;% ( Pattern Sample Matrix)<\/td>\n<\/tr>\n
              10<\/td>\nN = size(PM,1);<\/td>\n<\/tr>\n
              11<\/td>\nfigure();<\/td>\n<\/tr>\n
              12<\/td>\nsubplot(1,n,1);<\/td>\n<\/tr>\n
              13<\/td>\nfor(e=1:N)<\/td>\n<\/tr>\n
              14<\/td>\n\u00a0\u00a0 plot(PM(e,1),PM(e,n), ‘*r’); % (Draw the original profit data points)<\/td>\n<\/tr>\n
              15<\/td>\n\u00a0\u00a0 hold on<\/td>\n<\/tr>\n
              16<\/td>\nend<\/td>\n<\/tr>\n
              17<\/td>\nxlabel(‘X’);<\/td>\n<\/tr>\n
              18<\/td>\nylabel(‘Y’);<\/td>\n<\/tr>\n
              19<\/td>\ntitle(Data points before clustering);<\/td>\n<\/tr>\n
              20<\/td>\nCC = zeros(k,dim); %(Cluster center matrix, CC (e,:) is the sample vector with initial value e)<\/td>\n<\/tr>\n
              21<\/td>\nD = zeros(N,k); %(D (e,\u03bc) is the distance between sample e and cluster center \u03bc)<\/td>\n<\/tr>\n
              22<\/td>\nC = cell(1,k); % (Cluster matrix, corresponding to the samples contained in the cluster. In the<\/td>\n<\/tr>\n
              23<\/td>\ninitial state, the sample set for cluster e (e<k) is [e], and the sample set for cluster k is [k,<\/td>\n<\/tr>\n
              24<\/td>\n\u00a0 k+1,… N])<\/td>\n<\/tr>\n
              25<\/td>\nfor e = 1:k-1<\/td>\n<\/tr>\n
              26<\/td>\n\u00a0\u00a0\u00a0 C{e} = [e];<\/td>\n<\/tr>\n
              27<\/td>\nend<\/td>\n<\/tr>\n
              28<\/td>\nC{k} = k:N;<\/td>\n<\/tr>\n
              29<\/td>\n <\/td>\n<\/tr>\n
              30<\/td>\nB = 1:N; % (In the last iteration. Which cluster does the sample belong to. Set the initial<\/td>\n<\/tr>\n
              31<\/td>\nvalue to 1)<\/td>\n<\/tr>\n
              32<\/td>\nB(k:N) = k;<\/td>\n<\/tr>\n
              33<\/td>\nfor e = 1:k<\/td>\n<\/tr>\n
              34<\/td>\n\u00a0\u00a0\u00a0 CC(e,:) = PM(e,:);<\/td>\n<\/tr>\n
              35<\/td>\nend<\/td>\n<\/tr>\n
              36<\/td>\n <\/td>\n<\/tr>\n
              37<\/td>\nwhile 1<\/td>\n<\/tr>\n
              38<\/td>\n\u00a0\u00a0\u00a0 change = 0;%(Used to mark whether the classification results have changed or not)<\/td>\n<\/tr>\n
              39<\/td>\n\u00a0\u00a0\u00a0 % (For each sample e, the distance to k cluster centers is calculated)<\/td>\n<\/tr>\n
              40<\/td>\n\u00a0\u00a0\u00a0 for e = 1:N<\/td>\n<\/tr>\n
              41<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 for \u03bc = 1:k<\/td>\n<\/tr>\n
              42<\/td>\n%\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 D(e,\u03bc) = eulerDis( PM(e,:), CC(\u03bc,:) );<\/td>\n<\/tr>\n
              43<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 D(e,\u03bc) = sqrt((PM(e,1) – CC(\u03bc,1))^2 + (PM(e,2) – CC(\u03bc,2))^2);<\/td>\n<\/tr>\n
              44<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 end<\/td>\n<\/tr>\n
              45<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 t = find( D(e,:) == min(D(e,:)) ); %(e belongs to class t)<\/td>\n<\/tr>\n
              46<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if B(e) ~= t % (The last iteration e did not belong to class t)<\/td>\n<\/tr>\n
              47<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 change = 1;<\/td>\n<\/tr>\n
              48<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 % (Remove e from category B(e))<\/td>\n<\/tr>\n
              49<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 t1 = C{B(e)};<\/td>\n<\/tr>\n
              50<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 t2 = find( t1==e );<\/td>\n<\/tr>\n
              51<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 t1(t2) = t1(1);<\/td>\n<\/tr>\n
              52<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 t1 = t1(2:length(t1));<\/td>\n<\/tr>\n
              53<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 C{B(e)} = t1;<\/td>\n<\/tr>\n
              54<\/td>\n <\/td>\n<\/tr>\n
              55<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 C{t} = [C{t},e]; % (Add e to class t)<\/td>\n<\/tr>\n
              56<\/td>\n <\/td>\n<\/tr>\n
              57<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 B(e) = t;<\/td>\n<\/tr>\n
              58<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 end<\/td>\n<\/tr>\n
              60<\/td>\n\u00a0\u00a0\u00a0 end<\/td>\n<\/tr>\n
              61<\/td>\n <\/td>\n<\/tr>\n
              62<\/td>\n\u00a0\u00a0\u00a0 if change == 0 %(If the classification result does not change, the iteration stops)<\/td>\n<\/tr>\n
              63<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 break;<\/td>\n<\/tr>\n
              64<\/td>\n\u00a0\u00a0\u00a0 end<\/td>\n<\/tr>\n
              65<\/td>\n <\/td>\n<\/tr>\n
              66<\/td>\n\u00a0\u00a0\u00a0 % (Recalculate the cluster center matrix CC)<\/td>\n<\/tr>\n
              67<\/td>\n\u00a0\u00a0\u00a0 for e = 1:k<\/td>\n<\/tr>\n
              68<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 CC(e,:) = 0;<\/td>\n<\/tr>\n
              69<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 iclu = C{e};<\/td>\n<\/tr>\n
              70<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 for \u03bc = 1:length(iclu)<\/td>\n<\/tr>\n
              71<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 CC(e,:) = PM( iclu(\u03bc),: )+CC(e,:);<\/td>\n<\/tr>\n
              72<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 end<\/td>\n<\/tr>\n
              73<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 CC(e,:) = CC(e,:)\/length(iclu);<\/td>\n<\/tr>\n
              74<\/td>\n\u00a0\u00a0\u00a0 end<\/td>\n<\/tr>\n
              75<\/td>\nend<\/td>\n<\/tr>\n
              76<\/td>\n………………………..(if n>2)<\/td>\n<\/tr>\n
              77<\/td>\nsubplot(1,n,n);<\/td>\n<\/tr>\n
              78<\/td>\nplot(CC(:,1),CC(:,n),’o’)<\/td>\n<\/tr>\n
              79<\/td>\nhold on<\/td>\n<\/tr>\n
              80<\/td>\nfor(e=1:N)<\/td>\n<\/tr>\n
              81<\/td>\n\u00a0\u00a0\u00a0 if(B(1,e)==1)<\/td>\n<\/tr>\n
              82<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 plot(PM(e,1),PM(e,n),’*b’); %(Make a graph of class 1 points)<\/td>\n<\/tr>\n
              83<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 hold on<\/td>\n<\/tr>\n
              84<\/td>\n\u00a0\u00a0\u00a0 elseif(B(1,e)==2)<\/td>\n<\/tr>\n
              85<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 plot(PM(e,1),PM(e,n), ‘*r’); %(Make a graph of class 2 points)<\/td>\n<\/tr>\n
              86<\/td>\n\u00a0\u00a0\u00a0\u00a0 hold on<\/td>\n<\/tr>\n
              87<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 ……..\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 %……………<\/td>\n<\/tr>\n
              88<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 ……..\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 %……………<\/td>\n<\/tr>\n
              89<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 ……..\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 %(Make a graph of class m-1 points)<\/td>\n<\/tr>\n
              90<\/td>\n\u00a0\u00a0\u00a0 else<\/td>\n<\/tr>\n
              91<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 plot(PM(e,1),PM(e,n), ‘*m’); %(Make a graph of class m points)<\/td>\n<\/tr>\n
              92<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 hold on<\/td>\n<\/tr>\n
              93<\/td>\n\u00a0\u00a0\u00a0 end<\/td>\n<\/tr>\n
              94<\/td>\nend<\/td>\n<\/tr>\n
              95<\/td>\nxlabel(‘X’);<\/td>\n<\/tr>\n
              96<\/td>\nylabel(‘Y’);<\/td>\n<\/tr>\n
              97<\/td>\ntitle(‘Data points after clustering’);<\/td>\n<\/tr>\n
              98<\/td>\n <\/td>\n<\/tr>\n
              99<\/td>\nfor e = 1:k\u00a0\u00a0\u00a0 %(Output sample point labels for each class)<\/td>\n<\/tr>\n
              100<\/td>\n\u00a0\u00a0\u00a0 str=[‘the ‘num2str(e)’ class contains points: ‘num2str(C{e})“];<\/td>\n<\/tr>\n
              101<\/td>\n\u00a0\u00a0\u00a0 disp(str);<\/td>\n<\/tr>\n
              102<\/td>\nend<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
              2.2. Step 2 \u2013 TOPSIS method<\/strong><\/p>\n
              This step further screens the product types selected in the first step based on the actual production conditions and capabilities of the enterprise, such as production technology, production techniques, production costs and profits, production capacity and production cycle, etc., and finally selects the products that are truly suitable for the enterprise’s own production. Here, the TOPSIS method is used for secondary screening. TOPSIS (Technique for Order Preference by Similarity to Ideal Solution) is a multi-attribute decision-making method that determines the optimal sorting order by comparing the distance between candidate solutions and ideal solutions (Dayi et al., 2024). A positive ideal solution is the solution that reaches the best value on each attribute, while a negative ideal solution is the solution that reaches the worst value on each attribute. At the same time, in order to determine the distance between the candidate solution and the ideal solution, the Euclidean distance between each candidate solution and the ideal solution is first calculated (Masudin et al., 2024). Then, calculate the positive and negative standardized distances between the candidate solution and the ideal solution. The positive standardized distance reflects the closeness between the candidate solution and the positive ideal solution, while the negative standardized distance reflects the closeness between the candidate solution and the negative ideal solution (Akshya et al., 2024).<\/p>\n
              The optimal sorting order is the order in which the candidate solution has the shortest distance from the positive ideal solution and the farthest distance from the negative ideal solution. The closer the candidate solution is to the positive ideal solution, the higher its score, and the closer it is to the negative ideal solution, the lower its score (Razdan et al., 2024). This can help decision-makers determine the best alternative solution to achieve the goal of multi-attribute decision-making.<\/p>\n
              Figure 6 are the basic steps for screening and sorting using TOPSIS method:<\/p>\n
              \"\"<\/p>\n
              Figure <\/strong>6<\/strong>. <\/strong>The basic steps for sorting and screening of TOPSIS method<\/pre>\n
              Step 1: <\/strong>Forward and standardization processing.<\/p>\n
              Through the screening in step 1 (Kumar & Gupta, 2024), assuming there are m evaluation objects (products) selected out by step 1, each evaluation object (product) with n evaluation indicators (production technology, production techniques, production costs and profits, production capacity and production cycle), the original matrix y obtained by comprehensive evaluation is:<\/p>\n
              \"\"<\/p>\n
              (5)<\/p>\n
              1) Forward processing:<\/strong><\/p>\n
              The positive transformation of indicators means that all indicators are transformed into extremely large indicators, that is, the larger the value, the better. In this way, the calculation and code can be more unified and concise (Zournatzidou, 2024).<\/p>\n
              The types of indicators are: extremely large indicators, extremely small indicators, intermediate indicators, and interval indicators. The conversion method is as follows:<\/p>\n
                \n
              • Extremely small indicators \u2192 extremely large indicators.<\/li>\n<\/ul>\n
                \"\"<\/p>\n
                If all elements are positive, you can also directly take the reciprocal:<\/p>\n
                \"\"<\/p>\n
                (7)<\/p>\n
                  \n
                • Intermediate indicators \u2192 extremely large indicators.<\/li>\n<\/ul>\n
                  \"\"<\/p>\n
                  (8)<\/p>\n
                  Where ybest<\/sub> is the optimal value for this indicator.<\/p>\n
                    \n
                  • Interval indicators \u2192 extremely large indicators.<\/li>\n<\/ul>\n
                    \"\"<\/p>\n
                    Among them, a and b are the upper and lower limits of the optimal range of the indicator.<\/p>\n
                    2) Standardization processing<\/strong><\/p>\n
                    Standardization is carried out to balance the differences or dimensional errors between indicators. There are two methods that can be used (note that if standardization is also performed during forward processing, there is no need for further standardization):<\/p>\n
                      \n
                    • Z score standardization<\/li>\n<\/ul>\n
                      \"\"<\/p>\n
                      (10)<\/p>\n
                        \n
                      • Map minmax standardization<\/li>\n<\/ul>\n
                        \"\"<\/p>\n
                        (11)<\/p>\n
                        The normalized matrix Z is obtained after the forward and standardization processing:<\/p>\n
                        \"\"<\/p>\n
                        (12)<\/p>\n
                        Step 2: <\/strong>Calculate the weighted norm matrix.<\/p>\n
                        The weight W here can be determined by other methods, such as entropy weight method, etc.<\/p>\n
                        \"\"<\/p>\n
                        (13)<\/p>\n
                        Step 3: <\/strong>Compute positive and negative ideal solutions.<\/p>\n
                          \n
                        • Positive ideal solutions:<\/li>\n<\/ul>\n
                          \"\"<\/p>\n
                          (14)<\/p>\n
                            \n
                          • Negative ideal solutions<\/li>\n<\/ul>\n
                            \"\"<\/p>\n
                            (15)<\/p>\n
                            Step 4: <\/strong>Calculate distances to positive and negative ideal solutions.<\/p>\n
                            Calculate the Euclidean distance between the target value and the positive or negative ideal solution (Huang et al., 2024).<\/p>\n
                              \n
                            • The distance from the target to the positive ideal solution is:<\/li>\n<\/ul>\n
                              \"\"<\/p>\n
                              (16)<\/p>\n
                                \n
                              • The distance from the target to the negative ideal solution is:<\/li>\n<\/ul>\n
                                \"\"<\/p>\n
                                (17)<\/p>\n
                                Step 5: <\/strong>Calculate the closeness to the ideal solution<\/p>\n
                                \"\"<\/p>\n
                                (18)<\/p>\n
                                Where 0 \u2264 S <\/sub>\u2264 1, when S<\/sub>=0, it indicates that the target is the worst target; When S<\/sub>=1, it indicates that the target is the optimal target. In practical multi-objective decision-making, the possibility of the existence of the optimal and worst targets is very small.<\/p>\n
                                Step 6: <\/strong>Sort the advantages and disadvantages of the targets.<\/p>\n
                                According to the value of Si, the evaluation targets are arranged in ascending order. The larger the S<\/sub> value, the better the target.<\/p>\n
                                MATLAB run instructions are as follows:<\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
                                1<\/td>\nclc;clear;<\/td>\n<\/tr>\n
                                2<\/td>\n% y = [y11<\/sub>\u2026\u2026.y1n<\/sub><\/td>\n<\/tr>\n
                                3<\/td>\n%\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 y21<\/sub>\u2026\u2026.y2n<\/sub><\/td>\n<\/tr>\n
                                4<\/td>\n%\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u2026\u2026.<\/td>\n<\/tr>\n
                                5<\/td>\n%\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 y(m-1)1<\/sub>\u2026\u2026..y(m-1)n<\/sub><\/td>\n<\/tr>\n
                                6<\/td>\n%\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 ym1<\/sub>\u2026\u2026..ymn<\/sub> ];<\/td>\n<\/tr>\n
                                7<\/td>\n%<\/td>\n<\/tr>\n
                                8<\/td>\n% w = [\u2026 \u2026 \u2026 \u2026 \u2026]; %\u201cw=Index weight\u201d<\/td>\n<\/tr>\n
                                9<\/td>\ny = [ .. .<\/td>\n<\/tr>\n
                                10<\/td>\n\u00a0\u00a0\u00a0 .. .<\/td>\n<\/tr>\n
                                11<\/td>\n\u00a0\u00a0\u00a0\u00a0 .. .<\/td>\n<\/tr>\n
                                12<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 .. .];<\/td>\n<\/tr>\n
                                13<\/td>\n <\/td>\n<\/tr>\n
                                14<\/td>\n%Step1(Data preprocessing – indicator forward)<\/td>\n<\/tr>\n
                                15<\/td>\n[n,m] = size(y);<\/td>\n<\/tr>\n
                                16<\/td>\ndisp([‘ ‘num2str (n)’ evaluation objects and ‘num2str (m)’ evaluation indicators ‘]);<\/td>\n<\/tr>\n
                                17<\/td>\nJudge = input([‘ ‘num2str (m)’ indicators need forward processing? Yes, please enter 1. No, enter 0:’]);<\/td>\n<\/tr>\n
                                18<\/td>\n <\/td>\n<\/tr>\n
                                19<\/td>\nif Judge == 1<\/td>\n<\/tr>\n
                                20<\/td>\n\u00a0 indicator _label = input([‘ enter the value of each indicator type,such as:extremely large indicators 1\/2, extremely small indicators\u2026, intermediate indicators\u2026, and interval indicators\u2026 ‘]);<\/td>\n<\/tr>\n
                                21<\/td>\n <\/td>\n<\/tr>\n
                                22<\/td>\n\u00a0\u00a0\u00a0 y = preprocess(y,indicator _label);<\/td>\n<\/tr>\n
                                23<\/td>\nend<\/td>\n<\/tr>\n
                                24<\/td>\n <\/td>\n<\/tr>\n
                                25<\/td>\ndisp(‘ The matrix after forward processing y =’);<\/td>\n<\/tr>\n
                                26<\/td>\ndisp(y);<\/td>\n<\/tr>\n
                                27<\/td>\n <\/td>\n<\/tr>\n
                                28<\/td>\n <\/td>\n<\/tr>\n
                                29<\/td>\n%Step1(Data preprocessing – indicator standardization)<\/td>\n<\/tr>\n
                                30<\/td>\nZ = y.\/repmat(sum(y.*y).^0.5,n,1);<\/td>\n<\/tr>\n
                                31<\/td>\ndisp(‘ The matrix after standardization processing Z =’);<\/td>\n<\/tr>\n
                                32<\/td>\ndisp(Z);<\/td>\n<\/tr>\n
                                33<\/td>\n <\/td>\n<\/tr>\n
                                34<\/td>\n%Step2<\/td>\n<\/tr>\n
                                35<\/td>\ndisp(„Quantity of indicators=Quantity of weights (weight sum is 1)“);<\/td>\n<\/tr>\n
                                36<\/td>\nw = input([‘ Please enter ‘ num2str(m) ‘ weights: ‘]);<\/td>\n<\/tr>\n
                                37<\/td>\nif abs(sum(w)-1)<0.000001 && size(w,1) ==1 && size(w,2) == m<\/td>\n<\/tr>\n
                                38<\/td>\nelse<\/td>\n<\/tr>\n
                                39<\/td>\n\u00a0\u00a0\u00a0 w = input(‘ If input is incorrect, re-enter the weight row vector:’);<\/td>\n<\/tr>\n
                                40<\/td>\nend<\/td>\n<\/tr>\n
                                41<\/td>\n <\/td>\n<\/tr>\n
                                42<\/td>\n%Step3<\/td>\n<\/tr>\n
                                43<\/td>\n%Step4<\/td>\n<\/tr>\n
                                44<\/td>\nD_P = sum(w.*(Z-repmat(max(Z),n,1)).^2,2).^0.5;<\/td>\n<\/tr>\n
                                45<\/td>\nD_N = sum(w.*(Z-repmat(min(Z),n,1)).^2,2).^0.5;<\/td>\n<\/tr>\n
                                46<\/td>\n% D_P = sum(((Z – repmat(max(Z),n,1)) .^ 2 ) .* repmat(w,n,1) ,2) .^ 0.5;<\/td>\n<\/tr>\n
                                47<\/td>\n% D_N = sum(((Z – repmat(min(Z),n,1)) .^ 2 ) .* repmat(w,n,1) ,2) .^ 0.5;<\/td>\n<\/tr>\n
                                48<\/td>\n <\/td>\n<\/tr>\n
                                49<\/td>\n%Step5<\/td>\n<\/tr>\n
                                50<\/td>\nS = D_P.\/(D_P+D_N);<\/td>\n<\/tr>\n
                                51<\/td>\n <\/td>\n<\/tr>\n
                                52<\/td>\n%Step6<\/td>\n<\/tr>\n
                                53<\/td>\ndisp(„The final normalized score and ranking\uff1a“);<\/td>\n<\/tr>\n
                                54<\/td>\nstd_S = S.\/sum(S); % \u201cthe final normalized score\u201d<\/td>\n<\/tr>\n
                                55<\/td>\n[sorted_S,index] = sort(std_S,’descend’)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
                                2.3. Step 3 – Dynamic programming<\/strong><\/p>\n
                                Dynamic programming is a mathematical method used to solve decision problems with recursive structures, especially those involving sequential decision-making (Barbato et al., 2024). Implementing dynamic programming in MATLAB can be accomplished by defining state variables, decision variables, state transition equations, and objective functions. The following is a specific case analysis. Optimizing project resource allocation for manufacturing enterprises is a very important step.<\/p>\n
                                Assuming that the enterprise runs several target projects selected in the first two steps simultaneously, each project needs to allocate a certain amount of resources, such as funds, personnel, etc., to complete the project (Forghieri et al., 2024). The company’s goal is to maximize the total profit of all projects, and the profit of each project has a non-linear relationship with the amount of resources invested. Resources are limited, therefore dynamic programming is needed to optimize resource allocation. The entire process is shown in Figure 7.<\/p>\n
                                \"\"<\/p>\n
                                Figure <\/strong>7<\/strong>. <\/strong>Dynamic programming flow chart<\/pre>\n
                                Step 1: <\/strong>Define state and decision variables<\/p>\n
                                  \n
                                • State variable: x (i, j) represents that when processing the i-th project, there are still j units of resources left.<\/li>\n
                                • Decision variable: y (i, j) represents the result of allocating j units of resources to the i-th project.<\/li>\n<\/ul>\n
                                  Step 2:<\/strong> Objective Function and State Transition<\/p>\n
                                    \n
                                  • Objective function: Maximize total profit.<\/li>\n
                                  • State transition equation:<\/li>\n<\/ul>\n
                                    \"\"<\/p>\n
                                    (19)<\/p>\n
                                    Indicate the remaining resources after allocating resources to the i-th project.<\/p>\n
                                    Step 3: <\/strong>Recursive Solution of Dynamic Programming<\/p>\n
                                    Recursive formula:<\/p>\n
                                    \"\"<\/p>\n
                                    (20)<\/p>\n
                                    Here, profit (i, t) is the profit obtained from allocating t units of resources to the i-th project.<\/p>\n
                                    Step 4: <\/strong>Boundary conditions<\/p>\n
                                    When there are no resources or projects,the profit is 0 : Z (0, j)=0 and Z (i, 0)=0.<\/p>\n
                                    Step 5: <\/strong>Implement the code<\/p>\n
                                    MATLAB run instructions are as follows:<\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
                                    1<\/td>\nfunction total_profit = resourceAllocationDP(total_resources, profits)<\/td>\n<\/tr>\n
                                    2<\/td>\n\u00a0\u00a0\u00a0 n = size(profits, 1);<\/td>\n<\/tr>\n
                                    3<\/td>\n\u00a0\u00a0\u00a0 Z = zeros(n + 1, total_resources + 1);\u00a0 % Initialize DP table%<\/td>\n<\/tr>\n
                                    4<\/td>\n <\/td>\n<\/tr>\n
                                    5<\/td>\n\u00a0\u00a0\u00a0 %Fill in DP table%<\/td>\n<\/tr>\n
                                    6<\/td>\n\u00a0for i = 1:n<\/td>\n<\/tr>\n
                                    7<\/td>\n\u00a0 for j = 0:total_resources<\/td>\n<\/tr>\n
                                    8<\/td>\n\u00a0\u00a0\u00a0 for t = 0:j<\/td>\n<\/tr>\n
                                    9<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0 Z(i + 1, j + 1) = max(Z(i + 1, j + 1), Z(i, j – t + 1) + profits(i, t + 1));<\/td>\n<\/tr>\n
                                    10<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 end<\/td>\n<\/tr>\n
                                    11<\/td>\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 end<\/td>\n<\/tr>\n
                                    12<\/td>\n\u00a0\u00a0\u00a0 end<\/td>\n<\/tr>\n
                                    13<\/td>\n <\/td>\n<\/tr>\n
                                    14<\/td>\n\u00a0\u00a0\u00a0 total_profit = Z(n + 1, total_resources + 1);<\/td>\n<\/tr>\n
                                    15<\/td>\nend<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
                                    Through the above calculation process, the limited resources owned by the enterprise are rationally allocated, and the manufacturing enterprise finally obtains the maximum total profit of all projects. This simple and clear process can better help the enterprise to make decisions, avoid the influence of human subjective factors, and achieve objective output results.<\/p>\n
                                    The advantage of this screening system is that it uses existing software to calculate the combination of mathematical models and can select target investment projects that are suitable for the production conditions of the manufacturing enterprise from the numerous projects on the market, while optimizing the allocation of project resources and ultimately obtaining the maximum return on investment. The system has the characteristics of pertinence, low cost, simple operation and obvious effect, helping enterprises expand their markets and better adapt to the fiercely competitive market and changing environment.<\/p>\n
                                    Conclusions<\/strong><\/p>\n
                                    The combination of K-means clustering analysis, TOPSIS method, and dynamic programming model can effectively solve the problems of inaccurate investment, unreasonable allocation of limited resources, and inability to obtain maximum profit from limited resource investment in the process of selecting production investment projects and allocating limited resources for manufacturing enterprises.<\/p>\n
                                    This combination model combines the ability to screen investment projects and optimize limited resource allocation, while also having good profitability. There have been significant improvements and innovations in precision and reliability, which can help manufacturing companies achieve maximum return on investment and the ability to strategically expand their markets. Improve investment decision-making ability, achieve precise and controllable investment, truly combine the limited resources of the enterprise’s own production capacity to obtain maximum returns, and make full use of everything.<\/p>\n
                                    However, the combination model also has certain limitations due to the model itself or the connections between models, which are inevitable. For example: the K-means clustering analysis model itself has a significant impact on the selection of initial cluster centers on the final results and can only discover spherical clusters, cannot handle non spherical clusters and is sensitive to outliers.<\/p>\n
                                    So, there is no best model, only better models. At present, the development of the manufacturing industry is still plagued by various technological applications and popularization.<\/p>\n
                                    However, in the future, with the mature combination and popularization of artificial intelligence technology, the Internet of Things big data and cloud computing, the manufacturing industry will have stronger decision-making, management, scheduling, and profitability capabilities. In the future, our focus will be on the application of high-tech technologies such as artificial intelligence and big data in screening and decision-making systems. However, as the development and maturity of these technologies have not yet reached universality, this is a long process that will be an important challenge for future work.<\/p>\n
                                     <\/p>\n
                                    REFERENCES<\/strong><\/p>\n
                                    Agbulu, G. P., Kumar, G. J. R., & Gunasekar, S. (2024). IESDCC\u2011KM: an improved energy-saving distributed cluster\u2013chain K\u2011communication scheme for smart sensor networks. International Journal of System Assurance Engineering and Management,<\/em> 15<\/em>(9), 4443 \u2013 4455. https:\/\/doi.org\/10.1007\/s13198-024-02456-y.<\/p>\n
                                    Akshya, K. S., Priyadarsan, P., Muralibabu, K. (2023). Hybrid deep neural network with clustering algorithms for effective gliomas segmentation. International Journal of System Assurance Engineering and Management,<\/em> 15<\/em>(3), 964 \u2013 980. https:\/\/doi.org\/10.1007\/s13198-023-02183-w.<\/p>\n
                                    Al-Ali, A. S., Haris, R. M., Akbari, Y., Saleh, M., Al-Maadeed, S., Kumar, M. R. (2024). Integrating binary classification and clustering for multi-class dysarthria severity level classification: a two-stage approach. Cluster Computing, 28<\/em>, 136. https:\/\/doi.org\/10.1007\/s10586-024-04748-1.<\/p>\n
                                    Barbato, M., Ceselli, A., Righini, G. (2024). A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses. Journal of Scheduling<\/em>, 27<\/em>, 393 \u2013 407. https:\/\/doi.org\/10.1007\/s10951-024-00811-2.<\/p>\n
                                    Dayi, F., Cilesiz, A., Yucel, M. (2024). Strategic Management of Clean Energy Investments: Financial Performance Insights by Using BWM-based VIKOR and TOPSIS Methods. International Journal of Energy Economics and Policy<\/em>, 14<\/em>(5), 566 \u2013 574. https:\/\/doi.org\/10.32479\/ijeep.16705.<\/p>\n
                                    Forghieri, O., Castel, H., Hyon, E., & Pennec, E. L. (2024). Progressive State Space Disaggregation for Infinite Horizon Dynamic Programming. Proceedings of the International Conference on Automated Planning and Scheduling, 34<\/em>(1), 221 \u2013 229. https:\/\/doi.org\/10.1609\/icaps.v34i1.31479.<\/p>\n
                                    He, T., Wei, S. (2024). Hybrid Teaching Platform Design for Ideological and Political Courses Based on K-Means Clustering. In Z. Hou (Ed.). Intelligent Computing Technology and Automation <\/em>(pp. 660 \u2013 668). https:\/\/doi.org\/10.3233\/ATDE231242.<\/p>\n
                                    Huang, S., Cheng, H., Luo, M. (2024). Comparative Study on Barriers of Supply Chain Management MOOCs in China: Online Review Analysis with a Novel TOPSIS-CoCoSo Approach. Journal of Theoretical and Applied Electronic Commerce Research<\/em>, 19<\/em>(3), 1793 \u2013 1811. https:\/\/doi.org\/10.3390\/jtaer19030088.<\/p>\n
                                    Kumar, M., Gupta, S. K., (2024). Developing a TOPSIS algorithm for Q-rung orthopair Z-numbers with applications in decision making. International Journal of System Assurance Engineering and Management,<\/em> 15<\/em>(7), 3117 \u2013 3135. https:\/\/doi.org\/10.1007\/s13198-024-02319-6.<\/p>\n
                                    Liu, Y., Zhang, Z., Jiang, S., Ding, Y. (2023). Application of Big Data Technology Combined with Clustering Algorithm in Manufacturing Production Analysis System. Decision Making: Applications in Management and Engineering<\/em>, 7<\/em>(1), 237 \u2013 253. https:\/\/doi.org\/10.31181\/dmame712024897<\/p>\n
                                    Masudin, I., Habibah, I. Z., Wardana, R. W., Restuputri, D. P., Shariff, S. R. (2024). Enhancing Supplier Selection for Sustainable Raw Materials: A Comprehensive Analysis Using Analytical Network Process (ANP) and TOPSIS Methods. Logistics<\/em>, 8<\/em>(3), 74. https:\/\/doi.org\/10.3390\/logistics8030074.<\/p>\n
                                    Matlis, G., Dimokas, N., Karvelis, P. (2024). Unveiling University Groupings: A Clustering Analysis for Academic Rankings. Data<\/em>, 9<\/em>(5), 67. https:\/\/doi.org\/10.3390\/data9050067.<\/p>\n
                                    Razdan, M. R., Aghasi, S., Davoodi, S. M. R. (2024). Ranking Factors Affecting Supply Chain Risk with a Combined Approach of Neutrosophic Analytical Hierarchy Process and TOPSIS. Journal of Applied Research on Industrial Engineering, 11<\/em>(3), 423 \u2013 435. https:\/\/doi.org\/10.22105\/jarie.2021.303869.1379.<\/p>\n
                                    Zhu, Y. (2024). Behavior Analysis of Learner Based on Big Data and Improved K-Means Algorithm. In Z. Hou (Ed.). Intelligent Computing Technology and Automation<\/em> (pp. 539 – 547) DOI: 10.3233\/ATDE231228<\/p>\n
                                    Zournatzidou, G. (2024). Evaluating Executives and Non-Executives Impact toward ESG Performance in Banking Sector: An Entropy Weight and TOPSIS Method. Administrative Sciences,<\/em> 14<\/em>(10), 255. https:\/\/doi.org\/10.3390\/admsci14100255.<\/p>","protected":false},"excerpt":{"rendered":"
                                    Bao Gang ORCID iD:0009-0008-5357-9198 University of Ruse \u201cAngel Kanchev\u201d, Bulgaria Pavel Vitliemov ORCID iD:0000-0002-1747-7994 Web of Science Researcher ID: H-5795-2018 University of Ruse \u201cAngel Kanchev\u201d, Bulgaria https:\/\/doi.org\/10.53656\/adpe-2025.18 PDF Pages 197-216 Abstract. The market is developing rapidly, and the choice of production investment projects presents diversity and complexity. Manufacturing enterprises not only need to select high-profit […]<\/p>","protected":false},"author":124332423427287,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jnews-multi-image_gallery":[],"jnews_single_post":[],"jnews_primary_category":[]},"categories":[11767],"tags":[11794,11792,11796,11791,11795,11793],"yoast_head":"\nHow to select projects and allocate funds to obtain the total maximum profit for facing many different investment projects in the production strategy management plan of discrete production enterprise - \u0410\u0437-\u0431\u0443\u043a\u0438<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/azbuki.bg\/en\/international-scientific-and-technical-conference-automation-of-discrete-production-engineering-2025\/how-to-select-projects-and-allocate-funds-to-obtain-the-total-maximum-profit-for-facing-many-different-investment-projects-in-the-production-strategy-management-plan-of-discrete-production-enterprise\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"How to select projects and allocate funds to obtain the total maximum profit for facing many different investment projects in the production strategy management plan of discrete production enterprise - \u0410\u0437-\u0431\u0443\u043a\u0438\" \/>\n<meta property=\"og:description\" content=\"Bao Gang ORCID iD:0009-0008-5357-9198 University of Ruse \u201cAngel Kanchev\u201d, Bulgaria Pavel Vitliemov ORCID iD:0000-0002-1747-7994 Web of Science Researcher ID: H-5795-2018 University of Ruse \u201cAngel Kanchev\u201d, Bulgaria https:\/\/doi.org\/10.53656\/adpe-2025.18 PDF Pages 197-216 Abstract. The market is developing rapidly, and the choice of production investment projects presents diversity and complexity. Manufacturing enterprises not only need to select high-profit […]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/azbuki.bg\/en\/international-scientific-and-technical-conference-automation-of-discrete-production-engineering-2025\/how-to-select-projects-and-allocate-funds-to-obtain-the-total-maximum-profit-for-facing-many-different-investment-projects-in-the-production-strategy-management-plan-of-discrete-production-enterprise\/\" \/>\n<meta property=\"og:site_name\" content=\"\u0410\u0437-\u0431\u0443\u043a\u0438\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/Azbuki55\/\" \/>\n<meta property=\"article:published_time\" content=\"2025-05-30T12:21:27+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/azbuki.bg\/wp-content\/uploads\/2025\/03\/pdf-icon.jpg\" \/>\n<meta name=\"author\" content=\"\u201e\u0410\u0437-\u0431\u0443\u043a\u0438\u201c\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"\u201e\u0410\u0437-\u0431\u0443\u043a\u0438\u201c\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"28 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/azbuki.bg\/en\/international-scientific-and-technical-conference-automation-of-discrete-production-engineering-2025\/how-to-select-projects-and-allocate-funds-to-obtain-the-total-maximum-profit-for-facing-many-different-investment-projects-in-the-production-strategy-management-plan-of-discrete-production-enterprise\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/azbuki.bg\/en\/international-scientific-and-technical-conference-automation-of-discrete-production-engineering-2025\/how-to-select-projects-and-allocate-funds-to-obtain-the-total-maximum-profit-for-facing-many-different-investment-projects-in-the-production-strategy-management-plan-of-discrete-production-enterprise\/\"},\"author\":{\"name\":\"\u201e\u0410\u0437-\u0431\u0443\u043a\u0438\u201c\",\"@id\":\"https:\/\/azbuki.bg\/en\/#\/schema\/person\/de220d282eaa494f914ce0fd838645dd\"},\"headline\":\"How to select projects and allocate funds to obtain the total maximum profit for facing many different investment projects in the production strategy management plan of discrete production enterprise\",\"datePublished\":\"2025-05-30T12:21:27+00:00\",\"dateModified\":\"2025-05-30T12:21:27+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/azbuki.bg\/en\/international-scientific-and-technical-conference-automation-of-discrete-production-engineering-2025\/how-to-select-projects-and-allocate-funds-to-obtain-the-total-maximum-profit-for-facing-many-different-investment-projects-in-the-production-strategy-management-plan-of-discrete-production-enterprise\/\"},\"wordCount\":4790,\"publisher\":{\"@id\":\"https:\/\/azbuki.bg\/en\/#organization\"},\"keywords\":[\"dynamic programming\",\"K-means clustering analysis\",\"maximum return on investment\",\"production investment\",\"screening and allocation\",\"TOPSIS method\"],\"articleSection\":[\"International Scientific and Technical Conference Automation of Discrete Production Engineering 2025\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/azbuki.bg\/en\/international-scientific-and-technical-conference-automation-of-discrete-production-engineering-2025\/how-to-select-projects-and-allocate-funds-to-obtain-the-total-maximum-profit-for-facing-many-different-investment-projects-in-the-production-strategy-management-plan-of-discrete-production-enterprise\/\",\"url\":\"https:\/\/azbuki.bg\/en\/international-scientific-and-technical-conference-automation-of-discrete-production-engineering-2025\/how-to-select-projects-and-allocate-funds-to-obtain-the-total-maximum-profit-for-facing-many-different-investment-projects-in-the-production-strategy-management-plan-of-discrete-production-enterprise\/\",\"name\":\"How to select projects and allocate funds to obtain the total maximum profit for facing many different investment projects in the production strategy management plan of discrete production enterprise - \u0410\u0437-\u0431\u0443\u043a\u0438\",\"isPartOf\":{\"@id\":\"https:\/\/azbuki.bg\/en\/#website\"},\"datePublished\":\"2025-05-30T12:21:27+00:00\",\"dateModified\":\"2025-05-30T12:21:27+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/azbuki.bg\/en\/international-scientific-and-technical-conference-automation-of-discrete-production-engineering-2025\/how-to-select-projects-and-allocate-funds-to-obtain-the-total-maximum-profit-for-facing-many-different-investment-projects-in-the-production-strategy-management-plan-of-discrete-production-enterprise\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/azbuki.bg\/en\/international-scientific-and-technical-conference-automation-of-discrete-production-engineering-2025\/how-to-select-projects-and-allocate-funds-to-obtain-the-total-maximum-profit-for-facing-many-different-investment-projects-in-the-production-strategy-management-plan-of-discrete-production-enterprise\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/azbuki.bg\/en\/international-scientific-and-technical-conference-automation-of-discrete-production-engineering-2025\/how-to-select-projects-and-allocate-funds-to-obtain-the-total-maximum-profit-for-facing-many-different-investment-projects-in-the-production-strategy-management-plan-of-discrete-production-enterprise\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/history.azbuki.bg\/en\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"How to select projects and allocate funds to obtain the total maximum profit for facing many different investment projects in the production strategy management plan of discrete production enterprise\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/azbuki.bg\/en\/#website\",\"url\":\"https:\/\/azbuki.bg\/en\/\",\"name\":\"\u0410\u0437-\u0431\u0443\u043a\u0438\",\"description\":\"\u041d\u0430\u0446\u0438\u043e\u043d\u0430\u043b\u043d\u043e \u0438\u0437\u0434\u0430\u0442\u0435\u043b\u0441\u0442\u0432\u043e \u0437\u0430 \u043e\u0431\u0440\u0430\u0437\u043e\u0432\u0430\u043d\u0438\u0435 \u0438 \u043d\u0430\u0443\u043a\u0430\",\"publisher\":{\"@id\":\"https:\/\/azbuki.bg\/en\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/azbuki.bg\/en\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/azbuki.bg\/en\/#organization\",\"name\":\"\u0410\u0437-\u0431\u0443\u043a\u0438\",\"url\":\"https:\/\/azbuki.bg\/en\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/azbuki.bg\/en\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/azbuki.bg\/wp-content\/uploads\/2019\/04\/logo-azbuki-e1580374651845.png\",\"contentUrl\":\"https:\/\/azbuki.bg\/wp-content\/uploads\/2019\/04\/logo-azbuki-e1580374651845.png\",\"width\":250,\"height\":70,\"caption\":\"\u0410\u0437-\u0431\u0443\u043a\u0438\"},\"image\":{\"@id\":\"https:\/\/azbuki.bg\/en\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/www.facebook.com\/Azbuki55\/\",\"https:\/\/www.instagram.com\/nion_azbuki\/\"]},{\"@type\":\"Person\",\"@id\":\"https:\/\/azbuki.bg\/en\/#\/schema\/person\/de220d282eaa494f914ce0fd838645dd\",\"name\":\"\u201e\u0410\u0437-\u0431\u0443\u043a\u0438\u201c\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/azbuki.bg\/en\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/d08ccbd951212deb604aa2d403575d4e?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/d08ccbd951212deb604aa2d403575d4e?s=96&d=mm&r=g\",\"caption\":\"\u201e\u0410\u0437-\u0431\u0443\u043a\u0438\u201c\"},\"sameAs\":[\"https:\/\/azbuki.bg\/\"],\"url\":\"https:\/\/bel.azbuki.bg\/en\/author\/azbuki_ekip\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"How to select projects and allocate funds to obtain the total maximum profit for facing many different investment projects in the production strategy management plan of discrete production enterprise - \u0410\u0437-\u0431\u0443\u043a\u0438","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/azbuki.bg\/en\/international-scientific-and-technical-conference-automation-of-discrete-production-engineering-2025\/how-to-select-projects-and-allocate-funds-to-obtain-the-total-maximum-profit-for-facing-many-different-investment-projects-in-the-production-strategy-management-plan-of-discrete-production-enterprise\/","og_locale":"en_US","og_type":"article","og_title":"How to select projects and allocate funds to obtain the total maximum profit for facing many different investment projects in the production strategy management plan of discrete production enterprise - \u0410\u0437-\u0431\u0443\u043a\u0438","og_description":"Bao Gang ORCID iD:0009-0008-5357-9198 University of Ruse \u201cAngel Kanchev\u201d, Bulgaria Pavel Vitliemov ORCID iD:0000-0002-1747-7994 Web of Science Researcher ID: H-5795-2018 University of Ruse \u201cAngel Kanchev\u201d, Bulgaria https:\/\/doi.org\/10.53656\/adpe-2025.18 PDF Pages 197-216 Abstract. The market is developing rapidly, and the choice of production investment projects presents diversity and complexity. Manufacturing enterprises not only need to select high-profit […]","og_url":"https:\/\/azbuki.bg\/en\/international-scientific-and-technical-conference-automation-of-discrete-production-engineering-2025\/how-to-select-projects-and-allocate-funds-to-obtain-the-total-maximum-profit-for-facing-many-different-investment-projects-in-the-production-strategy-management-plan-of-discrete-production-enterprise\/","og_site_name":"\u0410\u0437-\u0431\u0443\u043a\u0438","article_publisher":"https:\/\/www.facebook.com\/Azbuki55\/","article_published_time":"2025-05-30T12:21:27+00:00","og_image":[{"url":"https:\/\/azbuki.bg\/wp-content\/uploads\/2025\/03\/pdf-icon.jpg"}],"author":"\u201e\u0410\u0437-\u0431\u0443\u043a\u0438\u201c","twitter_card":"summary_large_image","twitter_misc":{"Written by":"\u201e\u0410\u0437-\u0431\u0443\u043a\u0438\u201c","Est. reading time":"28 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/azbuki.bg\/en\/international-scientific-and-technical-conference-automation-of-discrete-production-engineering-2025\/how-to-select-projects-and-allocate-funds-to-obtain-the-total-maximum-profit-for-facing-many-different-investment-projects-in-the-production-strategy-management-plan-of-discrete-production-enterprise\/#article","isPartOf":{"@id":"https:\/\/azbuki.bg\/en\/international-scientific-and-technical-conference-automation-of-discrete-production-engineering-2025\/how-to-select-projects-and-allocate-funds-to-obtain-the-total-maximum-profit-for-facing-many-different-investment-projects-in-the-production-strategy-management-plan-of-discrete-production-enterprise\/"},"author":{"name":"\u201e\u0410\u0437-\u0431\u0443\u043a\u0438\u201c","@id":"https:\/\/azbuki.bg\/en\/#\/schema\/person\/de220d282eaa494f914ce0fd838645dd"},"headline":"How to select projects and allocate funds to obtain the total maximum profit for facing many different investment projects in the production strategy management plan of discrete production enterprise","datePublished":"2025-05-30T12:21:27+00:00","dateModified":"2025-05-30T12:21:27+00:00","mainEntityOfPage":{"@id":"https:\/\/azbuki.bg\/en\/international-scientific-and-technical-conference-automation-of-discrete-production-engineering-2025\/how-to-select-projects-and-allocate-funds-to-obtain-the-total-maximum-profit-for-facing-many-different-investment-projects-in-the-production-strategy-management-plan-of-discrete-production-enterprise\/"},"wordCount":4790,"publisher":{"@id":"https:\/\/azbuki.bg\/en\/#organization"},"keywords":["dynamic programming","K-means clustering analysis","maximum return on investment","production investment","screening and allocation","TOPSIS method"],"articleSection":["International Scientific and Technical Conference Automation of Discrete Production Engineering 2025"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/azbuki.bg\/en\/international-scientific-and-technical-conference-automation-of-discrete-production-engineering-2025\/how-to-select-projects-and-allocate-funds-to-obtain-the-total-maximum-profit-for-facing-many-different-investment-projects-in-the-production-strategy-management-plan-of-discrete-production-enterprise\/","url":"https:\/\/azbuki.bg\/en\/international-scientific-and-technical-conference-automation-of-discrete-production-engineering-2025\/how-to-select-projects-and-allocate-funds-to-obtain-the-total-maximum-profit-for-facing-many-different-investment-projects-in-the-production-strategy-management-plan-of-discrete-production-enterprise\/","name":"How to select projects and allocate funds to obtain the total maximum profit for facing many different investment projects in the production strategy management plan of discrete production enterprise - \u0410\u0437-\u0431\u0443\u043a\u0438","isPartOf":{"@id":"https:\/\/azbuki.bg\/en\/#website"},"datePublished":"2025-05-30T12:21:27+00:00","dateModified":"2025-05-30T12:21:27+00:00","breadcrumb":{"@id":"https:\/\/azbuki.bg\/en\/international-scientific-and-technical-conference-automation-of-discrete-production-engineering-2025\/how-to-select-projects-and-allocate-funds-to-obtain-the-total-maximum-profit-for-facing-many-different-investment-projects-in-the-production-strategy-management-plan-of-discrete-production-enterprise\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/azbuki.bg\/en\/international-scientific-and-technical-conference-automation-of-discrete-production-engineering-2025\/how-to-select-projects-and-allocate-funds-to-obtain-the-total-maximum-profit-for-facing-many-different-investment-projects-in-the-production-strategy-management-plan-of-discrete-production-enterprise\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/azbuki.bg\/en\/international-scientific-and-technical-conference-automation-of-discrete-production-engineering-2025\/how-to-select-projects-and-allocate-funds-to-obtain-the-total-maximum-profit-for-facing-many-different-investment-projects-in-the-production-strategy-management-plan-of-discrete-production-enterprise\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/history.azbuki.bg\/en\/"},{"@type":"ListItem","position":2,"name":"How to select projects and allocate funds to obtain the total maximum profit for facing many different investment projects in the production strategy management plan of discrete production enterprise"}]},{"@type":"WebSite","@id":"https:\/\/azbuki.bg\/en\/#website","url":"https:\/\/azbuki.bg\/en\/","name":"\u0410\u0437-\u0431\u0443\u043a\u0438","description":"\u041d\u0430\u0446\u0438\u043e\u043d\u0430\u043b\u043d\u043e \u0438\u0437\u0434\u0430\u0442\u0435\u043b\u0441\u0442\u0432\u043e \u0437\u0430 \u043e\u0431\u0440\u0430\u0437\u043e\u0432\u0430\u043d\u0438\u0435 \u0438 \u043d\u0430\u0443\u043a\u0430","publisher":{"@id":"https:\/\/azbuki.bg\/en\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/azbuki.bg\/en\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/azbuki.bg\/en\/#organization","name":"\u0410\u0437-\u0431\u0443\u043a\u0438","url":"https:\/\/azbuki.bg\/en\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/azbuki.bg\/en\/#\/schema\/logo\/image\/","url":"https:\/\/azbuki.bg\/wp-content\/uploads\/2019\/04\/logo-azbuki-e1580374651845.png","contentUrl":"https:\/\/azbuki.bg\/wp-content\/uploads\/2019\/04\/logo-azbuki-e1580374651845.png","width":250,"height":70,"caption":"\u0410\u0437-\u0431\u0443\u043a\u0438"},"image":{"@id":"https:\/\/azbuki.bg\/en\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/Azbuki55\/","https:\/\/www.instagram.com\/nion_azbuki\/"]},{"@type":"Person","@id":"https:\/\/azbuki.bg\/en\/#\/schema\/person\/de220d282eaa494f914ce0fd838645dd","name":"\u201e\u0410\u0437-\u0431\u0443\u043a\u0438\u201c","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/azbuki.bg\/en\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/d08ccbd951212deb604aa2d403575d4e?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/d08ccbd951212deb604aa2d403575d4e?s=96&d=mm&r=g","caption":"\u201e\u0410\u0437-\u0431\u0443\u043a\u0438\u201c"},"sameAs":["https:\/\/azbuki.bg\/"],"url":"https:\/\/bel.azbuki.bg\/en\/author\/azbuki_ekip\/"}]}},"_links":{"self":[{"href":"https:\/\/bel.azbuki.bg\/en\/wp-json\/wp\/v2\/posts\/154075"}],"collection":[{"href":"https:\/\/bel.azbuki.bg\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/bel.azbuki.bg\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/bel.azbuki.bg\/en\/wp-json\/wp\/v2\/users\/124332423427287"}],"replies":[{"embeddable":true,"href":"https:\/\/bel.azbuki.bg\/en\/wp-json\/wp\/v2\/comments?post=154075"}],"version-history":[{"count":1,"href":"https:\/\/bel.azbuki.bg\/en\/wp-json\/wp\/v2\/posts\/154075\/revisions"}],"predecessor-version":[{"id":154125,"href":"https:\/\/bel.azbuki.bg\/en\/wp-json\/wp\/v2\/posts\/154075\/revisions\/154125"}],"wp:attachment":[{"href":"https:\/\/bel.azbuki.bg\/en\/wp-json\/wp\/v2\/media?parent=154075"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/bel.azbuki.bg\/en\/wp-json\/wp\/v2\/categories?post=154075"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/bel.azbuki.bg\/en\/wp-json\/wp\/v2\/tags?post=154075"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}