What people are saying - Write a review
We haven't found any reviews in the usual places.
CACSD AS GENERALIZED COOPERATIVE SEARCH
INTERACTIVE MULTIOBJECTIVE PROGRAMMING
9 other sections not shown
Other editions - View all
achievement function active indices aggregate performance indices approach bad values CACSD problem candidate designs chapter Co-operative Search Computer-Aided Design conceptual view control effort response control system design decision decision problem descent direction design methods design objectives design problem design process DFVLR dynamic efficient frontier efficient set efficient solutions evaluation exploratory stage FCOND feasible set functional constraints goal programming group active members hard constraints identified IMOP methods index bounds index groups index set initial design initial point interactive multi-objective programming interface linear linear subspace maximum absolute value minimax Model moving boundary process multivariable multivariable controller NPTG Example numerical search oo*ooo-o permutation Phaal procedures relational database resulting sample efficient subset scalarizing parameters search stage search-based section 7.2 step in Yl step response subspace Trade-Off Graph TRAJ trajectory tuples V/STOL V/STOL Problem value of step vector view of CACSD weighted distance function Zakian