_{1}

We presented Mathematical apparatus of the choice of optimum parameters of technical, technological systems and materials on the basis of vector optimization. We have considered the formulation and solution of three types of tasks presented below. First, the problem of selecting the optimal parameters of technical systems depending on the functional characteristics of the system. Secondly, the problem of selecting the optimal parameters of the process depending on the technological characteristics of the process. Third, the problem of choosing the optimal structure of the material depending on the functional characteristics of this material. The statement of all problems is made in the form of vector problems of mathematical (nonlinear) programming. The theory and the principle of optimality of the solution of vector tasks it is explained in work of https://rdcu.be/bhZ8i. The implementation of the methodology is shown on a numerical example of the choice of optimum parameters of the technical, technological systems and materials. On the basis of mathematical methods of solution of vector problems we developed the software in the MATLAB system. The numerical example includes: input data (requirement specification) for modeling; transformation of mathematical models with uncertainty to the model under certainty; acceptance of an optimal solution with equivalent criteria (the solution of numerical model); acceptance of an optimal solution with the given priority of criterion.

The problem of high quality production is associated with the creation of technical, answering to the modern achievements of science and technology. The functioning of technical, technological systems, as well as the structure of materials depend on a set of functional characteristics that must be considered at the design stage. Improvement of one of the characteristics leads to deterioration of other characteristics. And it is necessary for improvement of quality of the produced product improvements of all characteristics in total. For the solution of such problems we use the theory and methods of vector (multi-criteria) optimization [

The purpose of this work is to create a methodology for selecting the optimal parameters of technical, technological systems and materials based on vector optimization. The methodology includes the construction of a mathematical model for an object or decision-making system, an algorithm and software for solving a vector problem of mathematical programming.

For realization of a goal in work the following problems are considered and solved. The article presents the construction of a mathematical model as a vector problem of mathematical programming for three types of optimal decision-making problems. The first task is related to the choice of optimal parameters of technical systems, which depend on a set of functional characteristics of the system. The study of this class of problems is presented in [

Please As an “object for optimal decision-making” we use “technical system”. Statement of a problem is executed according to [

The technical system which functioning depends on N—a set of design data is considered:

X = { x 1 x 2 ⋯ x N } , N—number of parameters, each of which lies in the set limits:

x j min ≤ x j ≤ x j max , j = 1 , N ¯ ,

or

X min ≤ X ≤ X max ,

where x j min , x j max , ∀ j ∈ N —lower and top limits of change of the vector of parameters of the technical system.

The result of functioning of the technical system is defined by a set K to technical characteristics of f k ( X ) , k = 1 , K ¯ , which functionally depend on design data X = { x j , j = 1 , N ¯ } , in total they represent a vector function:

F ( X ) = ( f 1 ( X ) f 2 ( X ) ⋯ f K ( X ) ) T .

The set of characteristics (criteria) to is subdivided into two subsets K_{1} and K_{2}: K = K 1 ∪ K 2 is a subset of technical characteristics, the numerical values of which are desirable to obtain as high as possible: f k → max , k = 1 , K 1 ¯ .

K_{2}—it subsets of technical characteristics which numerical sizes it is desirable to receive as it is possible below: f k → min , k = 1 , K 1 + 1 ¯ , K 2 ≡ K 1 + 1 , K ¯ . The mathematical model should, firstly, the purposes of the technical system which are presented by the characteristics of F(X), secondly, to consider X min ≤ X ≤ X max restrictions. The mathematical model of the technical system which solves in general a problem of a choice of the optimum design decision (a choice of optimum parameters), we will present in the form of a vector problem of mathematical programming.

O p t F ( X ) = { max F 1 ( X ) = { max f k ( X ) , k = 1 , K 1 ¯ } , (1a)

min F 2 ( X ) = { min f k ( X ) , k = 1 , K 2 ¯ } } , (2a)

G ( X ) ≤ 0 , (3a)

x j min ≤ x j ≤ x j max , j = 1 , N ¯ , (4a)

where X is the vector of controlled variables (constructive parameters) from (1); F ( X ) = { f k , k = 1 , K ¯ } —vector criterion which everyone a component submits the characteristic of the technical system (1a)-(2a) which is functionally depending on the vector of variables X; in (3a) G ( X ) = { g 1 ( X ) g 2 ( X ) ⋯ g M ( X ) } T —vector—a function of the restrictions imposed on functioning of the technical system, M—a set of restrictions.

Restrictions are defined proceeding in them technological, physical and to that similar processes and can be presented by functional restrictions, for example:

f k min ≤ f k ( X ) ≤ f k max , k = 1 , K ¯ .

It is supposed that the f k , k = 1 , K ¯ functions are differentiated and convex, g i ( X ) , i = 1 , M ¯ , are continuous, and (3a)-(4a) set of admissible points of S set by restrictions isn’t empty and represents a compact:

S = { X ∈ R n | G ( X ) ≤ 0 , X min ≤ X ≤ X max } ≠ ∅ .

Criteria and restrictions (1a)-(4a) form mathematical model of technical system. It is required to find such vector of the Х o ∈ S parameters at which everyone a component the vector-functions

F 1 ( X ) = { f k ( X ) , k = 1 , K 1 ¯ }

accepts the greatest possible value, and a vector-functions

F 2 ( X ) = { f k ( X ) , k = 1 , K 2 ¯ }

are accepted by the minimum value.

To a substantial class of technical systems which can be presented by a vector problem (1a)-(4a), it is possible to refer their rather large number of tasks from various branches of economy of the state: as electro engineering [

In this article, the technical system is considered in statics. But technical systems can be considered in dynamics [

Please As an object of a research we use “technological process”. The problem of decision-making in technology in the production of products is formulated in accordance with the works [

We consider a technological process (e.g., Hybrid laser arc welding [

x j min ≤ x j ≤ x j max , j = 1 , N ¯ , or X min ≤ X ≤ X max ,

where x j min , x j max , ∀ j ∈ N —the lower and top limits of change of a vector of parameters of technological process, N is the number of parameters.

The result of functioning is defined by a set of running characteristics f k ( X ) , k = 1 , K ¯ , which functionally depend on design data of technological process of X = { x j , j = 1 , N ¯ } , (for example: the depth of the weld; underfill; percentage defect; total accumulated pore length). In total all running characteristics represent a vector function:

F ( X ) = ( f 1 ( X ) f 2 ( X ) ⋯ f K ( X ) ) T ,

where K—a set (number) of technological characteristics (criteria).

The set of characteristics K is subdivided into two subsets of K_{1} and K_{2}: K = K 1 ∪ K 2 is a subset of technological characteristics, the numerical values of which are desirable to obtain as high as possible: f k → max , k = 1 , K 1 ¯ . K_{2} are subsets of technological characteristics, the numerical values of which are desirable to obtain as low as possible: f k → min , k = 1 , K 1 + 1 ¯ , K 2 ≡ K 1 + 1 , K ¯ .

Mathematical model has to reflect, first, the purposes of the technological process which are presented by the characteristics of F(X), and secondly, to take into account the constraints of X min ≤ X ≤ X max . The mathematical model of the technological process solving in general a problem of the choice of optimum parameters of the technological process can be presented in the form of a vector problem of mathematical programming.

O p t F ( X ) = { max F 1 ( X ) = { max f k ( X ) , k = 1 , K 1 ¯ } , (1b)

min F 2 ( X ) = { min f k ( X ) , k = 1 , K 2 ¯ } } , (2b)

G ( X ) ≤ 0 , (3b)

x j min ≤ x j ≤ x j max , j = 1 , N ¯ , (4b)

where X is the vector of operated variable (design parameters) of the technological process; F ( X ) = { f k , k = 1 , K ¯ } —vector criterion which each component represents the characteristic of the technical system (1b)-(2b) which is functionally depending on a vector of variables X; in (3b) G ( X ) = { g 1 ( X ) g 2 ( X ) ⋯ g M ( X ) } T is a vector function of the restrictions imposed on functioning of the technological process, M is a set of constraints. The constraints are defined flowing past in them technological, physical and to that similar processes and can be presented by the functional restrictions, for example:

f k min ≤ f k ( X ) ≤ f k max , k = 1 , K ¯ .

It is supposed that the functions f k ( X ) , k = 1 , K ¯ are differentiated and convex, g i ( X ) , i = 1 , M ¯ are continuous, and S = { X ∈ R N | G ( X ) ≤ 0 , X min ≤ X ≤ X max } ≠ ∅ .

The (1b)-(4b) ratios form mathematical model of the technological process. It is required to find such vector of the Х o ∈ S parameters at which each component of a vector function of F 1 ( X ) = { f k ( X ) , k = 1 , K 1 ¯ } accepts the greatest possible value, and vector functions of F 2 ( X ) = { f k ( X ) , k = 1 , K 2 ¯ } accepts minimum value.

The structure of the material is characterized by a particular set of the functional characteristics which include mechanical and physical and chemical properties of the material. One group of properties (the functional characteristics) of the material is characterized by the fact that it is desirable to receive them on the numerical value as much as possible (for example, strength), other group of properties is characterized by the fact that is desirable to receive them on the numerical value less as. As a rule, improvement on one of these characteristics leads to a deterioration of the other. In General, it is required to choose such a composition of the material that all the properties of the material were as good as possible in the aggregate. Chemical composition of material is determined by the percentage (per unit volume) of a multiple component material, which in the amount equal to one hundred percent.

The composition of material of any product, technical system depends on V—a set of components of material: Y = { y 1 y 2 ⋯ y V } , other record of a vector Y = { y v , v = 1 , V ¯ } , V is the number of components of which it can be made (is made) material, y v —size as a percentage v-th of a material component, each of which lies in the given limits:

y v min ≤ y v ≤ y v max , v = 1 , V ¯ , or Y min ≤ Y ≤ Y max ,

where y v min , y v max , ∀ v ∈ V —the lower and top limits of change of a vector of the material of components; Y = { y v , v = 1 , V ¯ } is the vector of unknowns defining the complete set and size of all components which are a part of material; ∑ v ∈ V y v = 100 % —the sum of all components of the material is equal to hundred percent.

The composition of the material is estimated by a set H of physical properties (characteristics) of the material: h k ( Y ) , k = 1 , K ¯ which functionally depend on the design parameters (components) of Y, k—the index of a type of physical properties of the material, k = 1 , K ¯ where K—the number of types of properties (the functional characteristics) of the material, we will present them in the form a vector-functions:

H ( Y ) = ( h 1 ( Y ) h 2 ( Y ) ⋯ h K ( Y ) ) T or H ( Y ) = { h k ( Y ) , k = 1 , K ¯ } T

The set of the functional characteristics of the material K is subdivided into two subsets of K_{1} and K_{2}: K = K 1 ∪ K 2 . K_{1} is a subset of characteristics of material which numerical values it are desirable to receive as it is possible above: h k ( Y ) → max , k = 1 , K 1 ¯ .

K_{2} are subsets of characteristics of material which numerical values it is desirable to receive, as low as possible: h k ( Y ) → min , k = 1 , K 1 + 1 ¯ , K 2 ≡ K 1 + 1 , K ¯ .

Using the functional characteristics of material H ( Y ) = { h k ( Y ) , k = 1 , K ¯ } T as

criteria, and parametrical restrictions Y min ≤ Y ≤ Y max as the change limits imposed on each type of components, the mathematical model of the material solving in general a problem of the choice of optimum structure of the material (the optimal design solution), we will present a vector problem of mathematical programming:

O p t F ( X ) = { max F 1 ( X ) = { max h k ( X ) , k = 1 , K 1 ¯ } , (1c)

min F 2 ( X ) = { min h k ( X ) , k = 1 , K 2 ¯ } } , (2c)

G ( X ) ≤ 0 , ∑ v ∈ V y v = 100 , (3c)

y v min ≤ y v ≤ y v max , v = 1 , V ¯ , (4c)

is the vector of the operated variables (a material component) from Y min ≤ Y ≤ Y max , V—number of components; H ( Y ) = { h k ( Y ) , k = 1 , K ¯ } T —vector criterion which each function submits the characteristic (property) of the material which is functionally depending on a vector of variables Y; in (3c) G ( X ) = { g 1 ( Y ) g 2 ( Y ) ⋯ g M ( Y ) } T , ∑ v ∈ V y v = 100 is a vector function of the restrictions imposed on structure of the material, M is a set of restrictions. Restrictions are defined technological, physical and similar properties, processes (technologies) and can be presented by the functional restrictions, for example, h k min ≤ h k ( Y ) ≤ h k max , k = 1 , K ¯ . It is supposed that the functions h k ( Y ) , k = 1 , K ¯ are differentiated and convex, g i ( Y ) , i = 1 , M ¯ are continuous, and (3c)-(4c) set of admissible points of S set by restrictions are not empty and represents a compact:

S = { Y ∈ R n | G ( X ) ≤ 0 , Y min ≤ X ≤ Y max } ≠ ∅ .

Ratios (1c)-(4c) form mathematical model of the material. It is required to find such vector of the Y o ∈ S parameters at which each component (characteristic) the vector—the H 1 ( Y ) = { h k ( Y ) , k = 1 , K 1 ¯ } functions accepts the greatest possible value, and a vector—the H 2 ( Y ) = { h k ( Y ) , k = 1 , K 2 ¯ } functions accepts minimum value.

In total the mathematical model of the material (1c)-(4c) can be interpreted as systems approach to the study of the material.

The Mathematical models of a technical system (1a)-(4a), technological process (1b)-(4b) and structures of material (1c)-(4c) are constructed in the assumption that the functional dependence of each criterion (characteristic) and restrictions from parameters of the studied object is known. In real life such functional dependence of criterion from parameters extremely infrequent, i.e. there are conditions of uncertainty. We present a vector optimization problem with certainty and uncertainty conditions.

The conditions of a certainty are characterized by the fact that the functional dependence of each characteristic and restrictions on the parameters of the studied object is known [

The conditions of uncertainty are characterized by the fact that the initial data characterizing the studied object are presented: a) random, b) fuzzy, or, c) incomplete data. Therefore, we lack sufficient information about the functional dependence of each characteristic and restrictions on the parameters [

In real life, the conditions of certainty and uncertainty are combined. The process model should also reflect these conditions. We will present a model of the technological process under certainty and uncertainty in the aggregate:

O p t F ( X ) = { max F 1 ( X ) = { max f k ( X ) , k = 1 , K 1 d e f ¯ } , max I 1 ( X ) ≡ { max f k ( X i , i = 1 , M ¯ ) } T , k = 1 , K 1 u n c ¯ , (1)

min F 2 ( X ) = { min f k ( X ) , k = 1 , K 2 d e f ¯ , min I 2 ( X ) ≡ { min f k ( X i , i = 1 , M ¯ ) } T , k = 1 , K 2 u n c ¯ } } , (2)

at restriction f k min ≤ f k ( X ) ≤ f k max , k = 1 , K ¯ , (3)

x j min ≤ x j ≤ x j max , j = 1 , N ¯ 1 , N ¯ , (4)

where X = { x j , j = 1 , N ¯ } is the vector of controlled variables (input parameters of the studied object); F ( X ) = { F 1 ( X ) F 2 ( X ) I 1 ( X ) I 2 ( X ) } is a vector criterion, each component of which represents a vector of criteria (output characteristics of the studied object). The magnitude of the characteristic (function) depends on the discrete values of the vector of variables X. F 1 ( X ) , F 2 ( X ) is the set of functions max and min, respectively; I 1 ( X ) , I 2 ( X ) are the set of discrete values of the characteristics max and min, respectively; 1 , K 1 d e f ¯ , 1 , K 2 d e f ¯ , (definiteness), 1 , K 1 u n c ¯ , 1 , K 2 u n c ¯ , (uncertainty) a set of criteria max and min formed under certainty and uncertainty; in (3), f k min ≤ f k ( X ) ≤ f k max , k = 1 , K ¯ is a vector-function of restrictions imposed on the operation of the technological process, x j min ≤ x j ≤ x j max , j = 1 , N ¯ are parametric restrictions imposed on the studied object.

Elimination of uncertainty consists in the use of qualitative and quantitative descriptions of the object under study which can be received, for example, on the principle of “input-output”. Transformation of such information-initial data into functional dependence is carried out by using mathematical methods (the regression analysis) [

The transformation of the vector function (criteria) is carried out by the method of least squares, min ∑ i = 1 M ( y i − y i ¯ ) 2 , where by y i , i = 1 , M ¯ —experimental data; y i ¯ , i = 1 , M ¯ , their sizes received for one-factorial model by means of function y i ¯ = f ( X i , A ) , X i = { x i } . The function f ( X i , A ) we present in form of polynomial. In the applied part of the polynomial of the second degree is used.

As a result of this transformation, the source data in (1) and (2):

{ f k ( X i , i = 1 , M ¯ ) } T , k = 1 , K 1 u n c ¯ , { f k ( X i , i = 1 , M ¯ ) } T , k = 1 , K 2 u n c ¯

in problems of decision-making in the conditions of uncertainty the functions:

f k ( X ) , k = 1 , K 1 u n c ¯ , f k ( X ) , k = 1 , K 2 u n c ¯ are transformed.

As a result, a vector problem with conditions of certainty and uncertainty (1)-(4) is transformed into a vector problem under conditions of certainty:

O p t F ( X ) = { max F 1 ( X ) = { max f k ( X ) , k = 1 , K 1 ¯ } , (5)

min F 2 ( X ) = { min f k ( X ) . k = 1 , K 2 ¯ } } , (6)

at restriction f k min ≤ f k ( X ) ≤ f k max , k = 1 , K ¯ , (7)

x j min ≤ x j ≤ x j max , j = 1 , N ¯ , (8)

where F ( X ) = { f k , k = 1 , K ¯ } is a vector criterion, each component of which represents a characteristic of the object under study, functionally dependent on the vector of variables X; a subset of the criteria:

K 1 = K 1 d e f ∪ K 1 u n c , K 2 = K 2 d e f ∪ K 2 u n c [

The vector mathematical programming problem (5)-(8) is analogous to mathematical models (1a)-(4a), (1b)-(4b), (1c)-(4c).

The theory of vector optimization includes theoretical foundations (axiomatic) and methods of the solution of vector problems with equivalent criteria and with the given criterion priority. The theory is a basis of mathematical apparatus of modeling of “object for optimal decision-making” which allows you to select any point from a set of points, optimum across Pareto and to show why she is optimum. We presented axiomatic and methods for solving vector optimization problems (5)-(8) with equivalent criteria [

Definition 1. (Definition of the relative assessment of the criterion).

In a vector problem (5)-(8) we will enter designation:

λ k ( X ) = f k ( X ) − f k 0 f k * − f k 0 , ∀ k ∈ K is the relative estimate of a point X ∈ S kth

criterion; f k ( X ) —kth criterion at the point X ∈ S ; f k * —value of the kth criterion at the point of optimum X k * , obtained in vector problem (5)-(8) of individual kth criterion; f k 0 is the worst value of the kth criterion (ant optimum) at the point X k 0 (Superscript 0—zero) on the admissible set S in vector problem (5)-(8); the task at max (5), (7), (8) the value of f k 0 is the lowest value of the kth criterion

f k 0 = min X ∈ S f k ( X ) ∀ k ∈ K 1 and taskmin f k 0 is the greatest: f k 0 = max X ∈ S f k ( X ) ∀ k ∈ K 2 .

The relative estimate of the λ k ( X ) , ∀ k ∈ K is first, measured in relative units; secondly, the relative assessment of the λ k ( X ) , ∀ k ∈ K : on the admissible set is changed from zero in a point of X k 0

∀ k ∈ K lim X → X k 0 λ k ( X ) = 0 ,

to the unit at the point of an optimum of X k * : ∀ k ∈ K lim X → X k * λ k ( X ) = 1 :

∀ k ∈ K 0 ≤ λ k ( X ) ≤ 1 , X ∈ S .

this allows the comparison criteria, measured in relative units, among themselves by joint optimization.

Axiom 1. (About equality and equivalence of criteria in an admissible point of vector problems) In of vector problems of mathematical programming two criteria with the indexes k ∈ K , q ∈ K shall be considered as equal in X ∈ S point if relative estimates on kth and qth to criterion are equal among themselves in this point, i.e. λ k ( X ) = λ q ( X ) , k , q ∈ K . We will consider criteria equivalent in vector problems of mathematical programming if in, X ∈ S point when comparing in the numerical size of relative estimates of λ k ( X ) , k = 1 , K ¯ , among themselves, on each criterion of f k ( X ) , k = 1 , K ¯ , and, respectively, relative estimates of λ k ( X ) , isn’t imposed conditions about priorities of criteria.

Definition 2. (Definition of a minimum level among all relative estimates of criteria).

The relative level λ in a vector problem represents the lower assessment of a point of X ∈ S among all relative estimates of λ k ( X ) , k = 1 , K ¯ :

∀ X ∈ S λ ≤ λ k ( X ) , k = 1 , K ¯ , (9)

the lower level for performance of a condition (5) in an admissible point of X ∈ S is defined by a formula

∀ X ∈ S λ = min k ∈ K λ k ( X ) . (10)

Ratios (9) and (10) are interconnected. They serve as transition from operation (6) of definition of min to restrictions (9) and vice versa.

The level λ allows to unite all criteria in a vector problem one numerical characteristic of λ and to make over her certain operations, thereby, carrying out these operations over all criteria measured in relative units. The level λ functionally depends on the X ∈ S variable, changing X, we can change the lower level— λ . From here we will formulate the rule of search of the optimum decision.

Definition 3. (The principle of an optimality with equivalent criteria).

The vector problem of mathematical programming at equivalent criteria is solved, if the point of X o ∈ S and a maximum level of λ o (the top index o—optimum) among all relative estimates such that is found

λ o = max X ∈ S min k ∈ K λ k ( X ) . (11)

Using interrelation of expressions (9) and (10), we will transform a maximine problem (11) to an extreme problem

λ o = max X ∈ S λ , (12)

at restriction λ ≤ λ k ( X ) , k = 1 , K ¯ . (13)

The resulting problem (12)-(13) let’s call the λ-problem.

λ-problem (12)-(13) has (N + 1) dimension, as a consequence of the result of the solution of λ-problem (8)-(9) represents an optimum vector of X o ∈ R N + 1 , (N + 1) which component an essence of the value of the λ o , i.e. X o = { x 1 o , x 2 o , ⋯ , x N o , x N + 1 o } , thus x N + 1 o = λ o , and (N + 1) a component of a vector of X^{o} selected in view of its specificity.

The received a pair of { λ o , X o } = X o characterizes the optimum solution of λ-problem (12)-(13) and according to vector problem of mathematical programming (5)-(8) with the equivalent criteria, solved on the basis of normalization of criteria and the principle of the guaranteed result. We will call in the optimum solution of X o = { λ o , X o } , X^{o}—an optimal point, and λ o —a maximum level.

An important result of the algorithm for solving vector problems (5)-(8) with equivalent criteria is the following theorem.

Theorem 1. (The theorem of the two most contradictory criteria in the vector problem of mathematical programming with equivalent criteria).

In convex vector problems of mathematical programming at the equivalent criteria which is solved on the basis of normalization of criteria and the principle of the guaranteed result, in an optimum point of X o = { λ o , X o } two criteria are always—denote their indexes q ∈ K , p ∈ K (which in a sense are the most contradiction of the criteria k = 1 , K ¯ ), for which equality is carried out:

λ o = λ q ( X o ) = λ p ( X o ) , q , p ∈ K , X ∈ S , (14)

and other criteria are defined by inequalities:

λ o ≤ λ k ( X o ) , ∀ k ∈ K , q ≠ p ≠ k . (15)

For development of methods of the solution of problems of vector optimization with a priority of criterion we use definitions as follows: priority of one criterion of vector problems, with a criterion priority over other criteria; numerical expression of a priority; the set priority of a criterion; the lower (minimum) level from all criteria with a priority of one of them; a subset of points with priority by criterion (Axiom 2); the principle of optimality of the solution of problems of vector optimization with the set priority of one of the criteria, and related theorems. For more details see [

Definition 4. (About the priority of one criterion over the other).

The criterion of q ∈ K in the vector problem of Equations (12) and (13) in a point of X ∈ S has priority over other criteria of k = 1 , K ¯ , and the relative estimate of λ q ( X ) by this criterion is greater than or equal to relative estimates of λ k ( X ) of other criteria, i.e.:

λ q ( X ) ≥ λ k ( X ) , k = 1 , K ¯ , (16)

and a strict priority for at least one criterion of t ∈ K , λ q ( X ) > λ k ( X ) , t ≠ q , and for other criteria of λ q ( X ) ≥ λ k ( X ) , k = 1 , K ¯ , k ≠ t ≠ q .

Introduction of the definition of a priority of criterion q ∈ K in the vector problem of Equations (5)-(8) executed the redefinition of the early concept of a priority. Earlier the intuitive concept of the importance of this criterion was outlined, now this “importance” is defined as a mathematical concept: the higher the relative estimate of the qth criterion compared to others, the more it is important (i.e., more priority), and the highest priority at a point of an optimum is X k * , ∀ q ∈ K .

From the definition of a priority of criterion of q ∈ K in the vector problem of Equations (5)-(8), it follows that it is possible to reveal a set of points S q ⊂ S that is characterized by λ q ( X ) ≥ λ k ( X ) , k ≠ q , X ∈ S q . However, the answer to whether a criterion of q ∈ K at a point of the set S q has more priority than others remains open. For clarification of this question, we define a communication coefficient between a couple of relative estimates of q and k that, in total, represent a vector:

P q ( X ) = { p k q ( X ) | k = 1 , K ¯ } , q ∈ K , ∀ X ∈ S q .

Definition 5. (About numerical expression of a priority of one criterion over another).

In the vector problem of Equations (12) and (13), with priority of the qth criterion over other criteria of k = 1 , K ¯ , for ∀ X ∈ S q , and a vector of P q ( X ) which shows how many times a relative estimate of λ q ( X ) , q ∈ K , is more than other relative estimates of λ k ( X ) , k = 1 , K ¯ , we define a numerical expression of the priority of the qth criterion over other criteria of k = 1 , K ¯ as:

P q ( X ) = { p k q ( X ) = λ q ( X ) λ k ( X ) , k = 1 , K ¯ } , p k q ( X ) ≥ 1 , ∀ X ∈ S q ⊂ S , k = 1 , K ¯ , ∀ q ∈ K (17)

Definition 6. (About the set numerical expression of a priority of one criterion over another).

In the vector problem of Equations (5)-(8) with a priority of criterion of q ∈ K for ∀ X ∈ S , vector P q = { p k q , k = 1 , K ¯ } is considered to be set by the person making decisions (i.e., decision-maker) if everyone is set a component of this vector. Set by the decision-maker, component p k q , from the point of view of the decision-maker, shows how many times a relative estimate of λ q ( X ) , q ∈ K is greater than other relative estimates of λ k ( X ) , k = 1 , K ¯ . The vector of p k q , k = 1 , K ¯ , is the numerical expression of the priority of the qth criterion over other criteria of k = 1 , K ¯ :

P q ( X ) = { p k q ( X ) , k = 1 , K ¯ } , p k q ( X ) ≥ 1 , ∀ X ∈ S q ⊂ S , k = 1 , K ¯ , ∀ q ∈ K (18)

The vector problem of Equations (5)-(8), in which the priority of any criteria is set, is called a vector problem with the set priority of criterion. The problem of a task of a vector of priorities arises when it is necessary to determine the point X o ∈ S by the set vector of priorities. In the comparison of relative estimates with a priority of criterion of q ∈ K , as well as in a task with equivalent criteria, we define the additional numerical characteristic of λ which we call the level.

Definition 7. (About the lower level among all relative estimates with a criterion priority).

The λ level is the lowest among all relative estimates with a priority of criterion of q ∈ K such that:

λ ≤ p k q λ k ( X ) , k = 1 , K ¯ , q ∈ K , ∀ X ∈ S q ⊂ S ; (19)

The lower level for the performance of the condition in Equation (19) is defined as:

λ = min k ∈ K p k q λ k ( X ) , q ∈ K , ∀ X ∈ S q ⊂ S . (20)

Equations (19) and (20) are interconnected and serve as a further transition from the operation of the definition of the minimum to restrictions, and vice versa. In Section 3.1, we gave the definition of a Pareto optimal point X o ∈ S with equivalent criteria. Considering this definition as an initial one, we will construct a number of the axioms dividing an admissible set of S into, first, a subset of Pareto optimal points S°, and, secondly, a subset of points S q ⊂ S , q ∈ K , with priority for the qth criterion.

Axiom 2. (About a subset of points, priority by criterion).

In the vector problem of Equations (12)-(13), the subset of points S q ⊂ S is called the area of priority of criterion of q ∈ K over other criteria, if

∀ X ∈ S q ∀ k ∈ K λ q ( X ) ≥ λ k ( X ) , q ≠ k .

This definition extends to a set of Pareto optimal points S o that is given by the following definition.

Axiom 2a. (About a subset of points, priority by criterion, on Pareto’s great number in a vector problem). In a vector problem of mathematical programming the subset of points S q o ⊂ S o ⊂ S is called the area of a priority of criterion of q ∈ K over other criteria, if ∀ X ∈ S q o ∀ k ∈ K λ q ( X ) ≥ λ k ( X ) , q ≠ k .

In the following we provide explanations.

Axiom 2 and 2а allow the breaking of the vector problem in Equations (5)-(8) into an admissible set of points S, including a subset of Pareto optimal points, S o ⊂ S , and subsets:

One subset of points S ′ ⊂ S where criteria are equivalent, and a subset of points of S’ crossed with a subset of points S^{o}, allocated to a subset of Pareto optimal points at equivalent criteria S o o = S ′ ∩ S o . As will be shown further, this consists of one point of X o ∈ S , i.e.

X o = S o o = S ′ ∩ S o , S ′ ∈ S , S o ⊂ S .

“K” subsets of points where each criterion of q = 1 , K ¯ has a priority over other criteria of k = 1 , K ¯ , q ≠ k , and thus breaks, first, sets of all admissible points S, into subsets S q ⊂ S , q = 1 , K ¯ and, second, a set of Pareto optimal points, S^{o}, into subsets S q o ⊂ S o ⊂ S , q = 1 , K ¯ . This yields:

S ′ ∪ ( ∪ q ∈ K S q o ) ≡ S o , S q o ⊂ S o ⊂ S , q = 1 , K ¯ .

We note that the subset of points S q o , on the one hand, is included in the area (a subset of points) of priority of criterion of q ∈ K over other criteria: S q o ⊂ S q ⊂ S , and, on the other, in a subset of Pareto optimal points S q o ⊂ S o ⊂ S .

Axiom 2 and the numerical expression of priority of criterion (Definition 5) allow the identification of each admissible point of X ∈ S (by means of vector P q ( X ) = { p k q ( X ) = λ q ( X ) λ k ( X ) , k = 1 , K ¯ } , to form and choose:

a subset of points by priority criterion S_{q}, which is included in a set of points S, ∀ q ∈ K X ∈ S q ⊂ S , (such a subset of points can be used in problems of clustering, but is beyond this article);

a subset of points by priority criterion S q o , which is included in a set of Pareto optimal points S^{o}, ∀ q ∈ K , X ∈ S q o ⊂ S o .

Thus, full identification of all points in the vector problem of Equations (12) and (13) is executed in sequence as:

Set of admissible points of X ∈ S ®

Subset of points, optimum across Pareto, X ∈ S o ⊂ S ®

Subset of points, optimum across Pareto X ∈ S q o ⊂ S o ⊂ S ®

Separate point of а ∀ X ∈ S X ∈ S q o ⊂ S o ⊂ S

This is the most important result which allows the output of the principle of optimality and to construct methods of a choice of any point of Pareto’s great number.

Definition 8. (Principle of optimality 2. The solution of a vector problem with the set criterion priority).

The vector problem of Equations (12) and (13) with the set priority of the qth criterion of p k q λ k ( X ) , k = 1 , K ¯ is considered solved if the point X^{o} and maximum level λ^{o} among all relative estimates is found such that:

λ o = max X ∈ S min k ∈ K p k q λ k ( X ) , q ∈ K . (21)

Using the interrelation of Equations (19) and (20), we can transform the maximine problem of Equation (33) into an extreme problem of the form:

λ o = max X ∈ S λ , (22)

at restriction λ ≤ p k q λ k ( X ) , k = 1 , K ¯ . (23)

We call Equations (22) and (23) the λ-problem with a priority of the qth criterion.

The solution of the λ-problem is the point X o = { X o , λ o } . This is also the result of the solution of the vector problem of Equations (5)-(8) with the set priority of the criterion, solved on the basis of normalization of criteria and the principle of the guaranteed result.

In the optimum solution X o = { X o , λ o } , X^{o}, an optimum point, and λ^{o}, the maximum bottom level, the point of X^{o} and the λ^{o} level correspond to restrictions of Equation (15), which can be written as:

λ o ≤ p k q λ k ( X o ) , k = 1 , K ¯ .

These restrictions are the basis of an assessment of the correctness of the results of a decision in practical vector problems of optimization.

From Definitions 1 and 2, “Principles of optimality”, follows the opportunity to formulate the concept of the operation “opt”.

Definition 9. (Mathematical operation “opt”).

In the vector problem of Equations (1)-(4), in which “max” and “min” are part of the criteria, the mathematical operation “opt” consists of the definition of a point X° and the maximum λ° bottom level to which all criteria measured in relative units are lifted:

λ o ≤ λ k ( X o ) = f k ( X ) − f k 0 f k * − f k 0 , k = 1 , K ¯ , (24)

i.e., all criteria of λ k ( X o ) , k = 1 , K ¯ , are equal to or greater than the maximum level of λ^{o} (therefore λ^{o} is also called the guaranteed result).

Theorem 2. (The theorem of the most inconsistent criteria in a vector problem with the set priority).

If in the convex vector problem of mathematical programming of Equations (5)-(8) the priority of the qth criterion of p k q , k = 1 , K ¯ , ∀ q ∈ K over other criteria is set, at a point of an optimum X o ∈ S obtained on the basis of normalization of criteria and the principle of guaranteed result, there will always be two criteria with the indexes r ∈ K , t ∈ K , for which the following strict equality holds:

λ o = p k r λ r ( X o ) = p k t λ t ( X o ) , r , t ∈ K , (25)

and other criteria are defined by inequalities:

λ o ≤ p k q ( X o ) , k = 1 , K ¯ , ∀ q ∈ K , q ≠ r ≠ t . (26)

Criteria with the indexes r ∈ K , t ∈ K for which the equality of Equation (38) holds are called the most inconsistent.

Proof. Similar to Theorem 2 [

We note that in Equations (25) and (26), the indexes of criteria r , t ∈ K can coincide with the q ∈ K index.

Consequence of Theorem 1, about equality of an optimum level and relative estimates in a vector problem with two criteria with a priority of one of them.

In a convex vector problem of mathematical programming with two equivalent criteria, solved on the basis of normalization of criteria and the principle of the guaranteed result, at an optimum point X^{o} equality is always carried out at a priority of the first criterion over the second:

λ o = λ 1 ( X o ) = p 2 1 ( X o ) λ 2 ( X o ) , X o ∈ S ,

where

p 2 1 ( X o ) = λ 1 ( X o ) / λ 2 ( X o ) , (27)

and at a priority of the second criterion over the first:

λ o = λ 2 ( X o ) = p 1 2 ( X o ) λ 1 ( X o ) , X o ∈ S , where p 1 2 ( X o ) = λ 2 ( X o ) / λ 1 ( X o ) .

To solve of the vector problems of mathematical programming (5)-(8) the methods based on axiomatic of the normalization of criteria and the principle of the guaranteed result [

Step 1. The problem (5)-(8) by each criterion separately is solved, i.e. for ∀ k ∈ K 1 is solved at the maximum, and for ∀ k ∈ K 2 is solved at a minimum. As a result of the decision we will receive: X k * —an optimum point by the corresponding criterion, k = 1 , K ¯ ; f k * = f k ( X k * ) —the criterion size kth in this point, k = 1 , K ¯ .

Step 2. We define the worst value of each criterion on S: f k 0 , k = 1 , K ¯ . For what the problem (5)-(8) for each criterion of k = 1 , K 1 ¯ on a minimum is solved:

f k 0 = min f k ( X ) , G ( X ) ≤ B , X ≥ 0 , k = 1 , K 1 ¯ .

The problem (5)-(8) for each criterion k = 1 , K 2 ¯ maximum is solved:

f k 0 = max f k ( X ) , G ( X ) ≤ B , X ≥ 0 , k = 1 , K 2 ¯ .

As a result of the decision we will receive: X k 0 = { x j , j = 1 , N ¯ } —an optimum point by the corresponding criterion, k = 1 , K ¯ ; f k 0 = f k ( X k 0 ) —the criterion size kth a point, X k 0 , k = 1 , K ¯ .

Step 3. The system analysis of a set of points, optimum across Pareto, for this purpose in optimum points of X * = { X k * , k = 1 , K ¯ } , are defined sizes of criterion functions of F(X^{*}) and relative estimates λ ( X * ) , λ k ( X ) = f k ( X ) − f k 0 f k * − f k 0 , ∀ k ∈ K :

F ( X * ) = { f k ( X k * ) , q = 1 , K ¯ , k = 1 , K ¯ } = | f 1 ( X 1 * ) , ⋯ , f K ( X 1 * ) ⋮ f 1 ( X K * ) , ⋯ , f K ( X K * ) | ,

λ ( X * ) = { λ q ( X k * ) , q = 1 , K ¯ , k = 1 , K ¯ } = | λ 1 ( X 1 * ) , ⋯ , λ K ( X 1 * ) ⋮ λ 1 ( X K * ) , ⋯ , λ K ( X K * ) | . (28)

As a whole on a problem ∀ k ∈ K the relative assessment of λ k ( X ) , k = 1 , K ¯ lies within

0 ≤ λ k ( X ) ≤ 1 , k = 1 , K ¯ .

Step 4. Creation of the λ-problem.

Creation of λ-problem is carried out in two stages:

initially built the maximine problem of optimization with the normalized criteria which at the second stage will be transformed to the standard problem of mathematical programming called λ-problem.

For construction maximine a problem of optimization we use definition 2—relative level:

∀ X ∈ S λ = min k ∈ K λ k ( X ) .

The bottom λ level is maximized on X ∈ S , as a result we will receive a maximine problem of optimization with the normalized criteria.

λ o = max X ∈ S min k ∈ K λ k ( X ) . (29)

At the second stage we will transform a problem (29) to a standard problem of mathematical programming:

λ o = max X ∈ S λ , λ o = max X ∈ S λ , (30)

λ − λ k ( X ) ≤ 0 , k = 1 , K ¯ , ® λ − f k ( X ) − f k 0 f k * − f k 0 ≤ 0 , k = 1 , K ¯ , (31)

G ( X ) ≤ B , X ≥ 0 , G ( X ) ≥ B , X ≥ 0 , (32)

where the vector of unknown of X has dimension of N + 1: X = { λ , x 1 , ⋯ , x N } .

Step 5. Solution of λ-problem.

λ-problem (30)-(32) is a standard problem of convex programming and for its decision standard methods are used.

As a result of the solution of λ-problem it is received: X o = { X o , λ o } —an optimum point;

f k ( X o ) , k = 1 , K ¯ —values of the criteria in this point;

λ k ( X o ) = f k ( X ) − f k 0 f k * − f k 0 , k = 1 , K ¯ —sizes of relative estimates;

λ^{o}—the maximum relative estimates which is the maximum bottom level for all relative estimates of λ k ( X o ) , or the guaranteed result in relative units. λ^{o} guarantees that all relative estimates of λ k ( X o ) more or are equal λ^{o}:

λ k ( X o ) o , k = 1 , K ¯ or λ o ≤ λ k ( X o ) , k = 1 , K ¯ , X o ∈ S ,

and according to Theorem 1 [

(Method of the decision in problems of vector optimization with a criterion priority) [

Step 1. We solve a vector problem with equivalent criteria. The algorithm of the decision is presented in Section 4.3.

As a result of the decision we obtain:

Optimum points by each criterion separately X k * , k = 1 , K ¯ and sizes of criterion functions in these points of f k * = f k ( X k * ) , k = 1 , K ¯ , which represent the boundary of a set of Pareto optimal points;

Anti-optimum points by each criterion of X k 0 = { x j , j = 1 , N ¯ } and the worst unchangeable part of each criterion of f k 0 = f k ( X k 0 ) , k = 1 , K ¯ ;

X o = { X o , λ o } , an optimum point, as a result of the solution of VPMP at equivalent criteria, i.e., the result of the solution of a maximine problem and the λ-problem constructed on its basis;

λ^{o}, the maximum relative assessment which is the maximum lower level for all relative estimates of λ_{k}(X^{o}), or the guaranteed result in relative units, λ^{o} guarantees that all relative estimates of λ_{k}(X^{o}) are equal to or greater than λ^{o}:

λ o ≤ λ k ( X o ) , k = 1 , K ¯ , X o ∈ S . (33)

The person making the decision carries out the analysis of the results of the solution of the vector problem with equivalent criteria. If the received results satisfy the decision maker, then the process concludes, otherwise subsequent calculations are performed.

In addition, we calculate:

in each point X k * , k = 1 , K ¯ we determine sizes of all criteria of: q = 1 , K ¯

{ f q ( X k * ) , q = 1 , K ¯ } , k = 1 , K ¯ , and relative estimates

λ ( X * ) = { λ q ( X k * ) , q = 1 , K ¯ , k = 1 , K ¯ } , λ k ( X ) = f k ( X ) − f k 0 f k * − f k 0 , ∀ k ∈ K :

F ( X * ) = | f 1 ( X 1 * ) , ⋯ , f K ( X 1 * ) ⋮ f 1 ( X K * ) , ⋯ , f K ( X K * ) | , λ ( X * ) = | λ 1 ( X 1 * ) , ⋯ , λ K ( X 1 * ) ⋮ λ 1 ( X K * ) , ⋯ , λ K ( X K * ) | . (34)

Matrices of criteria of F(X^{*}) and relative estimates of λ(X^{*}) show the sizes of each criterion of k = 1 , K ¯ upon transition from one optimum point X k * , k ∈ K to another X q * , q ∈ K , i.e., on the border of a great number of Pareto.

atan optimum point at equivalent criteria X^{o} we calculate sizes of criteria and relative estimates:

f k ( X o ) , k = 1 , K ¯ ; λ k ( X o ) , k = 1 , K ¯ , (35)

which satisfy the inequality of Equation (33). In other points X ∈ S o , in relative units the criteria of λ = min k ∈ K λ k ( X ) are always less than λ^{o}, given the λ-problem of Equations (30)-(32).

This information is also a basis for further study of the structure of a great number of Pareto.

Step 2. Choice of priority criterion of q ∈ K .

From theory (see Theorem 1) it is known that at an optimum point X^{o} there are always two most inconsistent criteria, q ∈ K and v ∈ K , for which in relative units an exact equality holds:

λ o = λ q ( X o ) = λ v ( X o ) , q , v ∈ K , X ∈ S . Others are subject to inequalities:

λ o ≤ λ k ( X o ) , ∀ k ∈ K , q ≠ v ≠ k .

As a rule, the criterion which the decision-maker would like to improve is part of this couple, and such a criterion is called a priority criterion, which we designate q ∈ K .

Step 3. Numerical limits of the change of the size of a priority of criterion q ∈ K are defined.

For priority criterion q ∈ K from the matrix of Equation (34) we define the numerical limits of the change of the size of criterion:

in physical units of f k ( X o ) ≤ f q ( X ) ≤ f q ( X q * ) , k ∈ K , (36)

where f q ( X q * ) derives from the matrix of Equation (34) F(X^{*}), all criteria showing sizes measured in physical units, f_{q}(X^{o}) from Equation (35), and,

in relative units of λ k ( X o ) ≤ λ q ( X ) ≤ λ q ( X q * ) , k ∈ K , (37)

where λ q ( X q * ) derives from the matrix λ ( X * ) , all criteria showing sizes measured in relative units (we note that λ q ( X q * ) = 1 ), λ q ( X o ) from Equation (34).

As a rule, Equations (36) and (37) are given for the display of the analysis.

Step 4. Choice of the size of priority criterion (decision-making).

The person making the decision carries out the analysis of the results of calculations of Equation (34) and from the inequality of Equation (36) chooses the numerical size f_{q} of the criterion of q ∈ K :

f q ( X o ) ≤ f q ≤ f q ( X q * ) , q ∈ K . (38)

For the chosen size of the criterion of f_{q} it is necessary to define a vector of unknown X^{o}. For this purpose, we carry out the subsequent calculations.

Step 5. Calculation of a relative assessment.

For the chosen size of the priority criterion of f_{q} the relative assessment is calculated as:

λ q = f q − f q 0 f q * − f q 0 , (39)

which upon transition from point X^{o} to X q * , according to Equation (32), lies in the limits:

λ q ( X o ) ≤ λ q ≤ λ q ( X q * ) = 1 .

Step 6. Calculation of the coefficient of linear approximation.

Assuming a linear nature of the change of criterion of f_{q}(X) in Equation (36) and according to the relative assessment of λ q ( X ) in Equation (37), using standard methods of linear approximation we calculate the proportionality coefficient between λ q ( X o ) , λ q , which we call ρ :

ρ = λ q − λ q ( X o ) λ q * − λ q 0 , q ∈ K .

Step 7. Calculation of coordinates of priority criterion with the size f_{q}.

In accordance with Equation (38), the coordinates of the X^{q} priority criterion point lie within the following limits: ρ = λ q − λ q ( X o ) λ q * − λ q 0 , q ∈ K . Assuming a linear nature of change of the vector X q = { x 1 q , ⋯ , x N q } we determine coordinates

of a point of priority criterion with the size f_{q} with the relative assessment of Equation (39):

X q = { x 1 q = x 1 o + ( x q * ( 1 ) − x 1 o ) , ⋯ , x N q = x N o + ( x q * ( N ) − x N o ) } , (40)

where X o = { x 1 o , ⋯ , x N o } , X q * = { x q * ( 1 ) , ⋯ , x q * ( N ) } .

Step 8. Calculation of the main indicators of a point x_{q}.

For the obtained point x_{q}, we calculate:

all criteria in physical units F q = { f k ( x q ) , k = 1 , K ¯ } ;

all relative estimates of criteria λ q = { λ k q , k = 1 , K ¯ } , λ k ( x q ) = f k ( x q ) − f k 0 f k * − f k 0 , k = 1 , K ¯ ;

the vector of priorities P q = { p k q = λ q ( x q ) λ k ( x q ) , k = 1 , K ¯ } ;

the maximum relative assessment λ o q = min ( p k q λ k ( x q ) , k = 1 , K ¯ ) .

Any point from Pareto’s set X t o = { λ t o , X t o } ∈ S o can be similarly calculated.

Analysis of results. The calculated size of criterion f q ( X t o ) , q ∈ K is usually not equal to the set f_{q}. The error of the choice of f q = | f q ( X t o ) − f q | is defined by the error of linear approximation.

As the object of the study we consider “Engineering Systems,” for which the construction of a mathematical model for three types of engineering problems in the form of a vector problem in the second section is presented. The engineering system study is carried out, first, under conditions of certainty, when data on functional characteristics of the engineering system are known; second, in uncertainty conditions where discrete values of individual characteristics are known; there are also known data on limitations imposed on the operation of the system. Mathematical apparatus of engineering system modeling is based on theory and methods of vector optimization, which are presented in the third section. In organizational terms, the process of modeling and simulation of the technical system is presented in the form of a methodology: “Methodology of selection of optimal parameters of engineering systems in conditions of certainty and uncertainty.”

The methodology includes a number of stages.

1) Formation of the technical specification (source data) for numerical modeling and choice of optimum parameters of a system. The initial data is formed by the designer who projects the system.

2) Construction of mathematical and numerical models of the technical system in terms of certainty and uncertainty.

3) The solution of the vector problem of mathematical programming (VPMP) —a model of the Engineering system at equivalent criteria.

4) Creation of geometrical interpretation of results of the decision in a three-dimensional coordinate system in relative units.

5) The solution of a vector problem of mathematical programming—a model of theEngineering system at the given priority of the criterion.

6) Geometrical interpretation of results of the decision in a three-dimensional coordinate system in physical units.

The problem of numerical modeling and simulation of a technical system in which data on a certain set of functional characteristics (conditions of certainty), discrete values of characteristics (conditions of uncertainty) and restrictions imposed on the functioning of the technical system are known is considered [

Stage 1. Formation of technical specifications (initial data)

It is given. We’re investigating the technical (engineering) system. The functioning of the technical system is determined by four parameters X = { x 1 , x 2 , x 3 , x 4 } , which represent the vector of controlled variables. The parameters of the technical system are set within the following limits:

22 ≤ x 1 ≤ 88 , 0 ≤ x 2 ≤ 66 , 2.2 ≤ x 3 ≤ 8.8 , 2.2 ≤ x 4 ≤ 8.8 . (41)

The operation of the technical system is determined by four characteristics (criteria):

F ( X ) = { f 1 ( X ) , f 2 ( X ) , f 3 ( X ) , f 4 ( X ) } , which size of an assessment depends on a vector of X.

The conditions of certainty. For four characteristics of f_{4}(X) and f_{3}(X) functional dependence on parameters X = { x j , j = 1 , N ¯ , N = 4 } is known.

f 4 ( X ) = 19.253 − 0.0081 ∗ x 1 − 0.7005 ∗ x 2 − 0.3605 ∗ x 3 + 0.9769 ∗ x 4 + 0.0126 ∗ x 1 ∗ x 2 + 0.0644 ∗ x 1 ∗ x 3 − 0 ∗ x 1 ∗ x 4 + 0.0396 ∗ x 2 ∗ x 3 + 0.0002 ∗ x 2 ∗ x 4 + 0.0004 ∗ x 3 ∗ x 4 − 0.0016 ∗ x 1 2 + 0.0027 ∗ x 2 2 + 0.0045 ∗ x 3 2 − 0.0235 ∗ x 4 2 (42)

The uncertainty condition. For the first, second and third characteristic the results of experimental data are known: the values of the parameters and corresponding characteristics. Numerical values of parameters X and characteristics of y_{1}(X), y_{2}(X) and y_{3}(X) are presented in

Decision, assessment size of the first and the third characteristic (criterion) is possible to receive above: f 1 ( X ) → max f 3 ( X ) → max ; for the second and fourth characteristic is possible below:

y 2 ( X ) → min f 4 ( X ) → min . Parameters X = { x 1 , x 2 , x 3 , x 4 } change in the following limits:

x 1 ∈ [ 22 55 88 ] , x 2 ∈ [ 0 33 66 ] , x 3 ∈ [ 2.2 5.5 8.8 ] , x 4 ∈ [ 2.2 5.5 8.8 ] (43)

It is required. To construct model of the system in the form of a vector problem. To solve a vector problem with equivalent criteria. To choose priority criterion. To establish numerical value of priority criterion. To make the best decision (optimum) with a specified priority criterion.

Note. The author developed in the Matlab system the software for the decision of vector problem of mathematical programming. The vector problem includes four variables (parameters of technical system): X = { x 1 , x 2 , x 3 , x 4 } and four criteria (characteristic) of F ( X ) = { f 1 ( X ) , f 2 ( X ) , f 3 ( X ) , f 4 ( X ) } . But for each new data (new system) the program is configured individually. In the software criteria of F ( X ) = { f 1 ( X ) , f 2 ( X ) , ⋯ , f 6 ( X ) } with uncertainty conditions (in

Stage 2. Creation of mathematical and numerical model of the system in the conditions of definiteness and indeterminacy

The Creating a numerical model of the system includes the following sections: Choosing a mathematical model of the system; Building a model in certainty conditions; Construction in the conditions of not certainty; Construction of a numerical model of the system under certainty and uncertainty.

Mathematical model of the system

We will present model of the system in the conditions of definiteness and uncertainty in total:

O p t F ( X ) = { max F 1 ( X ) = { max f k ( X ) , k = 1 , K 1 d e f ¯ } , (44)

max I 1 ( X ) ≡ { max f k ( X i , i = 1 , M ¯ ) } T , k = 1 , K 1 u n c ¯ } , (45)

min F 2 ( X ) = { min f k ( X ) , k = 1 , K 2 d e f ¯ , (46)

min I 2 ( X ) ≡ { min f k ( X i , i = 1 , M ¯ ) } T , k = 1 , K 2 u n c ¯ } } , (47)

at restriction f k min ≤ f k ( X ) ≤ f k max , k = 1 , K ¯ , x j min ≤ x j ≤ x j max , j = 1 , N ¯ , (48)

x_{1} | x_{2} | x_{3} | x_{4} | y_{1}(X) → max | y_{2}(X) → min | y_{3}(X) → max |
---|---|---|---|---|---|---|

22 22 22 22 22 22 22 22 22 22 22 22 22 22 22 22 22 22 22 22 22 22 22 22 22 22 22 55 55 55 55 55 55 55 55 55 55 55 55 55 55 55 | 0 0 0 0 0 0 0 0 0 33 33 33 33 33 33 33 33 33 66 66 66 66 66 66 66 66 66 0 0 0 0 0 0 0 0 0 33 33 33 33 33 33 | 2.2 2.2 2.2 5.5 5.5 5.5 8.8 8.8 8.8 2.2 2.2 2.2 5.5 5.5 5.5 8.8 8.8 8.8 2.2 2.2 2.2 5.5 5.5 5.5 8.8 8.8 8.8 2.2 2.2 2.2 5.5 5.5 5.5 8.8 8.8 8.8 2.2 2.2 2.2 5.5 5.5 5.5 | 2.2 5.5 8.8 2.2 5.5 8.8 2.2 5.5 8.8 2.2 5.5 8.8 2.2 5.5 8.8 2.2 5.5 8.8 2.2 5.5 8.8 2.2 5.5 8.8 2.2 5.5 8.8 2.2 5.5 8.8 2.2 5.5 8.8 2.2 5.5 8.8 2.2 5.5 8.8 2.2 5.5 8.8 | 363.0 374.0 382.8 388.3 396.0 401.5 413.6 419.1 429.0 275.0 283.8 289.3 297.0 306.9 311.3 319.0 331.1 341.0 187.0 192.5 203.5 209.0 217.8 224.4 231.0 243.1 253.0 11.0 17.6 26.4 33.0 41.8 48.4 55.0 66.0 77.0 451.0 458.7 465.3 473.0 482.9 488.4 | 1053.8 1067.0 1078.0 1111.0 1155.0 1152.8 1151.7 1148.4 1147.3 1964.6 1974.5 1983.3 1995.4 2003.1 2015.2 2027.3 2046.0 2058.1 2708.2 2585.0 2541.0 2519.0 2596.0 2662.0 2770.9 2783.0 2801.7 3284.6 3301.1 3307.7 3315.4 3320.9 3334.1 3347.3 3366.0 3378.1 1095.6 1111.0 1133.0 1147.3 1166.0 1188.0 | 47.7 47.3 47.2 50.7 46.8 46.3 44.2 43.0 42.5 58.3 57.5 57.1 56.5 55.1 54.9 54.8 52.8 53.0 75.9 71.5 68.2 66.4 68.2 70.4 72.4 71.5 70.6 100.5 100.1 99.0 98.8 97.9 97.6 97.0 95.7 95.3 54.6 50.6 48.4 47.7 46.2 45.1 |

55 55 55 55 55 55 55 55 55 55 55 55 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 | 33 33 33 66 66 66 66 66 66 66 66 66 0 0 0 0 0 0 0 0 0 33 33 33 33 33 33 33 33 33 66 66 66 66 66 66 66 66 66 | 8.8 8.8 8.8 2.2 2.2 2.2 5.5 5.5 5.5 8.8 8.8 8.8 2.2 2.2 2.2 5.5 5.5 5.5 8.8 8.8 8.8 2.2 2.2 2.2 5.5 5.5 5.5 8.8 8.8 8.8 2.2 2.2 2.2 5.5 5.5 5.5 8.8 8.8 8.8 | 2.2 5.5 8.8 2.2 5.5 8.8 2.2 5.5 8.8 2.2 5.5 8.8 2.2 5.5 8.8 2.2 5.5 8.8 2.2 5.5 8.8 2.2 5.5 8.8 2.2 5.5 8.8 2.2 5.5 8.8 2.2 5.5 8.8 2.2 5.5 8.8 2.2 5.5 8.8 | 495.0 506.0 517.0 451.0 459.8 465.3 473.0 480.7 488.4 495.0 506.0 517.0 363.0 371.8 377.3 385.0 393.8 399.3 407.0 418.0 429.0 187.0 195.8 200.2 209.0 217.8 224.4 231.0 242.0 253.0 539.0 547.8 553.3 561.0 569.8 575.3 583.0 595.1 605.0 | 1208.9 1232.0 1272.7 1995.4 2013.0 2035.0 2058.1 2095.5 2103.2 2120.8 2145.0 2183.5 2739.0 2761.0 2783.0 2801.7 2849.0 2893.0 2974.4 2959.0 2927.1 3315.4 3336.3 3355.0 3378.1 3399.0 3421.0 3440.8 3366.0 3503.5 1116.5 1144.0 1166.0 1208.9 1232.0 1276.0 1303.5 1342.0 1397.0 | 44.2 42.2 40.7 61.8 60.5 59.4 58.3 57.2 56.1 54.8 47.3 51.3 79.4 78.1 77.0 75.9 76.1 76.6 76.8 71.5 68.2 104.1 102.3 101.2 100.5 99.0 97.9 97.0 95.7 93.5 58.3 56.1 55.0 53.0 50.6 48.4 47.7 44.0 42.5 |
---|---|---|---|---|---|---|

Minimum value | 11.0 | 1053.8 | 40.7 | |||

Maximum value | 605.0 | 3503.5 | 104.1 | |||

The index of correlation | 0.6849 | 0.7149 | 0.6551 | |||

Coefficient of determination | 0.4611 | 0.5111 | 0.4292 |

vector of operated variable (design data); F ( X ) = { F 1 ( X ) F 2 ( X ) I 1 ( X ) , I 2 ( X ) } —vector criterion (41)-(44) which everyone a component represents a vector of criteria (characteristics) of the system which functionally depend on discrete values of a vector of variables X = { x j , j = 1 , N ¯ } ;

F 1 ( X ) = { f k ( X ) , k = 1 , K 1 d e f ¯ } , F 2 ( X ) = { f k ( X ) , k = 1 , K 2 d e f ¯ } —a set of the max and min functions respectively;

I 1 ( X ) = { { f k ( X i , i = 1 , M ¯ ) } T , k = 1 , K 1 u n c ¯ } 1 , N ¯ ,

I 2 ( X ) = { { f k ( X i , i = 1 , M ¯ ) } T , k = 1 , K 2 u n c ¯ } —set of matrixes of max and min respectively; K 1 d e f , K 2 d e f (definiteness), K 1 u n c , K 2 u n c (uncertainty) the set of criteria of max and min created in the conditions of definiteness and uncertainty;

In (48) f k min ≤ f k ( X ) ≤ f k max , k = 1 , K ¯ —a vector function of the restrictions imposed on functioning of technical system; x j min ≤ x j ≤ x j max , j = 1 , N ¯ —parametrical restrictions.

It is assumed that the functions f k ( X ) , k = 1 , K ¯ are differentiable and convex, g i ( X ) , i = 1 , M ¯ are continuous, and the set of admissible points S given by constraints (8) is non-empty and is a compact:

S = { X ∈ R n | G ( X ) ≤ 0 , X min ≤ X ≤ X max } ≠ ∅ .

Building a model in certainty conditions;

Construction in conditions of certainty is determined by the functional dependence of each characteristic and constraints on the parameters of the technical system. In our example, characteristic (42) and constraints (41) are known. Using data (41), (42) we construct a two-criterion problem of nonlinear programming in conditions of certainty:

f 4 ( X ) = 19.253 − 0.0081 ∗ x 1 − 0.7005 ∗ x 2 − 0.3605 ∗ x 3 + 0.9769 ∗ x 4 + 0.0126 ∗ x 1 ∗ x 2 + 0.0644 ∗ x 1 ∗ x 3 − 0 ∗ x 1 ∗ x 4 + 0.0396 ∗ x 2 ∗ x 3 + 0.0002 ∗ x 2 ∗ x 4 + 0.0004 ∗ x 3 ∗ x 4 − 0.0016 ∗ x 1 2 + 0.0027 ∗ x 2 2 + 0.0045 ∗ x 3 2 − 0.0235 ∗ x 4 2 (49)

restrictions: 22 ≤ x 1 ≤ 88 , 0 ≤ x 2 ≤ 66 , 2.2 ≤ x 3 ≤ 8.8 , 2.2 ≤ x 4 ≤ 8.8 (50)

These data are used further at creation of mathematical model of technical system.

Construction in the conditions of not certainty.

Construction in the conditions of uncertainty consists in use of the qualitative and quantitative descriptions of technical system received by the principle “input-output” in

I = | X , Y | = { x i 1 , x i 2 , x i 3 , x i 4 , y i 2 , y i 3 , i = 1 , M ¯ } . (51)

For each set experimental these y k , k = 2 , 3 function of regression on a method of the smallest squares min ∑ i = 1 M ( y i − y i ¯ ) 2 in MATLAB. A_{k}, —polynomial defining interrelation of the parameters.

X i = { x i 1 , x i 2 , x i 3 , x i 4 } and functions y k i ¯ = f ( X i , A k ) , k = 2 , 3 is for this purpose formed.

As a result of calculations we received system of coefficients of A k = { A 0 k , A 1 k , ⋯ , A 14 k } which define coefficients of quadratic a polynomial (function):

f k ( X , A ) = A 0 k + A 1 k x 1 + A 2 k x 2 + A 3 k x 3 + A 4 k x 4 + A 5 k x 1 ∗ x 2 + A 6 k x 1 ∗ x 3 + A 7 k x 1 ∗ x 4 + A 8 k x 2 ∗ x 3 + A 9 k x 2 ∗ x 4 + A 10 k x 3 ∗ x 4 + A 11 k x 1 2 + A 12 k x 2 2 + A 13 k x 3 2 + A 14 k x 4 2 , k = 1 , 2 , 3 (52)

As a result of calculations of coefficients of A k , k = 3 , we received the f_{1}(X), f_{2}(X) and f_{3}(X) function:

f 1 ( X ) = 296.85 − 1.874 ∗ x 1 − 2.911 ∗ x 2 + 8.939 ∗ x 3 + 10.936 ∗ x 4 + 0.0734 ∗ x 1 ∗ x 2 − 0.0047 ∗ x 1 ∗ x 3 − 0.0128 ∗ x 1 ∗ x 4 + 0.0563 ∗ x 2 ∗ x 3 − 0.0789 ∗ x 2 ∗ x 4 − 0.0025 ∗ x 3 ∗ x 4 + 0.0108 ∗ x 1 2 + 0.0089 ∗ x 2 2 − 0.1844 ∗ x 3 2 − 0.3808 ∗ x 4 2 (53)

f 2 ( X ) = 875.3 + 23.893 ∗ x 1 − 30.866 * x 2 − 25.858 ∗ x 3 − 45 ∗ x 4 − 0.6984 ∗ x 1 ∗ x 2 + 0.4276 ∗ x 1 ∗ x 3 + 0.6793 ∗ x 1 ∗ x 4 − 0.1167 ∗ x 2 ∗ x 3 + 0.2969 ∗ x 2 ∗ x 4 − 0.0093 ∗ x 3 ∗ x 4 + 0.0362 ∗ x 1 2 + 0.0331 ∗ x 2 2 + 2.9158 ∗ x 3 2 + 2.4052 ∗ x 4 2 (54)

f 3 ( X ) = 43.734 + 0.6598 ∗ x 1 + 0.4493 ∗ x 2 − 0.3094 ∗ x 3 − 1.8334 ∗ x 4 − 0.01 ∗ x 1 ∗ x 2 − 0.0062 ∗ x 1 ∗ x 3 + 0.0146 ∗ x 1 ∗ x 4 − 0.013 ∗ x 2 ∗ x 3 + 0.0121 ∗ x 2 ∗ x 4 − 0.0004 ∗ x 3 ∗ x 4 − 0.0003 ∗ x 1 2 − 0.0002 ∗ x 2 2 + 00.0254 ∗ x 3 2 + 0.0939 ∗ x 4 2 (55)

The minimum and maximum values of experimental data y 1 ( X ) , y 2 ( X ) , y 3 ( X ) are presented in the lower part of

Construction of a numerical model of the system under certainty and uncertainty.

For creation of numerical model of the system we used: the functions received conditions of definiteness (9) and uncertainty (53), (54), (55); parametrical restrictions (50).We considered functions (49) and (53), (54), (55) as the criteria defining focus of functioning of the system. A set of criteria K = 4 included two criteria of f 1 ( X ) , f 3 ( X ) → max and two f 2 ( X ) , f 4 ( X ) → min . As a result model of functioning of the system was presented a vector problem of mathematical programming:

o p t F ( X ) = { max F 1 ( X ) = { max f 1 ( X ) ≡ 296.85 − 1.874 ∗ x 1 − 2.911 ∗ x 2 + 8.939 ∗ x 3 + 10.936 ∗ x 4 + 0.0734 ∗ x 1 ∗ x 2 − 0.0047 ∗ x 1 ∗ x 3 − 0.0128 ∗ x 1 ∗ x 4 + 0.0563 ∗ x 2 ∗ x 3 − 0.0789 ∗ x 2 ∗ x 4 − 0.0025 ∗ x 3 ∗ x 4 + 0.0108 ∗ x 1 2 + 0.0089 ∗ x 2 2 − 0.1844 ∗ x 3 2 − 0.3808 ∗ x 4 2 , (56)

max f 3 ( X ) ≡ 43.734 + 0.6598 ∗ x 1 + 0.4493 ∗ x 2 − 0.3094 ∗ x 3 − 1.8334 ∗ x 4 − 0.01 ∗ x 1 ∗ x 2 − 0.0062 ∗ x 1 ∗ x 3 + 0.0146 ∗ x 1 ∗ x 4 − 0.013 ∗ x 2 ∗ x 3 + 0.0121 ∗ x 2 ∗ x 4 − 0.0004 ∗ x 3 ∗ x 4 − 0.0003 ∗ x 1 2 − 0.0002 ∗ x 2 2 + 00.0254 ∗ x 3 2 + 0.0939 ∗ x 4 2 } , (57)

min F 1 ( X ) = { min f 2 ( X ) ≡ 875.3 + 23.893 ∗ x 1 − 30.866 ∗ x 2 − 25.858 ∗ x 3 − 45 ∗ x 4 − 0.6984 ∗ x 1 ∗ x 2 + 0.4276 ∗ x 1 ∗ x 3 + 0.6793 ∗ x 1 ∗ x 4 − 0.1167 ∗ x 2 ∗ x 3 + 0.2969 ∗ x 2 ∗ x 4 − 0.0093 ∗ x 3 ∗ x 4 + 0.0362 ∗ x 1 2 + 0.0331 ∗ x 2 2 + 2.9158 ∗ x 3 2 + 2.4052 ∗ x 4 2 , (58)

min f 4 ( X ) ≡ 19.253 − 0.0081 ∗ x 1 − 0.7005 ∗ x 2 − 0.3605 ∗ x 3 + 0.9769 ∗ x 4 + 0.0126 ∗ x 1 ∗ x 2 + 0.0644 ∗ x 1 ∗ x 3 − 0 ∗ x 1 ∗ x 4 + 0.0396 ∗ x 2 ∗ x 3 + 0.0002 ∗ x 2 ∗ x 4 + 0.0004 ∗ x 3 ∗ x 4 − 0.0016 ∗ x 1 2 + 0.0027 ∗ x 2 2 + 0.0045 ∗ x 3 2 − 0.0235 * x 4 2 } } , (59)

restrictions: 22 ≤ x 1 ≤ 88 , 0 ≤ x 2 ≤ 66 , 2.2 ≤ x 3 ≤ 8.8 , 2.2 ≤ x 4 ≤ 8.8 . (60)

The vector problem of mathematical programming (56)-(60) represents the model decision making under certainty and uncertainty in the aggregate.

Stage 3. The solution of the vector problem of mathematical programming (VPMP)—model of the system at equivalent criteria.

To solve the vector problems of mathematical programming (56)-(60), methods based on the axioms of the normalization of criteria and the principle of guaranteed results are presented, which follow from axiom 1 and the principle of optimality 1.

The solution of a vector problem (56)-(60) with was submitted as sequence of steps.

Step 1. Problems (54)-(58) were solved by each criterion separately, thus used the function fmincon (…) of Matlab system, the appeal to the function fmincon (…) is considered in [

As a result of calculation for each criterion we received optimum points: X k * and f k * = f k ( X k * ) , k = 1 , K ¯ —sizes of criteria in this point, i.e. the best decision on each criterion:

X 1 * = { x 1 = 88.0 , x 2 = 66.0 , x 3 = 8.8 , x 4 = 2.2 } , f 1 * = f 1 ( X 1 * ) = − 535.06 ;

X 2 * = { x 1 = 22.0 , x 2 = 0.0 , x 3 = 2.83 , x 4 = 6.25 } , f 2 * = f 2 ( X 2 * ) = 1301.2 ;

X 3 * = { x 1 = 88.0 , x 2 = 0.0 , x 3 = 2.2 , x 4 = 8.8 } , f 3 * = f 3 ( X 3 * ) = − 100.15 ;

X 4 * = { x 1 = 22.0 , x 2 = 62.17 , x 3 = 2.2 , x 4 = 2.2 } , f 4 * = f 4 ( X 4 * ) = 12.247 .

Restrictions (58) and points of an optimum X 1 * , X 2 * , X 3 * , X 4 * in coordinates {x_{1}, x_{2}} are presented on

Step 2. We defined the worst unchangeable part of each criterion (anti-optimum):

X 1 0 = { x 1 = 22.0 , x 2 = 66.0 , x 3 = 2.2 , x 4 = 2.2 } , f 1 0 = f 1 ( X 1 0 ) = 243.25 ;

X 2 0 = { x 1 = 88.0 , x 2 = 0.0 , x 3 = 8.8 , x 4 = 8.8 } , f 2 0 = f 2 ( X 2 0 ) = − 3903.1 ;

X 3 0 = { x 1 = 22.0 , x 2 = 0.0 , x 3 = 8.8 , x 4 = 8.07 } , f 3 0 = ( X 3 0 ) = 50.03 ;

X 4 0 = { x 1 = 88.0 , x 2 = 66.0 , x 3 = 8.8 , x 4 = 8.8 } , f 4 0 = f 4 ( X 4 0 ) = − 121.83 .

Step 3. Performed system analysis of a set of points, optimum across Pareto, (i.e. the analysis for each criterion). In points of an optimum of X * = { X 1 * , X 2 * , X 3 * , X 4 * } sizes of criterion functions of F ( X * ) = ‖ f q ( X k * ) ‖ q = 1 , K ¯ k = 1 , K ¯ determined. Calculated a

vector of F = ( d 1 d 2 d 3 d 4 ) T —deviations by each criterion on an admissible set of S: d k = f k * − f k 0 , k = 1 , 4 ¯ , and matrix of relative estimates of

d k = f k * − f k 0 , k = 1 , 4 ¯ , where λ k ( X ) = ( f k * − f k 0 ) / d k .

F ( X * ) = ‖ 535.1 1731.9 58.1 117.0 317.6 1301.2 51.3 26.5 192.5 3614.3 100.2 24.6 244.0 2458.2 67.7 12.2 ‖ , d k = ‖ 291.8 − 2602.0 50.12 − 109.58 ‖ ,

λ ( X * ) = ‖ 1.0000 0.8345 0.1603 0.0443 0.2548 1.0000 0.0244 0.8697 − 0.1740 0.1110 1.0000 0.8870 0.0027 0.5553 0.3532 1.0000 ‖ . (61)

The analysis of sizes of criteria in relative estimates showed that in points of an optimum of X * = { X 1 * , X 2 * , X 3 * , X 4 * } the relative assessment is equal to unit. Other criteria there is much less than unit. It is required to find such point (parameters) at which relative estimates are closest to unit. The steps 4, 5 are directed on the solution of this problem.

Step 4. Creation of λ-problem is carried out in two stages: originally the maximine problem ofoptimization with the normalized criteria is under construction:

λ o = max X ∈ S min k ∈ K λ k ( X ) , G ( X ) ≤ 0 , X ≥ 0 , (62)

which at the second stage was transformed to a standard problem of mathematical programming (λ-problem):

λ o = max λ , (63)

at restrictions λ − f 1 ( X ) − f 1 0 f 1 * − f 1 0 ≤ 0 , (64)

λ − f 3 ( X ) − f 3 0 f 3 * − f 3 0 ≤ 0 , (65)

λ − f 2 ( X ) − f 2 0 f 2 * − f 2 0 ≤ 0 , (66)

λ − f 4 ( X ) − f 4 0 f 4 * − f 4 0 ≤ 0 , (67)

0 ≤ λ ≤ 1 , 22 ≤ x 1 ≤ 88 , 0 ≤ x 2 ≤ 66 , 2.2 ≤ x 3 ≤ 8.8 , 2.2 ≤ x 4 ≤ 8.8 , (68)

where the vector of unknown had dimension of N + 1: X = { x 1 , ⋯ , x N , λ } ; the functions f_{1}(X), f_{2}(X), f_{3}(X), f_{4}(X) correspond (64)-(68) respectively. Substituting the numerical values of the functions f_{1}(X), f_{2}(X), f_{3}(X), f_{4}(X), we get the l-problem of the following form:

λ o = max λ , (69)

at restrictions λ − 296.8 − 1.874 ∗ x 1 − 2.91 ∗ x 2 − ⋯ − 0.184 ∗ x 3 2 − 0.38 ∗ x 4 2 − f 1 0 f 1 * − f 1 0 ≤ 0 , (70)

λ − 43.734 + 0.6598 ∗ x 1 + 0.449 ∗ x 2 − ⋯ + 0.0254 ∗ x 3 2 + 0.0939 ∗ x 4 2 − f 3 0 f 3 * − f 3 0 ≤ 0 , (71)

λ − 875.3 + 23.9 ∗ x 1 − 30.8 ∗ x 2 − ⋯ + 2.9158 ∗ x 3 2 + 2.4052 ∗ x 4 2 − f 2 0 f 2 * − f 2 0 ≤ 0 , (72)

λ − 19.253 − 0.0081 ∗ x 1 − 0.7005 ∗ x 2 − ⋯ + 0.0045 ∗ x 3 2 − 0.0235 ∗ x 4 2 − f 4 0 f 4 * − f 4 0 ≤ 0 , (73)

0 ≤ λ ≤ 1 , 22 ≤ x 1 ≤ 88 , 0 ≤ x 2 ≤ 66 , 2.2 ≤ x 3 ≤ 8.8 , 2.2 ≤ x 4 ≤ 8.8 , (74)

Appeal to function fmincon(…):

[Xo, Lo] = fmincon (‘Z_TehnSist_4Krit_L’, X0, Ao, bo, Aeq, beq, lbo, ubo, ’Z_TehnSist_LConst’, options).

As a result of the solution of a vector problem of mathematical programming (56)-(60) at equivalent criteria and λ-problem corresponding to it (69)-(74) received:

X o = { X o , λ o } = { X o = { x 1 = 52.9 , x 2 = 36.097 , x 3 = 8.8 , x 4 = 2.2 } , λ o = 0.3179 } , (75)

an optimum point—design data of the system, point X^{o} is presented in

f k ( X o ) , k = 1 , K ¯ —sizes of criteria (characteristics of technical system):

{ f 1 ( X o ) = 336.0 , f 2 ( X o ) = 2239.5 , f 3 ( X o ) = 65.962 , f 4 ( X o ) = 58.435 } ; (76)

λ k ( X o ) , k = 1 , K ¯ —sizes of relative estimates:

{ λ 1 ( X o ) = 0.3179 , λ 2 ( X o ) = 0.6394 , λ 3 ( X o ) = 0.3179 , λ 4 ( X o ) = 0.5785 } ; (77)

λ o = 0.3179 is the maximum lower level among all relative estimates measured in relative units:

λ o = min ( λ 1 ( X o ) , λ 2 ( X o ) , λ 3 ( X o ) , λ 4 ( X o ) ) = 0.3179 .

A relative assessment—λ^{o} call the guaranteed result in relative units, i.e. λ k ( X o ) and according to the characteristic of technical f_{k}(X^{o}) system it is impossible to improve, without worsening thus other characteristics.

We will notice that according to Theorem 1, in X^{o} point criteria 1, 3 are contradictory. This contradiction is defined by equality of λ 1 ( X o ) = λ 3 ( X o ) = λ o = 0.3179 , and other criteria an inequality of { λ 2 ( X o ) = 0.6394 , λ 4 ( X o ) = 0.5785 } > λ o .

Thus, Theorem 1 forms a basis for determination of correctness of the solution of a vector problem. In a vector problem of mathematical programming, as a rule, for two criteria equality is carried out:

λ o = λ q ( X o ) = λ p ( X o ) , q , p ∈ K , X ∈ S ,

and for other criteria is defined as an inequality: λ o ≤ λ k ( X o ) , ∀ k ∈ K , q ≠ p ≠ k .

Stage 4. Creation of geometrical interpretation of results of the decision in a three-dimensional coordinate system in relative units.

In an admissible set of points of S formed by restrictions (74), optimum points X 1 * , X 2 * , X 3 * , X 4 * united in a contour, presented a set of points, optimum across Pareto, to S o ⊂ S ,

Coordinates of these points, and also characteristics of technical system in relative units of λ 1 ( X ) , λ 2 ( X ) , λ 3 ( X ) , λ 4 ( X ) are shown in

Discussion. Looking at a _{3}(X) function is created from the functions f_{3}(X) with variable coordinates {x_{1}, x_{2}} and with constant coordinates { x 3 = 8.8 , x 4 = 2.2 } , taken from an optimum point X^{o}(75). In a point X 3 * the relative assessment of λ 3 ( X 3 * ) = 0.83 —is shown in

But we know that the relative assessment of λ 3 ( X 3 * ) received from the f 3 ( X 3 * ) function on the third step is equal to unit, we will designate it as λ 3 Δ ( X 3 * ) = 1 — is shown in

The point X 1 * and appropriate relative estimates of λ 1 ( X 1 * ) and λ 1 Δ ( X 1 * ) is similarly shown.

Thus, for the first time in domestic and foreign practice transition and its geometrical illustration from N-dimensional to two-dimensional measurement of function is shown in vector problems of mathematical programming with the appropriate errors.

Stage 5. The solution of a vector problem of mathematical programming— model of the system at the given priority of the criterion.

The decision maker is usually the system designer.

Step 1. We solve a vector problem with equivalent criteria. The algorithm of the decision is presented in Stage 3. Numerical results of the solution of the vector problem are given above.

Pareto’s great number of S o ⊂ S lies between optimum points X 1 * X o X 3 * X o X 4 * X o X 2 * X o X 1 * .

We will carry out the analysis of a great number of Pareto S o ⊂ S . For this purpose we will connect auxiliary points: X 1 * X 3 * X 4 * X 2 * X 1 * with a point X^{o} which conditionally represents the center of a great number of Pareto. As a result have received four subsets of points X ∈ S q o ⊂ S o ⊂ S , q = 1 , 4 ¯ . The subset of S 1 o ⊂ S o ⊂ S is characterized by the fact that the relative assessment of λ 1 ≥ λ 2 , λ 3 , λ 4 , i.e. in the field of S 1 o first criterion has a priority over the others. Similar to S 2 o , S 3 o , S 4 o —subsets of points where the second, third and fourth criterion has a priority over the others respectively. Set of points, optimum across Pareto we will designate S o = S 1 o ∪ S 2 o ∪ S 3 o ∪ S 4 o . Coordinates of all received points and relative estimates are presented in two-dimensional space {x_{1}, x_{2}} in _{1}, x_{2}, λ} in

Step 2. Choice of priority criterion of q ∈ K . From the theory (see Theorem 1) it is known that in an optimum point of X^{o} always there are two most inconsistent criteria, q ∈ K and p ∈ K for which in relative units exact equality is carried out: λ o = λ q ( X o ) = λ p ( X o ) , q , p ∈ K , X ∈ S , and for the others it is carried out inequalities:

λ o ≤ λ k ( X o ) , ∀ k ∈ K , q ≠ p ≠ k .

In model of the system (54)-(58) and the corresponding λ-problem (67)-(71) such criteria are the first and third:

λ o = λ 1 ( X o ) = λ 3 ( X o ) = 0.3179 . (78)

We will show the λ_{1}(X) and λ_{3}(X) functions separately in

X o = { X o , λ o } .

Here all points and data about which it was told in

As a rule, the criterion which the decision-maker would like to improve gets out of couple of contradictory criteria. Such criterion is called “priority criterion”, we will designate it q = 3 ∈ K . This criterion is investigated in interaction with the first criterion of q = 1 ∈ K . We will allocate these two criteria from all set of the criteria K = 4 shown in

On the display the message is given:

q = input (‘Enter priority criterion (number) of q = ‘)—Have entered: q = 3.

Step 3. Numerical limits of change of size of a priority of criterion of q = 3 ∈ K are defined.

For priority criterion of q = 3 numerical limits in physical units upon transition from a point of an optimum of X^{o}(91) to the point of X q * received on the first step are defined.

Information about the criteria for q = 3 are given on the screen:

f q ( X o ) = 65.96 ≤ f q ( X ) ≤ 100.15 = f q ( X q * ) , q ∈ K . (79)

In relative units the criterion of q = 2 changes in the following limits:

λ q ( X o ) = 0.3179 ≤ λ q ( X ) ≤ 1 = λ q ( X q * ) , q = 3 ∈ K .

These data it is analyzed.

Step 4. Choice of size of priority criterion. q ∈ K . (Decision-making).

The message is displayed: “Enter the size of priority criterion f_{q} = “—we enter, for example, f q = 8 0 .

Step 5. Calculation of a relative assessment.

For the chosen size of priority criterion of f q = 8 0 the relative assessment is calculated:

λ q = f q − f q 0 f q * − f q 0 = 80 − 50.03 10.15 − 50.03 = 0.5979 , (80)

which upon transition from X^{o} point to X q * according to (78) lies in limits:

0.3179 = λ 3 ( X o ) ≤ λ 3 = 0.5979 ≤ λ 3 ( X 3 * ) = 1 , q ∈ K .

Step 6. Calculation of coefficient of linear approximation.

Assuming linear nature of change of criterion of f_{q}(X) in (79) and according to a relative assessment of λ_{q}(X) in (80), using standard methods of linear approximation, we will calculate proportionality coefficient between λ_{q}(X^{o}), λ_{q}, which we will call ρ :

ρ = λ q − λ q ( X o ) λ q ( X q * ) − λ q ( X o ) = 0.5979 − 0.3179 1 − 0.3179 = 0.4106 , q = 3 ∈ K .

Step 7. Calculation of coordinates of priority criterion with the size f_{q}.

Assuming linear nature of change of a vector of X q = { x 1 x 2 } , q = 3 we will determine coordinates of a point of priority criterion with the size f_{q} with a relative assessment (80):

x λ = 0.81 q = 3 = { x 1 = X o ( 1 ) + ρ ( X q * ( 1 ) − X o ( 1 ) ) , x 2 = X o ( 2 ) + ρ ( X q * ( 2 ) − X o ( 2 ) ) } ,

where X o = { X o ( 1 ) = 80.0 , X o ( 2 ) = 69.11 } , X 3 * = { X 3 * ( 1 ) = 80.0 , X 3 * ( 2 ) = 0.0 } .

As a result of calculations we have received point coordinates: X q = { x 1 = 67.31 , x 2 = 21.27 } .

Step 8. Calculation of the main indicators of a point of X_{q}.

For the received X_{q} point, we will calculate:

all criteria in physical units f k ( X q ) = { f k ( X q ) , k = 1 , K ¯ } :

f ( X q ) = { f 1 ( X q ) = 313.45 , f 2 ( X q ) = 2575.7 , f 3 ( X q ) = 74.2 , f 4 ( X q ) = 60.6 } ;

all relative estimates of criteria λ q = { λ k q , k = 1 , K ¯ } , λ k ( X q ) = f k ( X q ) − f k 0 f k * − f k 0 , k = 1 , K ¯ 1 , K ¯ :

λ k ( X q ) = { λ 1 ( X q ) = 0.2405 , λ 2 ( X q ) = 0.5102 , λ 3 ( X q ) = 0.4825 , λ 4 ( X q ) = 0.5586 } 1 , K ¯

minimum relative assessment: minLXq = min ( LXq ) : minLXq = min ( λ k ( X q ) ) = 0.2405 ;

vector of priorities P q ( X ) = { p k q = λ q ( X q ) λ k ( X q ) , k = 1 , K ¯ } :

P q = [ p 1 3 = 2.0061 , p 2 3 = 0.9458 , p 3 3 = 1.0 , p 4 3 = 0.8637 ] ;

relative assessment taking into account a criterion priority:

λ k ( X q ) ∗ P q = { p 1 3 ∗ λ 1 ( X q ) = 0.4825 , p 2 3 ∗ λ 2 ( X q ) = 0.4825 , p 3 3 ∗ λ 3 ( X q ) = 0.4825 , p 4 3 ∗ λ 4 ( X q ) = 0.4825 }

the minimum relative assessment taking into account a criterion priority:

λ o o = min ( p 1 3 λ 1 ( X q ) , p 2 3 λ 2 ( X q ) , p 3 3 λ 3 ( X q ) , p 4 3 λ 4 ( X q ) = 0.4825 )

Any point from Pareto’s set X t o = { λ t o , X t o } ∈ S o can be similarly calculated.

Analysis of results. The calculated size of criterion f q ( X t o ) , q ∈ K is usually not equal to the set f_{q}. The error of the choice of Δ f q = | f q ( X t o ) − f q | = | 74.2 − 80 | = 5.8 is defined by an error of linear approximation, Δ f q % = 7.25 % .

If error Δ f q = | f q ( X t o ) − f q | = | 74.2 − 80 | = 5.8 , measured in physical units or as a percentage Δ f q % = Δ f q f q ∗ 100 = 7.25 % , is more than set Δ f , Δ f q > Δ f ; we pass to a step 2, if Δ f q ≤ Δ f , calculations come to the end.

In the course of modeling parametrical restrictions (74) can be changed, i.e. some set of optimum decisions is received. Choose a final version which in our example included from this set of optimum decisions: parameters of technical system

X o = { X o , λ o } = { X o = { x 1 = 52.9 , x 2 = 36.097 , x 3 = 8.8 , x 4 = 2.2 } , λ o = 0.3179 } ;

the parameters of the technical system at a given priority criterion q = 2:

X q = { x 1 = 67.31 , x 2 = 21.27 } .

Stage 6. Geometrical interpretation of results of the decision in a three-dimensional coordinate system in physical units.

We introduced the parameters:

X o = { X o , λ o } = { X o = { x 1 = 52.9 , x 2 = 36.097 , x 3 = 8.8 , x 4 = 2.2 } , λ o = 0.3179 } ;

in the two-dimensional coordinate system x_{1}, x_{2} on _{1}, x_{2} and λ in

The first characteristic of technical system f 1 ( X ) in x_{1}, x_{2} coordinates is shown in

Indicators f 1 Δ ( X 1 * ) , f 1 Δ ( X 1 o ) of the first of characteristics of the system (are highlighted in red color) define transition errors from four-dimensional X = { x 1 , x 2 , x 3 , x 4 } to two-dimensional X o = { x 1 , x 2 } to system of coordinates.

The second characteristic of technical system f 2 ( X ) in x_{1}, x_{2} coordinates is shown in

Indicators of the second f 2 Δ ( X 2 * ) , f 2 Δ ( X 2 o ) of characteristics of the system (are highlighted in red color) define transition errors from four-dimensional X o = { x 1 , x 2 , x 3 , x 4 } to two-dimensional X o = { x 1 , x 2 } to system of coordinates.

The third characteristic of technical system f 3 ( X ) in x_{1}, x_{2} coordinates is shown in

Indicators of the third f 3 Δ ( X 3 * ) , f 3 Δ ( X 3 o ) of characteristics of the system (are highlighted in red color) define transition errors from four-dimensional X o = { x 1 , x 2 , x 3 , x 4 } to two-dimensional X o = { x 1 , x 2 } to system of coordinates.

The fourth characteristic of technical system f 4 ( X ) in x_{1}, x_{2} coordinates is shown in

Indicators of the fourth f 4 Δ ( X 4 * ) , f 4 Δ ( X 4 o ) , of characteristics of the system (are highlighted in red color) define transition errors from four-dimensional X o = { x 1 , x 2 , x 3 , x 4 } to two-dimensional X o = { x 1 , x 2 } to system of coordinates.

Collectively, the submitted version:

· point—X^{o}; characteristics of F ( X o ) = { f 1 ( X o ) , f 2 ( X o ) , f 3 ( X o ) , f 4 ( X o ) } ;

· relative estimates of λ ( X o ) = { λ 1 ( X o ) , λ 2 ( X o ) , λ 3 ( X o ) , λ 4 ( X o ) } ;

· maximum λ^{o} relative level such that λ o ≤ λ k ( X o ) ∀ k ∈ K .

There is an optimum decision at equivalent criteria (characteristics), and procedure of receiving is adoption of the optimum decision at equivalent criteria (characteristics).

· point—X^{q}; characteristics of F ( X q ) = { f 1 ( X q ) , f 2 ( X q ) , f 3 ( X q ) , f 4 ( X q ) } ;

· relative estimates of λ ( X o ) = { λ 1 ( X q ) , λ 2 ( X q ) , λ 3 ( X q ) , λ 4 ( X q ) } ;

· maximum λ^{o} relative level such that λ o ≤ p k q λ k ( X q ) , k = 1 , K ¯ .

There is an optimal solution at the set priority of the q-th criterion (characteristic) in relation to other criteria. Procedure of receiving a point is X^{q} adoption of the optimal solution at the set priority of the second criterion.

Theory of vector optimization, methods of solution of the vector problems with equivalent criteria and given priority of criterion can choose any point from the set of points, optimum across Pareto, and show the optimality of this point.

We study a technological process for which data are known about a certain set of functional characteristics (certainty conditions), discrete values of characteristics (uncertainty condition) and restrictions imposed on the functioning of the technological process. The numerical problem of modeling a technological process is solved with equivalent criteria and with a given priority of the criterion.

Stage 1. The technical assignment: “The choice of the optimal parameters of the technological process”.

It is given. The technological process, the operation of which is determined by two parameters

X = { x 1 , x 2 } —the vector of variables (controlled). The operation of the process is determined by four characteristics (criteria) F ( X ) = { f 1 ( X ) , f 2 ( X ) , f 3 ( X ) , f 4 ( X ) } , the value of which depends on the vector of parameters Х.

Conditions of certainty. The conditions are characterized by the fact that the functional dependence of the fourth characteristic f_{4}(X) on the parameters of the technological process X = { x 1 , x 2 } is known:

f 4 ( X ) = − 0.2450 − 0.7470 x 1 + 0.3832 x 1 2 + 0.0442 x 2 + 0.0012 x 2 2 − 0.0346 x 1 ∗ x 2 (81)

Conditions of uncertainty. For the first, second and third characteristics of the technological process, the results of experimental data are known: the values of the parameters and the corresponding characteristics. The numerical values of the parameters X and the characteristics y_{1}(X), y_{2}(X), y_{3}(X) are presented in

In the decision taken, the evaluation value for the first, second and third characteristics (criteria) are desirable to get as high as possible: y 1 ( X ) → max , y 2 ( X ) → min , y 3 ( X ) → max , f 4 ( X ) → min . The parameters X = { x 1 , x 2 } vary within the following limits:

2.0 ≤ x 1 ≤ 3.5 , 12.0 ≤ x 2 ≤ 30.0 . (82)

It is required. Build a model of the technological process in the form of a vector problem. Solve the vector problem with equivalent criteria. Choose a priority criterion. Set the numerical value of the priority criterion. Make the best (optimal) solution.

Note. The author has developed software for four parameters: X = { x 1 , x 2 , x 3 , x 4 } and six characteristics F ( X ) = { f 1 ( X ) , ⋯ , f 6 ( X ) } . For each task, the program is configured individually. If desired, the author can increase the number of parameters to five: X = { x 1 , ⋯ , x 5 } . In the model, criteria with uncertainty conditions can vary from zero to six.

Stage 2. Construction of a mathematical model of the technological process [

2.1. Construction in the conditions of a certainty. We form a vector problem for which the criteria (5) and restrictions (6) on the process parameters are known:

f 4 ( X ) = − 0.2450 − 0.7470 x 1 + 0.3832 x 1 2 + 0.0442 x 2 + 0.0012 x 2 2 − 0.0346 x 1 ∗ x 2 , 2.0 ≤ x 1 ≤ 3.5 , 12.0 ≤ x 2 ≤ 30.0. (83)

Laser Power, p (Analog V) | Travel Speed, v (mm/sec) | Wire Feed Rate, r (m/min) | Depth, D(mm) | Total Accumulated Pore Length, Po (mm/mm) |
---|---|---|---|---|

x_{1} | x_{2} | y_{1}(X) → max | y_{2}(X) → min | y_{3}(X) → max |

2.40 | 24.2 | 4.2197 | 55.3951 | −0.0365 |

2.76 | 18.72 | 3.2714 | 31.2497 | 0.0286 |

2.76 | 19.08 | 3.2770 | 32.3886 | 0.0271 |

2.76 | 31.68 | 4.2613 | 86.8526 | 0.0760 |

2.76 | 31.92 | 4.2949 | 88.1656 | 0.0787 |

3.30 | 14.40 | 3.0959 | 21.1331 | 0.3467 |

3.30 | 25.20 | 3.0101 | 56.1913 | 0.2171 |

3.30 | 25.80 | 3.0383 | 58.7506 | 0.2138 |

3.30 | 26.76 | 3.0908 | 62.9794 | 0.2096 |

3.30 | 27.60 | 3.1441 | 66.8147 | 0.2068 |

3.30 | 28.80 | 3.2320 | 72.5126 | 0.2041 |

3.30 | 30.00 | 3.3338 | 78.4682 | 0.2032 |

3.30 | 31.20 | 3.4495 | 84.6812 | 0.2039 |

3.30 | 32.40 | 3.5792 | 91.1518 | 0.2063 |

3.30 | 36.00 | 4.0517 | 112.1086 | 0.2236 |

3.84 | 18.72 | 3.0983 | 35.3082 | 0.6402 |

3.84 | 23.52 | 2.9671 | 51.6458 | 0.5450 |

3.84 | 31.68 | 3.2554 | 88.8758 | 0.4451 |

3.84 | 32.88 | 3.3520 | 95.3551 | 0.4369 |

4.20 | 25.20 | 3.2370 | 60.4633 | 0.7810 |

Max: 2.40 | 14.4 | 2.9671 | 21.1331 | −0.0365 |

Max: 4.20 | 36.0 | 4.2949 | 112.1086 | 0.7810 |

2.2. Construction in the conditions of an uncertainty consists in using qualitative and quantitative descriptions of a technological process obtained on the basis of the “input-output” principle in

I = | X , Y | = { x i 1 , x i 2 , y i 1 , y i 2 , y i 3 , i = 1 , M ¯ } . (84)

For each experimental data set y k , k = 1 , 3 ¯ the regression function is constructed using the least squares method min ∑ i = 1 M ( y i − y i ¯ ) 2 in the MATLAB system. For this, the polynomial A_{k} is formed, which determines the interrelation of the parameters X i = { x i 1 , x i 2 } and the function y k i ¯ = f ( X i , A k ) , k = 1 , 3 ¯ . The result is a system of coefficients A k = { A 0 k , A 1 k , ⋯ , A 9 k } , which determine the coefficients of the polynomial (function):

f k ( X , A ) = a 0 k + a 1 k x 1 + a 2 k x 1 2 + a 3 k x 2 + a 4 k x 2 2 + a 5 k x 1 ∗ x 2 , k = 1 , 3 ¯ (85)

The experimental data I 1 = { x i 1 , x i 2 , y i 1 } of the matrix I = | X , Y | (84) are converted into the function f_{1}(X) in the form (85), which, taking into account the obtained coefficients, takes the form:

f 1 ( X ) = 11.4745 − 4.8992 x 1 + 0.8868 x 1 2 − 0.0030 x 2 + 0.0048 x 2 2 − 0.0595 x 1 ∗ x 2 (86)

The experimental data I 2 = { x i 1 , x i 2 , y i 2 } of the matrix I = | X , Y | (84) are converted into the function f_{2}(X) in the form (85), which, taking into account the obtained coefficients, takes the form:

f 2 ( X ) = 8.8176 − 7.6809 x 1 + 2.1456 x 1 2 + 0.1851 x 2 + 0.0894 x 2 2 − 0.1454 x 1 ∗ x 2 (87)

The experimental data I 3 = { x i 1 , x i 2 , y i 3 } of the matrix I = | X , Y | (84) are converted to the function f_{3}(X) in the form (85), which, taking into account the obtained coefficients, takes the form:

f 3 ( X ) = − 0.1225 − 0.3735 x 1 + 0.1916 x 1 2 + 0.0221 x 2 + 0.0006 x 2 2 − 0.0173 x 1 ∗ x 12 (88)

2.3. Construction of a mathematical model of the technological process (General part for the conditions of certainty and uncertainty). To build a mathematical model of a technological process, we use: the functions obtained by the conditions of certainty and uncertainty (86), (87), (88); parametrical restrictions (82).

Functions (86), (87), (88) are considered as criteria determining the purposefulness of the operation of the technological process. All criteria are aimed K_{1} = 2 at maximization: f 1 ( X ) , f 3 ( X ) → max and K_{2} = 2 at minimization: f 2 ( X ) , f 4 ( X ) → max K = K 1 ∪ K 2 . As a result, the model of the functioning of the technological process will be represented by the vector problem of mathematical programming:

o p t F ( X ) = { max F 1 ( X ) = { max f 1 ( X ) ≡ 11.47 − 4.8992 x 1 + 0.8868 x 1 2 − 0.0030 x 2 + 0.0048 x 2 2 − 0.0595 x 1 x 2 , (89)

max f 3 ( X ) ≡ − 0.1225 − 0.3735 x 1 + 0.1916 x 1 2 + 0.0221 x 2 + 0.0006 x 2 2 − 0.0173 x 1 x 2 , (90)

min F 2 ( X ) = { min f 2 ( X ) ≡ 8.8176 − 7.6809 x 1 + 2.1456 x 1 2 + 0.1851 x 2 + 0.0894 x 2 2 − 0.1454 x 1 x 2 , (91)

min f 4 ( X ) ≡ − 0.2450 − 0.7470 x 1 + 0.3832 x 1 2 + 0.0442 x 2 + 0.0012 x 2 2 − 0.0346 x 1 x 2 } } , (92)

at restrictions 2.0 ≤ x 1 ≤ 3.5 , 12.0 ≤ x 2 ≤ 30.0 (93)

The vector problem of mathematical programming (89)-(93) represents the model of optimal decision making under certainty and uncertainty in the aggregate.

Stage 3. The solution of the vector problem of mathematical programming— the model of the technological process.

To solve the vector problem of mathematical programming (89)-(93), we use the solution method based on the normalization of criteria and the principle of guaranteed results, presented in Section 3.3 [

Step 1. Solving problem (89)-(93) for each criterion separately, using the fmincon(...) function of the MATLAB system [

As a result of the calculation for each criterion, we obtain optimum points: X k * and f k * = f k ( X k * ) , k = 1 , K ¯ , K = 4 is the values of the criteria at this point, that is, the best solution for each criterion:

X 1 * = { x 1 = 2.0 , x 2 = 30.0 } , f 1 * = f 1 ( X 1 * ) = − 5.8833 ; X 2 * = { x 1 = 3.5 , x 2 = 30.0 } , f 2 * = f 2 ( X 2 * ) = − 78.9641 ; X 3 * = { x 1 = 3.5 , x 2 = 12.0 } , f 3 * = f 3 ( X 3 * ) = − 0.54235 ; X 4 * = { x 1 = 2.9 , x 2 = 12.0 } , f 4 * = f 4 ( X 4 * ) = − 0.3334. (94)

The constraints (93) and optimum points X 1 * , X 2 * , X 3 * , X 4 * (94) in the coordinates { x 1 , x 2 } are shown in

S = { X ∈ R N | 2.0 ≤ x 1 ≤ 3.5 , 12.0 ≤ x 2 ≤ 30.0 } ≠ ∅

The set of points that are Pareto optimal, S^{o} represents the area of the set of points that lie between the points of the optimum X 1 * , X 2 * , X 3 * , X 4 * . We see that in this problem, the set of admissible points S and the set of points optimal in Pareto, S^{o}, are equal to each other: S = S^{o}.

Step 2. The worst unchanging part of each criterion is determined (anti-optimum) (a superscript zero):

X 1 0 = { x 1 = 3.50 , x 2 = 22.0052 } , f 1 0 = f 1 ( X 1 0 ) = 2.8663 ; X 2 0 = { x 1 = 2.1952 , x 2 = 12.0 } , f 2 0 = f 2 ( X 2 0 ) = 13.56 ; X 3 0 = { x 1 = 2.0 , x 2 = 12.0 } , f 3 0 = f 3 ( X 3 0 ) = − 0.1667 ; X 4 0 = { x 1 = 3.5 , x 2 = 12.0 } , f 4 0 = f 4 ( X 4 0 ) = − 1.0847. (95)

Step 3. A systematic analysis of the set of Pareto optimal points (i.e. analysis by each criterion) is performed. At the optimum points X * = { X 1 * , X 2 * , X 3 * , X 4 * } ,

the values of the objective functions F ( X * ) = ‖ f q ( X k * ) ‖ q = 1 , K ¯ k = 1 , K ¯ are determined, the vector D = ( d 1 d 2 d 3 d 4 ) T deviations for each criterion on the admissible set S: d k = f k * − f k 0 , k = 1 , 4 ¯ ,

F ( X * ) = ‖ − 5.8833 − 79.3272 − 0.0619 0.1238 − 3.1731 − 78.9641 − 0.3038 0.6077 − 3.3468 − 17.2060 − 0.5423 1.0847 − 4.4505 − 13.6434 0.1667 − 0.3334 ‖ , d k = ‖ 3.0170 65.4035 0.7090 1.4181 ‖ (96)

and the relative estimation matrix λ ( X * ) = ‖ λ q ( X k * ) ‖ q = 1 , K ¯ k = 1 , K ¯ , where λ k ( X ) = ( f k * − f k 0 ) / d k

λ ( X * ) = ‖ 1 .0000 1.0056 0.3224 0.6776 0.1017 1 .0000 0.6636 0.3364 0.1593 0.0557 1 .0000 0 0.5251 0.0013 0 1 .0000 ‖ . (97)

The analysis of the values of criteria (96) in relative estimates (97) shows that at the points of optimum X * = { X 1 * , X 2 * , X 3 * , X 4 * } (diagonally) the relative estimate is equal to one. The remaining criteria are significantly less than one. It is required to find a point (parameters) at which the relative estimates are closest to unity. The solution of this problem is aimed at solving the λ-problem—step 4.

Step 4. The construction of the λ-problem is carried out in two stages: a maximin optimization problem with normalized criteria is initially constructed:

λ o = max X ∈ S min k ∈ K λ k ( X ) , G ( X ) ≤ 0 , X ≥ 0 . (98)

At the second stage, the maximin problem (98) is transformed into a standard mathematical programming problem (λ-problem):

λ o = max λ , (99)

at restrictions

λ − − 11.47 − 4.8992 ∗ x 1 + 0.8868 ∗ x 1 2 − 0.0030 ∗ x 2 + 0.0048 ∗ x 2 2 − 0.0595 ∗ x 1 ∗ x 2 − f 1 0 f 1 * − f 1 0 ≤ 0 , (100)

λ − − 0.1225 − 0.3735 ∗ x 1 + 0.1916 ∗ x 1 2 + 0.221 ∗ x 2 + 0.0006 ∗ x 2 2 + 0.0173 ∗ x 1 ∗ x 2 − f 3 0 f 3 * − f 3 0 ≤ 0 , (101)

λ − 8.8176 + 7.6809 ∗ x 1 − 2.1456 ∗ x 3 2 + 0.1851 ∗ x 2 + 0.0894 ∗ x 2 2 + 0.1454 ∗ x 1 ∗ x 2 − f 2 0 f 2 * − f 2 0 ≤ 0 , (102)

λ − − 0.2450 − 0.7470 ∗ x 1 − 0.3832 ∗ x 1 2 + 0.0442 ∗ x 2 + 0.001245 ∗ x 2 2 + 0.0345 ∗ x 1 ∗ x 2 − f 4 0 f 4 * − f 4 0 ≤ 0 , (103)

0 ≤ λ ≤ 1 , 2.0 ≤ x 1 ≤ 3.5 , 12.0 ≤ x 2 ≤ 30.0 , (104)

where the vector of unknowns has dimension of N + 1: X = { x 1 , ⋯ , x N , λ } , N = 2.

Step 5. Solution of the λ-problem. For this purpose we use the function fmincon(…) [

[Xo] [Lo] = fmincon (‘Z_TS_2Krit_L’, X0, Ao, bo, Aeq, beq, lbo, ubo, ’Z_TS_LConst’, options).

As a result of the solution of VPMP (89)-(93) at equivalent criteria and λ-problem corresponding to it (99)-(104) received:

X o = { X o , λ o } = { X o = { x 1 = 2.8039 , x 2 = 30.0 } , λ o = 0.3541 } (105)

shown in

f k ( X o ) , k = 1 , K ¯ 1 , K ¯ —values of criteria (characteristics of the technological process):

F ( X o ) = { f 1 ( X o ) = 3.9345 , f 2 ( X o ) = 77.9319 , f 3 ( X o ) = 0.0844 , f 4 ( X o ) = 0.1687 } ; (106)

λ k ( X o ) , k = 1 , K ¯ 1 , K ¯ —values of relative estimates

λ ( X o ) = { λ 1 ( X o ) = 0.3541 , λ 2 ( X o ) = 0.9842 , λ 3 ( X o ) = 0.3541 , λ 4 ( X o ) = 0.6459 } ; (107)

λ o = 0.3541 is the maximum lower level among all relative estimates, measured in the relative units:

λ o = min { λ 1 ( X o ) , λ 2 ( X o ) , λ 3 ( X o ) , λ 4 ( X o ) } = 0.3541 , λ^{o}—also called a guaranteed result in the relative units, i.e., λ_{k}(X^{o}) and, accordingly, the characteristics of the technological process f_{k}(X^{o}) it is impossible to improve, without worsening at the same time other characteristics. Note that, in accordance with Theorem 1, at point X^{o}(105), criteria 1 and 3 are contradictory. This contradiction is determined by the equality λ 1 ( X o ) , λ 3 ( X o ) = λ o = 0.3541 (107), and the remaining criteria by the inequality { λ 2 ( X o ) = 0.9842 , λ 4 ( X o ) = 0.6459 } > λ o .

Thus, Theorem 1 serves as the basis for determining the correctness of the solution of the vector problem.

In the vector problem of mathematical programming, as a rule, for two criteria, equality is satisfied:

λ o = λ q ( X o ) = λ p ( X o ) , q , p ∈ K , X ∈ S ,

and for other criteria it is defined as inequality: { λ 2 ( X o ) , λ 4 ( X o ) } > λ o .

Stage 4. Creation of geometrical interpretation of results of the decision in a three-dimensional coordinate. In the allowable set of points S formed by constraints (93), the optimum points X * = { X 1 * , X 2 * , X 3 * , X 4 * } , which are shown in _{1}, x_{2} and λ, where the third axis is the relative estimate λ.

Stage 5. Decision-making in the technological process model at the set priority of criterion.

To solve vector problems of mathematical programming (21)-(26) methods are presented, based on axiomatic normalization of criteria and principle of guaranteed result, as well as axiomatic priority of criterion, resulting from axiom 2, 3 and principle of optimality 2, which are presented in Section 3.2 [

The decision maker is usually the process designer.

Step 1. We solve a vector problem (89)-(93) with equivalent criteria. The algorithm of the decision is presented in the stage 3. Numerical results of the solution of the vector problem are given above. Pareto’s great number of S o ⊂ S lies between optimum points X 1 * , X 2 * , X 3 * , X 4 * , X 1 * . This information is the basis for further research on the structure of the Pareto set. The decision maker is usually the technological process designer. If results of the solution of a vector problem with equivalent criteria do not satisfy the person making the decision,

then the choice of an optimal solution is carried out from any subset of points of S 1 o , S 2 o , S 3 o , S 4 o .

Step 2. Choice of priority criterion of q ∈ K . From the theory (the Theorem 2) it is known that in an optimum point of X^{o} there are always two most contradictory criteria: q ∈ K and v ∈ K for which in the relative unit’s precise equality is carried out:

λ o = λ q ( X o ) = λ p ( X o ) , q , p ∈ K , X ∈ S ,

and for the others it is carried out inequalities:

λ o ≤ λ k ( X o ) ∀ k ∈ K q ≠ v ≠ k .

For the choice of the priority criterion on the display the message about results of the solution of λ-problem in physical and relative units is given:

Criteria (106) in X^{o} optimum point:

F ( X o ) = { f 1 ( X o ) = 3.9345 , f 2 ( X o ) = 77.9319 , f 3 ( X o ) = 0.0844 , f 4 ( X o ) = 0.1687 } ;

The relative estimates (107) in X^{o}:

λ ( X o ) = { λ 1 ( X o ) = 0.3541 , λ 2 ( X o ) = 0.9842 , λ 3 ( X o ) = 0.3541 , λ 4 ( X o ) = 0.6459 } .

From the function λ(X^{o}) it is clear that the first and the third are the most contradictory criteria:

λ o = { λ 1 ( X o ) , λ 3 ( X o ) } = 0.3541 , (108)

Select from

As a rule, from a pair of the contradictory criteria, a criterion chosen by the decision maker would be improved. Such criterion is called “priority criterion”, we will designate it q = 3 ∈ K . This criterion is investigated in interaction with the first criterion of k = 1 ∈ K .

On the display the message is given:

q = input (‘Enter priority criterion (number) of q =’)—Entered: q = 3.

Step 3. Numerical limits of the change of the size of a priority of the criterion of q = 3 ∈ K are defined.

For priority criterion of q = 3 ∈ K changes of the numerical limits in the physical units upon transition from X^{o} optimum point to the point of X q * received on the first step at equivalent criteria are defined. q = 3 given about criterion are given for the screen:

f q ( X o ) = − 0.084354 ≤ f q ( X ) ≤ − 0.54235 = f q ( X q * ) , q = 3 ∈ K . (109)

In the relative units the criterion of q = 3 changes in the following limits:

λ q ( X o ) = 0.35407 ≤ λ q ( X ) ≤ 1 = λ q ( X q * ) , q = 3 ∈ K .

This data is analyzed.

Step 4. Choice of size of the priority criterion of q ∈ K . (Decision-making). On the message: “Enter the size of priority criterion f_{q} = “—we enter, the size of the characteristic q = 3 ∈ K : f q = 0.3 .

Step 5. The relative assessment is calculated.

For the chosen size of priority criterion f q = 0.3 the relative assessment is calculated:

λ q = f q − f q 0 f q * − f q 0 = 0.3 − ( − 0.1667 ) 0.54235 − ( − 0.1667 ) = 0.6582 ,

which upon transition from X^{o} point to X 3 * lies in the limits:

0.35407 = λ 3 ( X o ) ≤ λ 3 = 0.6582 ≤ λ 3 ( X 3 * ) = 1 , q ∈ K

Step 6. Let’s calculate coefficient of the linear approximation

Assuming the linear nature of the change of the criterion of f_{q}(X) in (109) and according to the relative assessment of λ_{q}, using standard linear approximation techniques, we will calculate the proportionality coefficient between λ_{q}(X^{o}), λ_{q} which we will call ρ :

ρ = λ q − λ q ( X o ) λ q ( X q * ) − λ q ( X o ) = 0.6582 − 0.35407 1 − 0.35407 = 0.4708 , q = 3 ∈ K .

Step 7. Let’s calculate coordinates of a priority of the criteria with dimension of f_{q}

Assuming the linear nature of change of a vector of X q = { x 1 x 3 } , q = 3 we will determine point coordinates with dimension of f q = 0. 3 , the relative assessment λ_{q}:

x λ = 0.7 q = 2 = { x 1 = X o ( 1 ) + ρ ( X q * ( 1 ) − X o ( 1 ) ) , x 2 = X o ( 2 ) + ρ ( X q * ( 2 ) − X o ( 2 ) ) } , (110)

where X o = { X o ( 1 ) = 2.8039 , X o ( 2 ) = 30.0 } , X 3 * = { X 3 * ( 1 ) = 80.0 , X 3 * ( 2 ) = 0.0 } .

As result of the decision (110) we will receive X^{q} point with coordinates:

X q = { x 1 = 3.1317 , x 2 = 21.5248 } .

Step 8. Calculation of the main indexes of a point of X_{q}.

For the received X^{q} point, we will calculate:

All criteria in the physical units f k ( X q ) = { f k ( X q ) , k = 1 , K ¯ } ,

f ( X q ) = { f 1 ( X q ) = 2.9775 , f 2 ( X q ) = 41.4096 , f 3 ( X q ) = 0.1744 , f 4 ( X q ) = 0.3489 } ;

All relative estimates with the criterion priority

λ q = { λ k q , k = 1 , K ¯ } , λ k ( X q ) = f k ( X q ) − f k 0 f k * − f k 0 , k = 1 , K ¯ ,

λ k ( X q ) = { λ 1 ( X q ) = 0.0369 , λ 2 ( X q ) = 0.4258 , λ 3 ( X q ) = 0.4811 , λ 4 ( X q ) = 0.5189 } ;

Minimum relative assessment: min ( λ k ( X q ) ) = 0.0369 ;

Vector of priorities of the third criterion over other criteria: P q ( X ) = { p k q = λ q ( X q ) λ k ( X q ) , k = 1 , K ¯ } ,

P q = [ p 1 3 = 6.2789 , p 2 3 = 17.94 , p 3 3 = 1.0 , p 4 3 = 0.9 ] ;

Any point from Pareto’s set X t o = { λ t o , X t o } ∈ S o can be similarly calculated.

Analysis of results. The calculated size of criterion f q ( X t o ) , q ∈ K is usually not equal to the set f_{q}. The error of the choice of Δ f q = | f q ( X t o ) − f q | = | 0.1744 − 0.3 | = 0.125 is defined by an error of linear approximation, Δ f q % = Δ f q f q ∗ 100 = 40.2 % .

In the course of the modeling parametrical restrictions (93) can be changed, i.e. some set of optimum decisions is received. Choose a final version which in our example included from this set of optimum decisions:

· parameters of technological process X o = { x 1 = 2.8039 , x 2 = 30.0 } ;

· the parameters of the technological system at a given priority criterion q = 3:

X q = { x 1 = 3.1317 , x 2 = 21.5248 } .

Stage 6. Geometrical interpretation of results of the decision in three to a measured frame in physical units.

We represent these parameters in a two-dimensional x_{1}, x_{2} and three dimensional coordinate system x_{1}, x_{2} and λ in Figures 12-14, and also in physical units for each function f_{1}(X), f_{2}(X), f_{3}(X), f_{4}(X) on Figures 15-18 respectively.

The first characteristic f_{1}(X) in physical units show in

The second characteristic f_{2}(X) in physical units show in

The third characteristic f_{3}(X) in physical units show in

The four characteristic f_{4}(X) in physical units show in

In the aggregate, the first option presented:

· point X o = { x 1 , x 2 } ;

· the functional characteristics F ( X o ) = { f 1 ( X o ) , f 2 ( X o ) , f 3 ( X o ) , f 4 ( X o ) } ;

· relative estimates of λ ( X o ) = { λ 1 ( X o ) , λ 2 ( X o ) , λ 3 ( X o ) , λ 4 ( X o ) } ;

· maximin λ^{o}—relative level such that λ o ≤ λ k ( X o ) ∀ k ∈ K .

There is an optimal solution with equivalent criteria (characteristics), and the procedure for obtaining is the adoption of the optimal solution in the process with equivalent criteria (characteristics).

The second option:

· point— X q = { X 1 q , X 2 q } ; characteristics f ( X q ) = { f 1 ( X q ) , f 2 ( X q ) , f 3 ( X q ) , f 4 ( X q ) } ;

· relative estimates λ k ( X q ) = { λ 1 ( X q ) , λ 2 ( X q ) , λ 3 ( X q ) , λ 4 ( X q ) } ;

· maximin λ^{oq} is a relative level such that λ o q ≤ λ 1 ( X q ) , λ 2 ( X q ) , λ 3 ( X q ) , λ 4 ( X q ) ;

There is an optimal solution with the priority of the third criterion (characteristics) relative to other criteria. The procedure for obtaining the point X^{q} is the adoption of the optimal solution for a given priority of the criterion.

The vector optimization theory, methods for solving vector problems with equivalent criteria and a given criterion priority allow you to select any point from the set of Pareto optimal points and show the optimality of this point.

The problem of a decision making of structure of material about which are known is considered: first, given about the functional interrelation of several characteristics with its components which are a part of this material ((the conditions of definiteness are absent); secondly, data on some set of discrete values of several characteristics (the experimental results), in interrelation with discrete values of the components which are a part of this material (uncertainty conditions).

Stage 1. The technical assignment: “The choice of optimum parameters of material”.

Requirement specification: “The choice of optimum parameters of material” is carried out by the designer of material.

It is given. Material which structure is defined by four components: Y = { y 1 , y 2 , y 3 , y 4 } —a vector (operated) variables. Input data for a decision making are four characteristics: H ( Y ) = { h 1 ( Y ) , h 2 ( Y ) , h 3 ( Y ) , h 4 ( Y ) } . Conditions of a certainty are absent.

Conditions of uncertainty. For four characteristics are known discrete values of components (experimental) Y = { y 1 , y 2 , y 3 , y 4 } —with the corresponding discrete values of characteristics of H ( Y ) = { h 1 ( Y ) , h 2 ( Y ) , h 3 ( Y ) , h 4 ( Y ) } . Numerical values of parameters Y and characteristics of H(X) are presented in

Parametrical restrictions change in the following limits (as a percentage): 21 ≤ y 1 ≤ 79 , 5 ≤ y 2 ≤ 59 , 2.1 ≤ y 3 ≤ 9 , 2.2 ≤ y 4 ≤ 7 . On the parameters Y = { y 1 , y 2 , y 3 , y 4 } are in total imposed restriction:

y 1 + y 2 + y 3 + y 4 = 100 . (111)

y_{1} | y_{2} | y_{3} | y_{4} | h_{1} (Y) | h_{2} (Y) | h_{3} (Y) | h_{4} (Y) |
---|---|---|---|---|---|---|---|

20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 50 50 50 50 50 50 50 50 50 50 50 50 50 50 | 0 0 0 0 0 0 0 0 0 30 30 30 30 30 30 30 30 30 60 60 60 60 60 60 60 60 60 0 0 0 0 0 0 0 0 0 30 30 30 30 30 | 2 2 2 5 5 5 8 8 8 2 2 2 5 5 5 8 8 8 2 2 2 5 5 5 8 8 8 2 2 2 5 5 5 8 8 8 2 2 2 5 5 | 2 5 8 2 5 8 2 5 8 2 5 8 2 5 8 2 5 8 2 5 8 2 5 8 2 5 8 2 5 8 2 5 8 2 5 8 2 5 8 2 5 | 396.0 408.0 417.6 423.6 432.0 438.0 451.2 457.2 468.0 300.0 309.6 315.6 324.0 334.8 339.6 348.0 361.2 372.0 204.0 210.0 222.0 228.0 237.6 244.8 252.0 265.2 276.0 12.00 19.20 28.80 36.00 45.60 52.80 60.00 72.00 84.00 492.0 500.4 507.6 516.0 526.8 | 1149.6 1164.0 1176.0 1212.0 1260.0 1257.6 1256.4 1252.8 1251.6 2143.2 2154.0 2163.6 2176.8 2185.2 2198.4 2211.6 2232.0 2245.2 2954.4 2820.0 2772.0 2748.0 2832.0 2904.0 3022.8 3036.0 3056.4 3583.2 3601.2 3608.4 3616.8 3622.8 3637.2 3651.6 3672.0 36852 1195.2 1212.0 1236.0 1251.6 1272.0 | 100.08 99.600 99.480 103.32 99.000 98.520 96.240 94.920 94.320 111.60 110.76 110.28 109.68 108.12 107.88 107.76 105.60 105.84 130.80 126.00 122.40 120.48 122.40 124.80 126.96 126.00 125.04 157.68 157.20 156.00 155.76 154.80 154.44 153.84 152.40 151.92 107.52 103.20 100.80 100.08 98.400 | 24.24 27.60 28.80 30.00 31.20 32.40 33.60 34.80 34.80 19.92 21.60 25.20 29.76 33.48 37.20 39.48 42.00 49.20 15.60 18.00 21.60 24.24 28.80 32.40 35.16 39.60 44.88 11.28 14.40 16.80 21.12 22.80 27.60 30.84 36.00 40.56 52.80 60.00 64.80 68.64 75.60 |

50 50 50 50 50 50 50 50 50 50 50 50 50 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 | 30 30 30 30 60 60 60 60 60 60 60 60 60 0 0 0 0 0 0 0 0 0 30 30 30 30 30 30 30 30 30 60 60 60 60 60 60 60 60 60 | 5 8 8 8 2 2 2 5 5 5 8 8 8 2 2 2 5 5 5 8 8 8 2 2 2 5 5 5 8 8 8 2 2 2 5 5 5 8 8 8 | 8 2 5 8 2 5 8 2 5 8 2 5 8 2 5 8 2 5 8 2 5 8 2 5 8 2 5 8 2 5 8 2 5 8 2 5 8 2 5 8 | 532.8 540.0 552.0 564.0 492.0 501.6 507.6 516.0 524.4 532.8 540.0 552.0 564.0 396.0 405.6 411.6 420.0 429.6 435.6 444.0 456.0 468.0 204.0 213.6 218.4 228.0 237.6 244.8 252.0 264.0 276.0 588.0 597.6 603.6 612.0 621.6 627.6 636.0 649.2 660.0 | 1296.0 1318.8 1344.0 1388.4 2176.8 2196.0 2220.0 2245.2 2286.0 2294.4 2313.6 2340.0 2382.0 2988.0 3012.0 3036.0 3056.4 3108.0 3156.0 3244.8 3228.0 3193.2 3616.8 3639.6 3660.0 3685.2 3708.0 3732.0 3753.6 3672.0 3822.0 1218.0 1248.0 1272.0 1318.8 1344.0 1392.0 1422.0 1464.0 1524.0 | 97.200 96.240 94.080 92.400 115.44 114.00 112.80 111.60 110.40 109.20 107.76 99.600 103.92 134.64 133.20 132.00 130.80 131.04 131.52 131.76 126.00 122.40 161.52 159.60 158.40 157.68 156.00 154.80 153.84 152.40 150.00 111.60 109.20 108.00 105.84 103.20 100.80 100.08 96.000 94.320 | 82.80 88.08 97.20 107.64 40.56 45.60 52.80 60.00 67.20 73.20 79.44 85.20 99.00 31.92 36.00 43.20 51.36 61.20 72.00 82.80 86.40 90.36 23.28 30.00 36.00 42.72 48.00 54.00 62.16 73.20 81.72 87.00 94.80 103.20 116.16 126.00 136.80 145.44 156.00 174.72 |
---|---|---|---|---|---|---|---|

min y i ( X ) , i = 1 , ⋯ , 81 | 12.0 | 1149.6 | 92.4 | 11.3 | |||

max y i ( X ) , i = 1 , ⋯ , 81 | 660.0 | 3822.0 | 161.5 | 174.7 |

In the made decision, assessment size on the first and third characteristic it is desirable (criterion), to receive as above (max), on second and fourth as low as possible is possible (min). In the pilot studies the rate of an increase of parameters Y will be defined in the following limits: y 1 ∈ [ 0 50 80 ] ; y 2 ∈ [ 0 30 60 ] ; y 3 , y 4 ∈ [ 2 5 8 ] .

It is required.

1) To construct mathematical model of structure of the studied material in the form of a vector problem of mathematical programming.

2) To carry out model operation: first, on the basis of the constructed mathematical model, secondly, on the basis of methods of solution of a vector problem of non-linear programming at equivalent criteria, and, thirdly, the software developed for these purposes in the MATLAB system.

3) To make an optimal solution: The choice of optimum composition (structure) of material according to its functional characteristics taking into account their equivalence.

4) To choose the optimum composition of structure of material according to its functional characteristics taking into account a priority of the third criterion. The size of the third criterion h 3 ( X q ) = 138.2 is received at model operation of technical system.

Stage 2. Construction of a mathematical model of the structure of material.

(Methodology of model operation of the choice of optimum structure of material in the conditions of certainty and uncertainty). It is carried out by the mathematician—the programmer. At a stage of the choice of priority criterion and its size it is carried out by the designer of material.

2.1. Construction in the conditions of a certainty.

The step 1 is not carried out as characteristics of material in the conditions of certainty are not set.

2.3. Construction of a mathematical model of the structure of material.

Construction in the conditions of indeterminacy consists in use of qualitative, quantitative descriptions of material by the principle “input-output” to

H ( Y ) = { h 1 ( Y ) , h 2 ( Y ) , h 3 ( Y ) , h 4 ( Y ) } will be transformed to the functional type of F ( Y ) = { f 1 ( Y ) , f 2 ( Y ) , f 3 ( Y ) , f 4 ( Y ) } .

Numerical values of results of the regression analysis are given below in model (112)-(117).

For creation of mathematical model of material we use results of the regression analysis. We consider the turned-out functions f 1 ( Y ) , f 2 ( Y ) , f 3 ( Y ) , f 4 ( Y ) as criterion of a vector problem. They determine the purposefulness of characteristics of material. A set of criteria K = 4 include two criteria of f 1 ( Y ) , f 3 ( Y ) → max and two f 2 ( Y ) , f 4 ( Y ) → min . As a result model of functioning of material is represented by the vector problem of mathematical programming:

o p t F ( Y ) = { max F 1 ( Y ) = { max f 1 ( Y ) ≡ 323.8 − 1.875 y 1 − 2.911 y 2 + 8.939 y 3 + 10.94 y 4 + 0.0673 y 1 y 2 − 0.0431 y 1 y 3 − 0.1176 y 1 y 4 + 0.0516 y 2 y 3 − 0.0723 y 2 y 4 + 0.0021 y 3 y 4 + 0.0099 y 1 2 + 0.0081 y 2 2 − 0.169 y 3 2 − 0.349 y 4 2 , (112)

max f 3 ( Y ) ≡ 95.71 + 0.6598 y 1 + 0.4493 y 2 − 0.3094 y 3 − 1.833 y 4 − 0.091 y 1 y 2 − 0.0057 y 1 y 3 + 0.0134 y 1 y 4 − 0.0119 y 2 y 3 + 0.111 y 2 y 4 − 0.0003 y 3 y 4 − 0.0002 y 1 2 − 0.0002 y 2 2 + 0.0233 y 3 2 + 0.086 y 4 2 } , (113)

min F 2 ( Y ) = { min f 2 ( Y ) ≡ 954.8 + 23.9 y 1 + 30.86 y 2 − 25.85 y 3 − 45 y 4 − 0.64 y 1 y 2 + 0.3919 y 1 y 3 + 0.6227 y 1 y 4 − 0.1069 y 2 y 3 + 0.2722 y 2 y 4 − 0.0078 y 3 y 4 + 0.0332 y 1 2 + 0.0304 y 2 2 + 2.67 y 3 2 + 2.205 y 4 2 , (114)

min f 4 ( Y ) ≡ 21.0 − 0.0081 y 1 − 0.7 y 2 − 0.3605 y 3 + 0.9769 y 4 + 0.0115 y 1 y 2 + 0.059 y 1 y 3 − 0.0001 y 1 y 4 + 0.0363 y 2 y 3 + 0.0002 y 2 y 4 + 0.0003 y 3 y 4 − 0.015 y 1 2 + 0.0025 y 2 2 − 0.042 y 3 2 − 0.0216 y 4 2 } } (115)

at restrictions: y 1 + y 2 + y 3 + y 4 = 100 . (116)

21 ≤ y 1 ≤ 79 , 5 ≤ y 2 ≤ 59 , 2.1 ≤ y 3 ≤ 9 , 2.2 ≤ y 4 ≤ 7 . (117)

The vector problem of mathematical programming (112)-(117) represents the model of optimal decision making, i.e. the choice of the optimal structure of the material in conditions of certainty and uncertainty in the total.

Stage 3. The solution of a vector problem of mathematical programming-material model (Algorithm 1. The solution of a vector task with equivalent criteria).

The solution of a vector problem (112)-(117) with equivalent criteria can be represented as a sequence of steps.

Step 1. Decides problem (112)-(117) by each criterion separately, at the same time the function fmincon (…) of the Matlab system is used, the appeal to the function fmincon (…) is considered in [

X 1 * = { x 1 = 46.57 , x 2 = 42.23 , x 3 = 8 , x 4 = 2.2 } , f 1 * = f 1 ( X 1 * ) = 387.99 . (118)

The result the solution of a problem of non-linear programming (112), (116)-(117) in three-dimensional frames of x_{1}, x_{3} and f_{1}(X) is presented on

X 2 * = { x 1 = 50.5 , x 2 = 45.2 , x 3 = 2.1 , x 4 = 2.2 } , f 2 * = f 2 ( X 2 * ) = 2215.91 .

The result the solution of a problem of non-linear programming (114), (116)-(117) in three-dimensional frames of x_{1}, x_{3} and f_{2}(X) is presented on

X 3 * = { x 1 = 79 , x 2 = 11.9 , x 3 = 2.1 , x 4 = 7 } , f 3 * = f 3 ( X 3 * ) = 150.24 ;

The result the solution of a problem of non-linear programming (114), (116)-(117) in three-dimensional frames of x_{1}, x_{3} and f_{3}(X) is presented on

X 4 * = { x 1 = 36.7 , x 2 = 59 , x 3 = 2.1 , x 4 = 2.2 } , f 4 * = f 4 ( X 4 * ) = 30.71 .

The result the solution of a problem of non-linear programming (115), (116)-(117) in three-dimensional frames of x_{1}, x_{3} and f_{4}(X) is presented on

The location of the optimum points X 1 * , X 2 * , X 3 * , X 4 * in the region of the constraints (116)-(117) in the coordinates {x_{1}, x_{3}} is shown in ^{o} lying in the domain of restrictions between the points X 1 * , X 2 * , X 3 * , X 4 * represent a set of Pareto optimal points.

Step 2. The worst unchangeable part of each criterion is defined (anti-optimum) (A superscript zero):

X 1 0 = { x 1 = 31.9 , x 2 = 59 , x 3 = 2.1 , x 4 = 7 } , f 1 0 = f 1 ( X 1 0 ) = 296.6 ;

X 2 0 = { x 1 = 79.0 , x 2 = 6.0 , x 3 = 8.0 , x 4 = 7 } , f 2 0 = f 2 ( X 2 0 ) = − 3903.1 ;

X 3 0 = { x 1 = 31.9 , x 2 = 57.43 , x 3 = 8.0 , x 4 = 2.666 } , f 3 0 = ( X 3 0 ) = 114.87 ;

X 4 0 = { x 1 = 62.71 , x 2 = 22.89 , x 3 = 8.0 , x 4 = 6.399 } , f 4 0 = f 4 ( X 4 0 ) = 73.63

The obtained points of the anti-optimum X 1 0 , X 2 0 , X 3 0 , X 4 0 . are shown in

Step 3. Systems analysis of a set of points that are Pareto-optimal is performed, (i.e. the analysis by each criterion). In points of an optimum of

X * = { X 1 * , X 2 * , X 3 * , X 4 * } sizes of target functions of F ( X * ) = ‖ f q ( X k * ) ‖ q = 1 , K ¯ k = 1 , K ¯ , a vector of D = ( d 1 d 2 d 3 d 4 ) T of deviations are determined by each criterion on an admissible set of S: d k = f k * − f k 0 , k = 1 , 4 ¯ , and matrix of the relative estimates of

λ ( X * ) = ‖ λ q ( X k * ) ‖ q = 1 , K ¯ k = 1 , K ¯ , where λ k ( X ) = ( f k * − f k 0 ) / d k .

F ( X * ) = ‖ 388.01 2401.2 117.5 68.5 353.0 2215.9 124.9 37.5 264.2 3445.7 150.2 34.0 330.1 2408.9 122.7 30.7 ‖ , d k = ‖ 91.4 − 1725.0 35.36 − 42.9 ‖ ,

λ ( X * ) = ‖ 1 .0000 0.8926 0.0742 0.1197 0.6171 1 .0000 0.2832 0.8429 − 0.3539 0.2872 1 .0000 0.9239 0.3669 0.8881 0.2208 1 .0000 ‖ . (119)

The analysis of sizes of criteria in the relative estimates shows that at the points of the optimum X * = { X 1 * , X 2 * , X 3 * , X 4 * } (on diagonal) the relative assessment is equal to unit. Other criteria there is much less unit. It is required to find such point (parameters) at which the relative estimates are closest to unit. The solution of this problem is directed to the solution of λ-problem—step 4.

Step 4. Creation of the λ-problem is carried out in two stages: originally the maximine problem of optimization with the normalized criteria is under construction:

λ o = max X ∈ S min k ∈ K λ k ( X ) , G ( X ) ≤ 0 , X ≥ 0 , (120)

which at the second stage will be transformed to a reference problem of mathematical programming (λ-problem):

λ o = max λ , (121)

at restrictions λ − f 1 ( Y ) − f 1 0 f 1 * − f 1 0 ≤ 0 ,

λ − f 3 ( Y ) − f 3 0 f 3 * − f 3 0 ≤ 0 ,

λ − f 2 ( Y ) − f 2 0 f 2 * − f 2 0 ≤ 0 ,

λ − f 4 ( Y ) − f 4 0 f 4 * − f 4 0 ≤ 0 , (122)

x 1 + x 2 + x 3 + x 4 = 100 ,

21 ≤ x 1 ≤ 79 , 5 ≤ x 2 ≤ 59 , 2.1 ≤ x 3 ≤ 9 , 2.2 ≤ x 4 ≤ 7 . (123)

where the vector of unknowns has dimension of N + 1: X = { x 1 , ⋯ , x N , λ } , N = 4 .

Step 5. Solution of the λ-problem. For this purpose we use the function fmincon(…) [

As a result of the solution of VPMP (112)-(1117) at equivalent criteria and λ-problem corresponding to it (121)-(123) received:

X o = { X o , λ o } = { X o = { x 1 = 69.5 , x 2 = 24.1 , x 3 = 4.144 , x 4 = 2.2 } , λ o = 0.546 } —

an optimum point—design data of material, X^{o}, we will present in

f k ( X o ) , k = 1 , K ¯ 1 , K ¯ —sizes of criteria (characteristics of material):

F ( X o ) = { f 1 ( X o ) = 346.5 , f 2 ( X o ) = 2693.0 , f 3 ( X o ) = 134.2 , f 4 ( X o ) = 50.2 } (124)

λ k ( X o ) , k = 1 , K ¯ —sizes of the relative estimates

λ ( X o ) = { λ 1 ( X o ) = 0.546 , λ 2 ( X o ) = 0.72 , λ 3 ( X o ) = 0.546 , λ 4 ( X o ) = 0.546 } (125)

λ o = 0.546 is the maximum lower level among all relative estimates measured

in the relative units: λ o = min ( λ 1 ( X o ) , λ 2 ( X o ) , λ 3 ( X o ) , λ 4 ( X o ) ) , λ o —also call the guaranteed result in the relative units, i.e. λ_{k}(X^{o}) and according to the characteristic of the material f_{k}(X^{o}) it is impossible to improve, without worsening at the same time other characteristics.

Let’s notice that according to the theorem 2 [^{o} point criteria 1, 3, 4 are contradictory. This contradiction is defined by equality of λ o = min ( λ 1 ( X o ) , λ 2 ( X o ) , λ 3 ( X o ) , λ 4 ( X o ) ) , λ o = 0.546 , and other criteria inequality { λ k ( X o ) } > λ o .

Stage 4. Creation of geometrical interpretation of results of the decision in a three-dimensional coordinate system.

In an admissible point set of S formed by restrictions (116)-(117), optimum points X 1 * , X 2 * , X 3 * , X 4 * , united in a contour, present a point set, Pareto optimal, to S o ⊂ S . Coordinates of these points and also characteristics of material in the relative units: λ 1 ( X 1 * ) , λ 2 ( X 2 * ) , λ 3 ( X 3 * ) , λ 4 ( X 4 * ) are shown in _{1}, x_{3} and λ, where the third axis of λ—the relative assessment.

Let’s carry out the analysis of results of the solution of a vector problem (the analysis of the choice of an optimal solution at equivalent criteria—characteristics), using geometrical interpretation. For this purpose in ^{o} which conditionally represents the centre of a Pareto set. As a result conditionally received four subsets of points of X ∈ S q o ⊂ S o ⊂ S , q = 1 , 4 ¯ . The subset of S 1 o ⊂ S o ⊂ S is characterized by the fact that the relative assessment of λ 1 ≥ λ 2 , λ 3 , λ 4 , i.e. in the field of S 1 o first criterion has a priority over the others (definition of a priority see [

S o = S 1 o ∪ S 2 o ∪ S 3 o ∪ S 4 o .

Coordinates of all received points and the relative estimates are presented in two dimensional space in _{1}, x_{3}, λ} on the side of λ^{o}. Restrictions of a point set, Pareto optimal, in

Stage 5. Decision-making in the structure of material model at the set priority of criterion.

(Algorithm 2. The solution of a vector task with a criterion priority)

The person making decisions, as a rule, is the designer of material.

Step 1. The solution of a vector problem with equivalent criteria. Results of the decision are presented in Section 4.3. If results of the solution of a vector problem with equivalent criteria do not satisfy the person making the decision, then the choice of an optimal solution is carried out from any subset of points of S 1 o , S 2 o , S 3 o , S 4 o .

Step 2. Choice of priority criterion of q ∈ K .

From the theory (the Theorem 2 [^{o} there are always two most contradictory criteria: q ∈ K and v ∈ K for which in the relative units precise equality is carried out:

λ o = λ q ( X o ) = λ p ( X o ) , q , p ∈ K , X ∈ S ,

and for the others it is carried out inequalities: λ o ≤ λ k ( X o ) , ∀ k ∈ K , q ≠ p ≠ k .

For the choice of priority criterion on the display the message about results of the solution of λ-problem in physical and relative units is given:

Criteria (128) in X^{o} optimum point:

F ( X o ) = { f 1 ( X o ) = 346.5 , f 2 ( X o ) = 2693.0 , f 3 ( X o ) = 134.2 , f 4 ( X o ) = 50.2 } .

The relative estimates (129) in X^{o}:

λ ( X o ) = { λ 1 ( X o ) = 0.546 , λ 2 ( X o ) = 0.7235 , λ 3 ( X o ) = 0.546 , λ 4 ( X o ) = 0.546 } .

From here it is visible (conclusion), in model of material (112)-(117) and the corresponding λ-problem (121)-(123) such criteria are the first, third and fourth:

λ o = λ 1 ( X o ) , λ 3 ( X o ) , λ 4 ( X o ) = 0.546 , (126)

Let’s show the first and third in

As a rule, from a pair of conflicting criteria, a criterion chosen by the decision maker would be improved. Such criterion is called “priority criterion”, we will designate it q = 3 ∈ K . This criterion is investigated in interaction with the first criterion of q = 1 ∈ K . On the display the message is given:

q = input (‘Enter priority criterion (number) of q = ‘)—Entered: q = 3.

Step 3. Numerical limits of change of size of a priority of criterion of q = 3 ∈ K are defined. For priority criterion of q = 3 ∈ K changes of numerical limits in physical units upon transition from X^{o} optimum point to the point of X q * received on the first step at equivalent criteria are defined. q = 3 given about criterion are given for the screen:

f q ( X o ) = 134.183 ≤ f q ( X ) ≤ 150.238 = f q ( X q * ) , q ∈ K . (127)

In the relative units the criterion of q = 3 changes in the following limits:

λ q ( X o ) = 0.546 ≤ λ q ( X ) ≤ 1 = λ q ( X q * ) , q = 3 ∈ K .

These data it is analyzed.

Step 4. Choice of size of priority criterion of q ∈ K . (Decision-making).

On the message: “Enter the size of priority criterion f_{q} = “—we enter, the size of the characteristic defining structure of material: f q = 138.2 .

Step 5. The relative assessment is calculated.

For the chosen size of priority criterion f q = 15 00 the relative assessment is calculated:

λ q = f q − f q 0 f q * − f q 0 = 80 − 55.73 87.71 − 55.73 = 0.6596 , (128)

which upon transition from X^{o} point to X 3 * lies in limits:

λ q ( X o ) = 0.546 ≤ λ q ( X ) ≤ 0.6596 ≤ λ q ( X q * ) , q = 3 ∈ K .

Step 6. Let’s calculate coefficient of the linear approximation.

Assuming the linear nature of change of criterion of f_{q}(X) in (127) and according to the relative assessment of λ_{q}, using reference methods of the linear approximation, we will calculate a constant of proportionality between λ_{q}(X^{o}), λ_{q} which we will call ρ :

ρ = λ q − λ q ( X o ) λ q ( X q * ) − λ q ( X o ) = 0.8589 − 0.5534 1 − 0.5534 = 0.2502 , q = 3 ∈ K . (129)

Step 7. Let’s calculate coordinates of a priority of criteria with dimension of f_{q}

Assuming the linear nature of change of a vector of X q = { x 1 x 3 } , q = 3 we will determine point coordinates with dimension of f q = 138.2 , the relative assessment (128):

x λ = 0.6596 q = 3 = { x 1 = X o ( 1 ) + ρ ( X q * ( 1 ) − X o ( 1 ) ) , x 2 = X o ( 2 ) + ρ ( X q * ( 2 ) − X o ( 2 ) ) , x 3 = X o ( 3 ) + ρ ( X q * ( 3 ) − X o ( 3 ) ) , x 4 = X o ( 4 ) + ρ ( X q * ( 4 ) − X o ( 4 ) ) } , (130)

where X o = { x 1 = 69.5 , x 2 = 24.1 , x 3 = 4.144 , x 4 = 2.2 } ,

X 3 * = { x 1 = 79 , x 2 = 11.9 , x 3 = 2.1 , x 4 = 7 } .

As result of the decision (130) we will receive X^{q} point with coordinates:

X q = { x 1 = 71.877 , x 2 = 21.05 , x 3 = 3.673 , x 4 = 3.4 } .

Step 8. Calculation of the main indexes of a point of X_{q}.

For the received X^{q} point, we will calculate:

all criteria in physical units f k ( X q ) = { f k ( X q ) , k = 1 , K ¯ } ,

f ( X q ) = { f 1 ( X q ) = 329.5 , f 2 ( X q ) = 2841.8 , f 3 ( X q ) = 137.4 , f 4 ( X q ) = 46.6 } (131)

all relative estimates of criteria λ q = { λ k q , k = 1 , K ¯ } , λ k ( X q ) = f k ( X q ) − f k 0 f k * − f k 0 , k = 1 , K ¯ 1 , K ¯ ,

λ k ( X q ) = { λ 1 ( X q ) = 0.1929 , λ 2 ( X q ) = 0.5328 , λ 3 ( X q ) = 0.7242 , λ 4 ( X q ) = 0.7117 } . (132)

Analysis of results. The calculated size of criterion f q ( X t o ) , q ∈ K is usually not equal to the set f_{q}. The error of the choice of Δ f q = | f q ( X t o ) − f q | = | 137.4 − 138.2 | = 0.8 is defined by an error of linear approximation, Δ f q % = 0.04 % .

In the course of modeling parametrical restrictions (116)-(117) can be changed, i.e. some set of optimum decisions is received. Choose a final version which in our example included from this set of optimum decisions:

parameters of material: X o = { x 1 = 69.5 , x 2 = 24.1 , x 3 = 4.144 , x 4 = 2.2 } ,

X s u m m a = x 1 + x 2 + x 3 + x 4 = 100 ;

the parameters of the material at a given priority criterion q = 3:

X q = { x 1 = 71.877 , x 2 = 21.05 , x 3 = 3.673 , x 4 = 3.4 } ,

X s u m m a = x 1 + x 2 + x 3 + x 4 = 100 .

The problem of developing mathematical methods of vector optimization and making optimal decisions based on them in a complex engineering system for a set of experimental data and functional characteristics is one of the most important tasks of system analysis and design.

The methodology of constructing a mathematical model of an engineering system under conditions of certainty and uncertainty in the form of a vector problem of mathematical programming is developed. To solve the vector problem, new methods of vector optimization based on the normalization of criteria and the principle of guaranteed results are developed. Vector optimization methods allow us to make a decision, firstly, with equivalent criteria, and secondly, with a given criterion priority. When building characteristics in the conditions of uncertainty used regression methods of data conversion. The practice of “optimal decision-making” based on the mathematical model is shown on the numerical example of solving the vector optimization problem.

These methods of processing of the expert data and vector optimization can be used at design of engineering systems of various branches: electrotechnical, aerospace, metallurgical, etc. At creation of characteristics in the conditions of uncertainty regression methods of transformation of information are used. This methodology has system character and can be used when modeling technical, economic and other systems. Author is ready to participate in the solution of vector problems of linear and nonlinear programming.

The author declares no conflicts of interest regarding the publication of this paper.

Mashunin, Y. (2020) Mathematical Apparatus for Selection of Optimal Parameters of Technical, Technological Systems and Materials Based on Vector Optimization. American Journal of Operations Research, 10, 173-239. https://doi.org/10.4236/ajor.2020.105013