Restaurant dynamic orders selection problem is an important issue in operational profits. Restaurant managers face many pressures, i.e. cook facilities and customer satisfaction, etc., therefore, they schedule orders in a manual (First-come-first-serve) way and do not willing pay more attention to orders selection problem. In order to satisfy customer’s needs, restaurants always loose profits day by day due to add more manpower and equipments. The main purpose of this research is to construct a dynamic order selection approach to maximize a restaurant profits. This study followed cloud computing approach for solving applied mathematic research topics. The proposed new approach, it hybrid Apache server and PHP coding techniques; furthermore, it contained the optimization tools, which were coding by this study using PHP language to precede revised simplex methods mixed branch-and-bound algorithm. Through validations, we found that the proposed approaches would help to increased 214% profits in practical restaurant. Future research suggests applied this approach to others industries’ dynamic orders selection problems.