Description: The multi-objective optimization algorithm based on genetic algorithm includes the concepts of dominating and non inferiority,rank and front , crowding distance and ParetoFraction
To Search:
File list (Check if you may need any files):
chapter9
chapter9\my_first_multi.m
chapter9\my_first_multi_run.m
chapter9\private
chapter9\private\activecstr.m
chapter9\private\aluform.m
chapter9\private\boxdirections.m
chapter9\private\callHybrid.m
chapter9\private\callOutputAndPlotFcns.m
chapter9\private\checkbound.m
chapter9\private\checkconstraints.m
chapter9\private\checkglobalsearchnlpinputs.m
chapter9\private\checkoptions.m
chapter9\private\checkPopulationInitRange.m
chapter9\private\constrValidate.m
chapter9\private\createOutputFunctions.m
chapter9\private\distanceAndSpread.m
chapter9\private\distancepoints.m
chapter9\private\eqconstrnullspace.m
chapter9\private\eqnsolv.m
chapter9\private\fcnvectorizer.m
chapter9\private\filterStartPoints.m
chapter9\private\fmultistart.p
chapter9\private\functionHandleOrCell.m
chapter9\private\functionHandleOrCellArray.m
chapter9\private\funevaluate.m
chapter9\private\gaAugConverged.m
chapter9\private\gaAugInit.m
chapter9\private\gaAugReset.m
chapter9\private\gaAugUpdate.m
chapter9\private\gacommon.m
chapter9\private\gacon.m
chapter9\private\gadiagnose.m
chapter9\private\gadsplot.m
chapter9\private\galincon.m
chapter9\private\gamultiobjConverged.m
chapter9\private\gamultiobjHybrid.m
chapter9\private\gamultiobjMakeState.m
chapter9\private\gamultiobjsolve.m
chapter9\private\gaoutput.m
chapter9\private\gaunc.m
chapter9\private\generateCode.m
chapter9\private\getFeasiblePoints.m
chapter9\private\getinitial.m
chapter9\private\globalsearchnlp.p
chapter9\private\gssdirections.m
chapter9\private\initialfeasible.m
chapter9\private\initialPopulationCheck.m
chapter9\private\isconverged.m
chapter9\private\isequalpoint.m
chapter9\private\isFcn.m
chapter9\private\isfeasible.m
chapter9\private\isItTimeToStop.m
chapter9\private\isTrialFeasible.m
chapter9\private\iterativedisplay.m
chapter9\private\lcondirections.m
chapter9\private\logscale.m
chapter9\private\makeState.m
chapter9\private\migrate.m
chapter9\private\mx_distancepoints.mexw64
chapter9\private\nextfeasible.m
chapter9\private\nonDominatedRank.m
chapter9\private\nonNegInteger.m
chapter9\private\nonNegScalar.m
chapter9\private\optionsList.m
chapter9\private\outputStoreContainer.m
chapter9\private\outstorefcn.m
chapter9\private\pCreateCandidatePointBounds.m
chapter9\private\pfminbnd.m
chapter9\private\pfmincon.m
chapter9\private\pfminlcon.m
chapter9\private\pfminunc.m
chapter9\private\poll.m
chapter9\private\poptimfcnchk.m
chapter9\private\populationIndices.m
chapter9\private\populationIndicies.m
chapter9\private\positiveInteger.m
chapter9\private\positiveIntegerArray.m
chapter9\private\positiveScalar.m
chapter9\private\positiveScalarArray.m
chapter9\private\preProcessLinearConstr.m
chapter9\private\propertyList.m
chapter9\private\psAugConverged.m
chapter9\private\psAugInit.m
chapter9\private\psAugReset.m
chapter9\private\psAugUpdate.m
chapter9\private\psdiagnose.m
chapter9\private\pseudoWeightAndGoal.m
chapter9\private\psnextfeasible.m
chapter9\private\psoutput.m
chapter9\private\rankAndDistance.m
chapter9\private\realScalar.m
chapter9\private\realUnitScalar.m
chapter9\private\reanneal.m
chapter9\private\resetDfltRng.m
chapter9\private\reshapeinput.m
chapter9\private\sacheckexit.m
chapter9\private\sadiagnose.m
chapter9\private\saengine.m
chapter9\private\sahonorbounds.m