▁form ulation ▁with ▁a ▁view ▁to ▁derive ▁a ▁form ulation ▁that ▁would ▁be ▁readily ▁am enable ▁to ▁solution . ▁This ▁is ▁a ▁problem - specific ▁task ▁which ▁involves ▁explo iting ▁a ▁problem ' s ▁specific ▁features . ▁The ▁mathematical ▁programming ▁format ▁of ▁Max imin ▁is ▁often ▁more ▁user - friend ly ▁in ▁this ▁regard . ▁ ▁The ▁best ▁example ▁is ▁of ▁course ▁the ▁classical ▁Max imin ▁model ▁of ▁ 2 - person ▁zero - sum ▁games ▁which ▁after ▁stream lin ing ▁is ▁reduced ▁to ▁a ▁standard ▁linear ▁programming ▁model ▁( Th ie ▁ 1 9 8 8 , ▁pp .   3 1 4 – 3 1 7 ) ▁that ▁is ▁readily ▁solved ▁by ▁linear ▁programming ▁algorithms . ▁ ▁To ▁re iter ate , ▁ ▁this ▁linear ▁programming ▁model ▁is ▁an ▁instance ▁of ▁the ▁generic ▁Max imin ▁model ▁obtained ▁via ▁simpl ification ▁of ▁the ▁classical ▁Max imin ▁form ulation ▁of ▁the ▁ 2 - person ▁zero - sum ▁game . ▁ ▁Another ▁example ▁is ▁dynamic ▁programming ▁where ▁the ▁Max imin ▁parad ig m ▁is ▁incorpor ated ▁in ▁the ▁dynamic ▁programming ▁functional ▁equation ▁representing ▁sequ ential ▁decision ▁processes ▁that ▁are ▁subject ▁to ▁severe ▁uncertainty ▁( e . g . ▁Sn ied ov ich ▁ 2 0 0 3 ). ▁ ▁Sum mary ▁ ▁Rec all ▁that ▁in ▁plain ▁language ▁the ▁Max imin ▁parad ig m ▁maintain s ▁the ▁following : ▁Max imin ▁Rule ▁The ▁maxim in ▁rule ▁tells ▁us ▁to ▁rank ▁alternatives ▁by ▁their ▁worst ▁possible ▁out comes : ▁we ▁are ▁to ▁adopt ▁the