De NoVo programming

Ha Thi Xuan Chi, PhD

MILAN ZELENY

Fordham University, New York, USA

De NoVo programming (Zenleny -1981, 1986)
New concepts of optimality, new ways of resolving MCDM conflicts,
and conditions for optimal and continuous system improvement:
❑ Optimizing a given system
❑ Designing an optimal system
Optimality
1. A given system:
a) Single objective function: Problem of measurement and search
(exemplified by linear programming ).
b) Multiple objective function: problem of decision making and
search (MCDM methodologies)
Optimality (cont.)
2. An optimal system
a) Single objective function: problem of design and measurement
( De Novo programming)
b) Multiple objective function: problem of design and decision
making ( De Novo programming)
 De Novo Programming procedure
Step 1: Formulate a linear programming problem:
De Novo Programming procedure
Step 2: Find the aspiration level vector z* by solving each objective
function of a system separately as

z*=(z1*,.., zq*) be the q- objective value for the ideal system

with respect to B.
 Multiple Criteria De Novo Programming procedure (cont.)

Step 3: Identify the minimum budget B*and its corresponding resource allocation
with the aspiration level
 Multiple Criteria De Novo Programming procedure (cont.)

Step 4: Use the optimum –path ration to obtain the final solution:

x=r*.x*
b=r*.b*
z=r*.z*

where

r∗=B/B*
Example of optimal design*
Table 1. Current portfolio of available capacities

Machine type Available Unit price($100 per hour)

Milling machine 1400 0.75
Lathe 1000 0.6
Grinder 1750 0.35
Jig saw 1325 0.5
Drill press 900 1.15
Band saw 1075 0.65

B=1400*0.75+1000*0.6+1750*0.35+1325*0.5+900*1.15+1075*0.65
=4658.75

( *adapted from “Optimal system design with multiple criteria: De Novo programming approach”)
Example of optimal design (cont.)
Table 2. Technological coefficients

Machine type Product 1 Product 2 Product 3

Milling machine 12 17 0
Lathe 3 9 8
Grinder 10 13 15
Jig saw 6 0 16
Drill press 0 12 7
Band saw 9.5 9.5 4
Example of optimal design (cont.)
Formulate the linear programming problem
Example of optimal design (cont.)
The above linear programming problem can be solved with
respect to each objective function separately:
Example of optimal design (cont.)
Table 3. Optimal design of capacities, making given “ideal” feasible

Machine type Recommended Original availability

availability (machine-
h/w)
Milling machine 1426.52 1400
Lathe 945.37 1000
Grinder 1858.31 1750
Jig saw 114.58 1325
Drill press 835.37 900
Band saw 1150.605 1075
The total cost of the system recommended in Table 3
is $4574.0792 < $4658.75=B
Example of optimal design (cont.)
Reconstruct the linear programming problem
Example of optimal design (cont.)
Solve reconstruct the linear programming problem with respect to each
objectives function separately:
Example of optimal design (cont.)
• Construct a metaoptimum problem
Example of optimal design (cont.)
• Solution:
•
Example of optimal design (cont.)
Table 4 : Metaoptimal design and its costs

Machine type Recommended Cost ($)

availability (machine-
h/w)
Milling machine 2080.5963 1560.527
Lathe 1292.925 775.7868
Grinder 2883.8523 1009.375
Jig saw 2051.6661 1025.831
Drill press 908.95709 1045.382
Band saw 1845.5731 1199.661
Total 11063.57 6616.563
Example of optimal design (cont.)
• r=B/B*=4658.75/6616.319 =0.70385

b" b"∗ 2080.703 1464.4

b# b∗# 1292.978 910.025
Machine type Recommended Cost ($)
b$ b∗$ 2883.929 2029.8
=r× ∗ =0.70385 × = availability
b% b% 2051.662 1444.06
(machine-h/w)
b& b∗& 909.208 639.76
(b*)
b' b∗' 1845.632 1299.55
Milling machine 2080.703 1560.527
cost"∗ b"∗ p" b"∗ 0.75 2080.703 1560.447
Lathe 1292.978 775.7868
cost ∗# b∗# p# b∗# 0.6 1292.978 775.755 Grinder
∗ ∗ ∗ 2883.929 1009.375
cost $ b$ p$ b 0.35 2883.929 1009.348
∗ =p× ∗ = p × $∗ = X = Jig saw 2051.662 1025.831
cost % b% % b% 0.5 2051.662 1025.833
cost &∗
b& p&
∗
b&∗ 1.15 909.208 1045.300 Drill press 909.208 1045.382
cost '∗
b'∗ p' b'∗ 0.65 1845.632 1199.622 Band saw 1845.632 1199.661
Total 11064.112 6616.563
 Ending slide
Put your last thoughts or wrap up here