CN102043839A - Template method for multidimensional integrated balancing of property and reliability, maintainability and supportability - Google Patents

Abstract

The invention discloses a template method for multidimensional integrated balancing of property and RMS (reliability, maintainability and supportability), comprising the following steps: (1) sorting a scheme, extracting data, and dividing the data into three classes: property data, RMS data and cost/ preparation time data; (2) processing the property data, and obtaining a property index value; (3) converting MTBF (Mean Time Between Failures) and MTTR (Mean Time To Repair) into use availability A0, carrying out standardization processing, and obtaining the standardized use availability A0*; (4) calculating cost equivalent, and standardizing; (5) inquiring the template according to the property index value, the A0* value and the standardized cost equivalent value c*; and (6) according to the value inquired by each scheme, determining the sequence of all schemes. The method can reduce the level of dependency on software, can quickly, conveniently and effectively obtains the scheme priority sequence, and provides support for scheme decisions at different stages in the comprehensive design of the product. The standardized comprehensive balancing step can reduce the faults in the comprehensive balancing and helps a decision maker to improve the decision level and quality.

Description

The template method of performance and the balance of reliability and maintanability, r﹠m protection Multidimensional Comprehensive

Affiliated technical field

The invention provides the template method of a kind of performance and reliability and maintanability, r﹠m protection (Reliability, Maintainability andSupportability are called for short RMS) Multidimensional Comprehensive balance, it relates to the schemes synthesis balance of product comprehensive Design different phase.According to the different performance of each scheme and RMS, expense, the comprehensive balance of inquiry template is for the program decisions of product comprehensive Design different phase provides support.Belong to the reliability engineering technical field.

Background technology

The comprehensive tradeoff decisions of performance and RMS is the important component part of comprehensive Design process, it mainly is by taking all factors into consideration performance and RMS characteristic limited design proposal to be weighed, compared, determining the quality between them, for decision references, is typical multiple attribute decision making (MADM) process.

The modern weapons equipment is generally pursued high-effect, low life cycle cost.Along with weaponry becomes increasingly complex, the subject that relates to, technology get more and more, and the performance and the RMS technical indicator of influence equipment usefulness and expense are more and more, and therefore, performance in the comprehensive Design and RMS program decisions are more apparent important.And current performance and RMS comprehensively weigh the calculating more complicated, can only use corresponding software during engineering is used can finish the work fast, and data are not carried out necessary classification in the computed in software process, all take identical processing mode, do not meet reality, and be easy to cause the error of missing data.All need to carry out a large amount of repetitive works during each calculating, reduced efficient, in addition, it is indeterminate comprehensively to weigh decision process.Given this, be necessary to provide the template method of a kind of performance and the balance of RMS Multidimensional Comprehensive.

Summary of the invention

The template method that the purpose of this invention is to provide the balance of a kind of performance and RMS Multidimensional Comprehensive, it only calculates by simple from template, just can obtain the method for the priority ordered of scheme by query template.So just can be under the situation that does not have software to support, the priority ordered of acquisition scheme that can be very easy whenever and wherever possible.

To achieve these goals, the present invention is a kind of to carry out the method for query scheme priority ordered based on template, mainly comprises following steps:

Step 1: the arrangement scheme, extract data, data are divided three classes: performance classes data, RMS class data and expense, lead time class data;

Step 2: the performance classes data are handled, drawn the performance index value, its method is as follows:

(1) data is carried out standardization

Attribute matrix M according to performance factor and scheme formation

Hope the normalization of large attribute index (numerical value is big more, and scheme is excellent more)

$r_{\mathrm{ij}}=\frac{m_{\mathrm{ij}}}{\sqrt{\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{m}_{\mathrm{ij}}^2}}i=\mathrm{1,2},\·\·\·,n,j=\mathrm{1,2},\·\·\·,m$

Hope the normalization of small-sized ATTRIBUTE INDEX (numerical value is more little, and scheme is excellent more)

$r_{\mathrm{ij}}=\frac{1/m_{\mathrm{ij}}}{\sqrt{\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{(1/m_{\mathrm{ij}})}^2}}i=\mathrm{1,2},\·\·\·,n,j=\mathrm{1,2},\·\·\·,m$

(2) numerical value after the standardization being carried out aggregative weighted calculates:

The attribute weight matrix:

W＝(w ₁，w ₂，…w _m) ^T

The performance index value of each scheme is:

$A=\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{r}_{\mathrm{ij}}*{\mathrm{\ω}}_j,i=\mathrm{1,2}\·\·\·m$

Step 3: use availability A with being converted into mean time between failures (MTBF) and mean repair time (MTTR) ₀, the column criterion of going forward side by side processing obtains the use availability A after the standardization ₀ ^*,, its method is as follows:

(1) calculates the use availability A of each scheme _0i

$A_{0i}=\frac{{\mathrm{MTBF}}_i}{{\mathrm{MTBF}}_i+{\mathrm{MTTR}}_i}$

(2) with A ₀Carry out standardization

$A_{0i}^{*}=\frac{A_{0i}}{\sqrt{\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{A}_{0i}^2}}$

Step 4: the computational costs equivalent column criterionization of going forward side by side, its method is as follows:

(1) computational costs equivalent c represents the total input under certain expense and the progress.

A, b represent expense, lead time respectively

c＝a ^α*b ^β(α+β＝1)

α, β represent expense and progress corresponding weights respectively

(2) parity of charges is carried out standardization:

${c^{*}}_i=\frac{1/c_i}{\sqrt{\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{(1/c_i)}^2}}$

Wherein, the expense of described each scheme and lead time, it is consistent that its unit wants.

Step 5: use availability A according to performance index value, standardization ₀ ^*Value, standardization parity of charges value c ^*Come query template, its method is as follows:

(1) template: the value of each [0,1] is divided into 10 parts, and the parity of charges after the selection standardization is a control variable, does 10 10 * 10 form, and the source of the value in the form is to calculate by following formula, and this value is all apart from the recency that connects of just thinking scheme.Wherein, described template, its making is that the popularization according to two-dimensional ideal point method shown in Figure 2 obtains.

Because performance index value P, A ₀ ^*Value, standardization parity of charges value c ^*All get the value in [0,1], and all get and be the bigger the better, therefore get positive ideal scheme [1,1,1], negative ideal scheme is [0,0,0], and the recency d that connects is:

$d=\frac{\sqrt{P^2+A_0^{*2}+c^{*2}}}{\sqrt{P^2+A_0^{*2}+c^{*2}}+\sqrt{{(1-P)}^2+{(1-A_0^{*})}^2+{(1-c^{*})}^2}}$

This formula is to draw by ideal point method, and the recency d value that connects that it draws is tabulated shown in the 1～table 10 as follows:

Table 1: parity of charges c ^*=0.1

Table 2: parity of charges c ^*=0.2

Table 3: parity of charges c ^*=0.3

Table 4: parity of charges c ^*=0.4

Table 5: parity of charges c ^*=0.5

Table 6: parity of charges c ^*=0.6

Table 7: parity of charges c ^*=0.7

Table 8: parity of charges c ^*=0.8

Table 9: parity of charges c ^*=0.9

Table 10: parity of charges c ^*=1.0

(2) upward the querying method of tabulation 1～table 10 form is as follows:

"what if" A: performance index value P _A, A ₀ ^*Value A ₀ ^* _A, standardization parity of charges value c ^* _A

Option b: performance index value P _B, A ₀ ^*Value A ₀ ^* _B, standardization parity of charges value c ^* _B

Single table inquiry: c ^* _A=c ^* _B(under certain input, the odds of different schemes)

At parity of charges is c ^* _ATable in, according to performance index value P, the A of two schemes ₀ ^*Value is tabled look-up, and determines two value d _A, d _B

Stride table inquiry: c ^* _A≠ c ^* _B(under different inputs, the odds of different schemes)

At parity of charges is c ^* _ATable in, according to P _A, A ₀ ^* _AValue in form, inquire about the respective value d that determines option A _A

At parity of charges is c ^* _BTable in, according to P _B, A ₀ ^* _BValue in form, inquire about the respective value d that determines option b _B

(3) performance index value P, A0 ^*Value, standardization parity of charges value c ^*Between the table in adjacent two the number between the time computing method:

1. only have a value between the table in adjacent two the number between: be assumed to performance index value 0.55

0.5	0.55	0.6
			X 1	x	X 2

According to the performance index value is to inquire a value x at 0.5 o'clock ₁, be to inquire another number x at 0.6 o'clock according to the performance index value ₂, adopt linear interpolation

$\frac{x-x_1}{0.55-0.5}=\frac{x_2-x_1}{0.6-0.5}$

Determine x value (promptly (0.5, x ₁), (0.6, x ₂) carry out linear interpolation between 2)

2. if two values all between adjacent two numbers, are assumed to performance index value 0.55 in table, use availability 0.55

According to using availability is 0.5 o'clock, and the performance index value is to inquire a value x at 0.5 o'clock ₁, be to inquire another number x at 0.6 o'clock according to the performance index value ₂

According to using availability is 0.6 o'clock, and the performance index value is to inquire a value y at 0.5 o'clock ₁, be to inquire another number y at 0.6 o'clock according to the performance index value ₂

According to usage degree 0.5 o'clock x ₁, x ₂, utilize linear interpolation to determine x ₀

According to usage degree 0.6 o'clock y ₁, y ₂, utilize linear interpolation to determine y ₀

Then (0.5, x ₀), (0.6, y ₀) 2 utilize linear interpolation to determine corresponding value;

3. if three values all in table between adjacent two numbers, the same with said method, be assumed to performance index value 0.55, use availability 0.55, parity of charges is 0.55

When parity of charges is 0.5, and only there is two values situation between adjacent two numbers in table the same, draws X;

When parity of charges is 0.6, and only there is two values situation between adjacent two numbers in table the same, draws Y;

(0.5, X), (0.6, Y) carry out linear interpolation between two values, determine final value.

Step 6:, determine the ordering of each scheme according to the value that each scheme inquires.

The value that "what if" A goes out according to template query is d _A, the value that option b goes out according to template query is d _B

If d _A＞d _B, option A is better than option b

If d _A＜d _B, option b is better than option A

If d _A=d _B, option A and option b equivalence

The present invention has provided the template method of a kind of performance and RMS Multidimensional Comprehensive balance by above step.

Major advantage of the present invention is: 1. can reduce degree of dependence to software, only just can simple and efficient effective acquisition scheme priority ordered by simple calculating, and for the program decisions of product comprehensive Design different phase provides support.2. the present invention just expense class data consider that also data are divided three classes in the process of comprehensive balance: performance classes, RMS class, expense class, orderliness is clear, different pieces of information adopts different disposal routes, has realistic meaning.Can effectively avoid the mistake of data missing data more for a long time.3. a large amount of repetitive works comprehensively in template, avoided the repetition of work, improved efficient.4. by normalized comprehensive balance step, can reduce the error in the comprehensive balance, aid decision making person improves decision-making level and quality.

Description of drawings

Fig. 1 is the FB(flow block) of the method for the invention

Fig. 2 is the expression view of two-dimensional ideal point method (being comprehensive trades space) among the present invention

Symbol description is as follows among Fig. 2:

Symbol A among Fig. 2 ₁, A ₂, A ₃, A ₄, A ₅, A ₆, A ₇, A ₈Represent each scheme,

Represent positive ideal scheme,

The negative ideal scheme of representative

Embodiment

For making feature of the present invention and advantage obtain clearer understanding, below in conjunction with accompanying drawing, be described in detail below: Fig. 1 is the FB(flow block) of the method for the invention.

The present invention is the template method of a kind of performance and the balance of RMS Multidimensional Comprehensive, and its FB(flow block) is seen shown in Figure 1, and concrete implementation step is as follows:

Step 1: the arrangement scheme, extract data, data are divided three classes: performance classes data, RMS class data, expense/lead time class data.

The performance classes data:

RMS class data:

Expense, lead time class data:

Step 2: the performance classes data are handled, drawn the performance index value.

Data are carried out standardization.

Attribute matrix M according to performance factor and scheme formation

$M=\left[\begin{array}{cccc}90& 3& 45& 110\\ 100& 5& 32& 130\\ 110& 4& 40& 120\end{array}\right]$

Data are carried out standardization

Hope the normalization of large attribute index (numerical value is big more, and scheme is excellent more)

$r_{\mathrm{ij}}=\frac{m_{\mathrm{ij}}}{\sqrt{\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{m}_{\mathrm{ij}}^2}}i=\mathrm{1,2},\·\·\·,n,j=\mathrm{1,2},\·\·\·,m$

Hope the normalization of small-sized ATTRIBUTE INDEX (numerical value is more little, and scheme is excellent more)

$r_{\mathrm{ij}}=\frac{1/m_{\mathrm{ij}}}{\sqrt{\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{(1/m_{\mathrm{ij}})}^2}}i=\mathrm{1,2},\·\·\·,n,j=\mathrm{1,2},\·\·\·,m$

Obtain matrix R behind the normalizing

$R=\left[\begin{array}{cccc}0.518& 0.424& 0.660& 0.528\\ 0.575& 0.707& 0.469& 0.624\\ 0.633& 0.566& 0.587& 0.576\end{array}\right]$

Numerical value after the standardization is carried out aggregative weighted to be calculated:

The attribute weight matrix:

W＝(0.4?0.2?0.2?0.2) ^T

According to $A=\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{r}_{\mathrm{ij}}*{\mathrm{\ω}}_j,i=\mathrm{1,2}\·\·\·m$

The performance index value that obtains each scheme is:

Scheme 1:P ₁=0.53

Scheme 2:P ₂=0.59

Scheme 3:P ₃=0.60

Step 3: MTBF and MTTR are converted into use availability A ₀, the column criterion of going forward side by side processing obtains the use availability A after the standardization ₀ ^*

Calculate the use availability A of each scheme _0i

$A_{0i}=\frac{{\mathrm{BF}}_i}{{\mathrm{MTBF}}_i+{\mathrm{MTTR}}_i}$

A ₀₁＝0.9 A ₀₂＝0.95 A ₀₃＝0.85

With A ₀Carry out standardization

$A_{0i}^{*}=\frac{A_{0i}}{\sqrt{\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{A}_{0i}^2}}$

A ₀ ^* ₁＝0.58 A ₀ ^* ₂＝0.61 A ₀ ^* ₃＝0.545

Step 4: the computational costs equivalent column criterionization of going forward side by side

Get α=β=0.5

According to c=a ^1/2* b ^1/2

Obtain c ₁=38.73 c ₂=42.426 c ₁=42.426

Parity of charges is carried out standardization: ${c^{*}}_i=\frac{1/c_i}{\sqrt{\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{(1/c_i)}^2}}$

Obtain c ₁ ^*=0.61 c ₂ ^*=0.56 c ₃ ^*=0.56

Step 5: according to performance index value, A ₀ ^*Value, standardization parity of charges value c ^*Inquire about following template form, the value in the template form is the recency that connects apart from positive ideal scheme, and concrete numerical value is shown in following table 1～table 10:

Table 1: parity of charges c ^*=0.1

Table 2: parity of charges c ^*=0.2

Table 3: parity of charges c ^*=0.3

Table 4: parity of charges c ^*=0.4

Table 5: parity of charges c ^*=0.5

Table 6: parity of charges c ^*=0.6

Table 7: parity of charges c ^*=0.7

Table 8: parity of charges c ^*=0.8

Table 9: parity of charges c ^*=0.9

Table 10: parity of charges c ^*=1.0

To scheme 1, get c ₁ ^*=0.6 A ₀ ^* ₁=0.5 P ₁=0.5, query template (table 6) gets x ₁=0.53304

A ₀ ^* ₁=0.5 P ₁=0.6, query template (table 6) gets x ₂=0.56607

Get c ₁ ^*=0.6 A ₀ ^* ₁=0.6 P ₁=0.5, query template (table 6) gets y ₁=0.56607

A ₀ ^* ₁=0.6 P ₁=0.6, query template (table 6) gets y ₂=0.6

Get c ₁ ^*=0.7 A ₀ ^* ₁=0.5 P ₁=0.5, query template (table 7) gets x ₁ ^*=0.56434

A ₀ ^* ₁=0.5 P ₁=0.6, query template (table 7) gets x ₂ ^*=0.5973

Get c ₁ ^*=0.7 A ₀ ^* ₁=0.6 P ₁=0.5, query template (table 7) gets y ₁ ^*=0.5973

A ₀ ^* ₁=0.6 P ₁=0.6, query template (table 7) gets y ₂ ^*=0.63207

As parity of charges c ₁ ^*Got 0.6 o'clock:

According to using availability is 0.5 o'clock x ₁, x ₂, utilize linear interpolation to determine x ₀

According to using availability is 0.6 o'clock y ₁, y ₂, utilize linear interpolation to determine y ₀

Then (0.5, x ₀), (0.6, y ₀) 2 utilize linear interpolation to determine corresponding value; 0.569589 as parity of charges c ₁ ^*Got 0.7 o'clock:

According to using availability is 0.5 o'clock x ₁, x ₂, utilize linear interpolation to determine x ₀

According to using availability is 0.6 o'clock y ₁, y ₂, utilize linear interpolation to determine y ₀

Then (0.5, x ₀), (0.6, y ₀) 2 utilize linear interpolation to determine corresponding value; 0.5963914 between (0.6,0.569589), (0.7,0.5963914), utilize linear interpolation, obtain d ₁=0.57227 in like manner, obtains scheme 2:d ₂=0.58652 scheme 3:d ₃=0.56818

Query template as can be known, scheme 1:d ₁=0.57227

Scheme 2:d ₂=0.58652

Scheme 3:d ₃=0.56818

Step 6:, determine the ordering of each scheme according to the value that each scheme inquires.

Because 0.58652＞0.57227＞0.56818

So the ordering of three schemes is that scheme 2 is better than scheme 1, scheme 1 is better than scheme 3

The present invention has provided the template method of a kind of performance and RMS Multidimensional Comprehensive balance by above step.

Claims (8)

1. the template method of performance and RMS Multidimensional Comprehensive balance, it is characterized in that: it comprises following steps:

Step 1: the arrangement scheme, extract data, data are divided three classes: performance classes data, RMS class data and expense, lead time class data;

Step 2: the performance classes data are handled, drawn the performance index value, its method is as follows:

(1) data is carried out standardization

Attribute matrix M according to performance factor and scheme formation

Hope the normalization of large attribute index

$r_{\mathrm{ij}}=\frac{m_{\mathrm{ij}}}{\sqrt{\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{m}_{\mathrm{ij}}^2}}i=\mathrm{1,2},\·\·\·,n,j=\mathrm{1,2},\·\·\·,m$

Hope the normalization of small-sized ATTRIBUTE INDEX

$r_{\mathrm{ij}}=\frac{1/m_{\mathrm{ij}}}{\sqrt{\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{(1/m_{\mathrm{ij}})}^2}}i=\mathrm{1,2},\·\·\·,n,j=\mathrm{1,2},\·\·\·,m$

(2) numerical value after the standardization being carried out aggregative weighted calculates:

The attribute weight matrix:

W＝(w ₁，w ₂，…w _m) ^T

The performance index value of each scheme is:

$A=\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{r}_{\mathrm{ij}}*{\mathrm{\ω}}_j,i=\mathrm{1,2}\·\·\·m;$

Step 3: will be MTBF and mean repair time to be that MTTR is converted into use availability A the mean time between failures ₀, the column criterion of going forward side by side processing obtains the use availability A after the standardization ₀ ^*,, its method is as follows:

(1) calculates the use availability A of each scheme _0i

$A_{0i}=\frac{{\mathrm{MTBF}}_i}{{\mathrm{MTBF}}_i+{\mathrm{MTTR}}_i}$

(2) with A ₀Carry out standardization

$A_{0i}^{*}=\frac{A_{0i}}{\sqrt{\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{A}_{0i}^2}}$

Step 4: the computational costs equivalent column criterionization of going forward side by side, its method is as follows:

(1) computational costs equivalent c represents the total input under certain expense and the progress

A, b represent the expense and the lead time of each scheme respectively

c＝a ^α*b ^β(α+β＝1)

α, β represent expense and progress corresponding weights respectively

(2) parity of charges is carried out standardization:

${c^{*}}_i=\frac{1/c_i}{\sqrt{\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{(1/c_i)}^2}}$

Step 5: use availability A according to performance index value, standardization ₀ ^*Value, standardization parity of charges value c ^*Come query template, its method is as follows:

(1) template: the value of each [0,1] is divided into 10 parts, and the parity of charges after the selection standardization is a control variable, does 10 10 * 10 form, and the source of the value in the form is by calculating, and this value is all apart from the recency d that connects of positive ideal scheme;

(2) querying method of form is as follows:

"what if" A: performance index value P _A, A ₀ ^*Value A ₀ ^* _A, standardization parity of charges value c ^* _A

Option b: performance index value P _B, A ₀ ^*Value A ₀ ^* _B, standardization parity of charges value c ^* _B

Single table inquiry: c ^* _A=c ^* _B(under certain input, the odds of different schemes)

At parity of charges is c ^* _ATable in, according to performance index value P, the A of two schemes ₀ ^*Value is tabled look-up, and determines two value d _A, d _B

Stride table inquiry: c ^* _A≠ c ^* _B(under different inputs, the odds of different schemes)

At parity of charges is c ^* _ATable in, according to P _A, A ₀ ^* _AValue in form, inquire about the respective value d that determines option A _A

At parity of charges is c ^* _BTable in, according to P _B, A ₀ ^* _BValue in form, inquire about the respective value d that determines option b _B

(3) performance index value P, A0 ^*Value, standardization parity of charges value c ^*Between the table in adjacent two the number between the time computing method:

1. only have a value between the table in adjacent two the number between: be assumed to performance index value 0.55

0.5 0.55 0.6 X ₁ x X ₂

According to the performance index value is to inquire a value x at 0.5 o'clock ₁, be to inquire another number x at 0.6 o'clock according to the performance index value ₂, adopt linear interpolation

$\frac{{x-x}_1}{0.55-0.5}=\frac{x_2-x_1}{0.6-0.5}$

Determine x value (promptly (0.5, x ₁), (0.6, x ₂) carry out linear interpolation between 2)

2. if two values all between adjacent two numbers, are assumed to performance index value 0.55 in table, use availability 0.55

According to using availability is 0.5 o'clock, and the performance index value is to inquire a value x at 0.5 o'clock ₁, be to inquire another number x at 0.6 o'clock according to the performance index value ₂

According to using availability is 0.6 o'clock, and the performance index value is to inquire a value y at 0.5 o'clock ₁, be to inquire another number y at 0.6 o'clock according to the performance index value ₂

According to usage degree 0.5 o'clock x ₁, x ₂, utilize linear interpolation to determine x ₀

According to usage degree 0.6 o'clock y ₁, y ₂, utilize linear interpolation to determine y ₀

Then (0.5, x ₀), (0.6, y ₀) 2 utilize linear interpolation to determine corresponding value;

3. if three values all in table between adjacent two numbers, the same with said method, be assumed to performance index value 0.55, use availability 0.55, parity of charges is 0.55

When parity of charges is 0.5, and only there is two values situation between adjacent two numbers in table the same, draws X;

When parity of charges is 0.6, and only there is two values situation between adjacent two numbers in table the same, draws Y;

(0.5, X), (0.6, Y) carry out linear interpolation between two values, determine final value.

Step 6:, determine the ordering of each scheme according to the value that each scheme inquires

The value that "what if" A goes out according to template query is d _A, the value that option b goes out according to template query is d _B

If d _A＞d _B, option A is better than option b

If d _A＜d _B, option b is better than option A

If d _A=d _B, option A and option b equivalence

The present invention has provided the template method of a kind of performance and RMS Multidimensional Comprehensive balance by above step.

2. the template method of a kind of performance according to claim 1 and the balance of RMS Multidimensional Comprehensive is characterized in that:

In step 1, data are divided three classes: performance classes, RMS class and expense, lead time class.

3. the template method of a kind of performance according to claim 1 and the balance of RMS Multidimensional Comprehensive is characterized in that:

In the prestige large attribute index described in the step 2, its numerical value is big more, and scheme is excellent more; Hope small-sized ATTRIBUTE INDEX, its numerical value is more little, and scheme is excellent more.

4. the template method of a kind of performance according to claim 1 and the balance of RMS Multidimensional Comprehensive is characterized in that:

In the expense and the lead time of each scheme described in the step 4, it is consistent that its unit wants.

5. the template method of a kind of performance according to claim 1 and the balance of RMS Multidimensional Comprehensive is characterized in that:

In the template described in the step 5, its making is that the popularization according to two-dimensional ideal point method obtains.

6. the template method of a kind of performance according to claim 1 and the balance of RMS Multidimensional Comprehensive is characterized in that:

At the recency d that connects described in the step 5, its computing formula is to draw by ideal point method; Because performance index value P, A ₀ ^*Value, standardization parity of charges value c ^*All get the value in [0,1], and all get and be the bigger the better, therefore get positive ideal scheme [1,1,1], negative ideal scheme is [0,0,0], and the recency d that connects is:

$d=\frac{\sqrt{P^2+A_0^{*2}+c^{*2}}}{\sqrt{P^2+A_0^{*2}+c^{*2}}+\sqrt{{(1-P)}^2+{(1-A_0^{*})}^2+{(1-c^{*})}^2}}$

7. the template method of a kind of performance according to claim 1 and the balance of RMS Multidimensional Comprehensive is characterized in that:

At the recency d that connects described in the step 5, its value is tabulated shown in the 1～table 10 as follows:

Table 1: parity of charges c ^*=0.1

Table 2: parity of charges c ^*=0.2

Table 3: parity of charges c ^*=0.3

Table 4: parity of charges c ^*=0.4

Table 5: parity of charges c ^*=0.5

Table 6: parity of charges c ^*=0.6

Table 7: parity of charges c ^*=0.7

Table 8: parity of charges c ^*=0.8

Table 9: parity of charges c ^*=0.9

Table 10: parity of charges c ^*=1.0

8. the template method of a kind of performance according to claim 6 and the balance of RMS Multidimensional Comprehensive is characterized in that:

This recency d that connects, the listed table of its value is table 1～table 10, the querying method of those tables is as follows:

(1) "what if" A: performance index value P _A, A ₀ ^*Value A ₀ ^* _A, standardization parity of charges value c ^* _A

Option b: performance index value P _B, A ₀ ^*Value A ₀ ^* _B, standardization parity of charges value c ^* _B

Single table inquiry: c ^* _A=c ^* _BRepresentative is under certain input, and the odds of different schemes

At parity of charges is c ^* _ATable in, according to performance index value P, the A of two schemes ₀ ^*Value is tabled look-up, and determines two value d _A, d _B

Stride table inquiry: c ^* _A≠ c ^* _BRepresentative is under different inputs, and the odds of different schemes

At parity of charges is c ^* _ATable in, according to P _A, A ₀ ^* _AValue in form, inquire about the respective value d that determines option A _A

At parity of charges is c ^* _BTable in, according to P _B, A ₀ ^* _BValue in form, inquire about the respective value d that determines option b _B

(2) performance index value P, A0 ^*Value, standardization parity of charges value c ^*Between the table in adjacent two the number between the time computing method:

1. only have a value between the table in adjacent two the number between: be assumed to performance index value 0.55

0.5 0.55 0.6 X ₁ x X ₂

According to the performance index value is to inquire a value x at 0.5 o'clock ₁, be to inquire another number x at 0.6 o'clock according to the performance index value ₂, adopt linear interpolation

$\frac{x-x_1}{0.55-0.5}=\frac{x_2-x_1}{0.6-0.5}$

Determine the value of x, promptly (0.5, x ₁), (0.6, x ₂) carry out linear interpolation between 2

2. if two values all between adjacent two numbers, are assumed to performance index value 0.55 in table, use availability 0.55

According to using availability is 0.5 o'clock, and the performance index value is to inquire a value x at 0.5 o'clock ₁, be to inquire another number x at 0.6 o'clock according to the performance index value ₂

According to using availability is 0.6 o'clock, and the performance index value is to inquire a value y at 0.5 o'clock ₁, be to inquire another number y at 0.6 o'clock according to the performance index value ₂

According to usage degree 0.5 o'clock x ₁, x ₂, utilize linear interpolation to determine x ₀

According to usage degree 0.6 o'clock y ₁, y ₂, utilize linear interpolation to determine y ₀

Then (0.5, x ₀), (0.6, y ₀) 2 utilize linear interpolation to determine corresponding value;

3. if three values all in table between adjacent two numbers, the same with said method, be assumed to performance index value 0.55, use availability 0.55, parity of charges is 0.55;

When parity of charges is 0.5, and only there is two values situation between adjacent two numbers in table the same, draws X;

When parity of charges is 0.6, and only there is two values situation between adjacent two numbers in table the same, draws Y;

(0.5, X), (0.6, Y) carry out linear interpolation between two values, determine final value.

Images