This paper presents a review of past and present results approaches in the area motion planning using MIP (Mixed-integer Programming). Although early 2000s was still seen with reluctance as method for solving planning-related problems, nowadays, due to increases computational power theoretical advances, its extensive modeling capabilities versatility are coming fore enjoy increased application ...

In this paper we generalize the cut strengthening method of Balas and Perregaard for 0/1 mixed-integer programming to disjunctive programs with general two-term disjunctions. We apply our results to linear programs with complementarity constraints.

Applications of mixed integer programming can be found in many industries, such as transportation, healthcare, energy, and finance, their economic impact is significant. It also well known that programs (MIPs) very difficult to solve. Their challenge continues stimulate research the design implementation efficient effective techniques better solve them. In this study, we introduce a novel power...

Nurse scheduling is a topic widely studied due to its overall effect on patient care and hospital performance. This research focuses formulating Mixed Integer Programming (MIP) workforce model as nurse rostering problem. The incorporates multiple objectives of individual preference qualification. approached by categorizing nurses into different hierarchical levels based their qualifications pos...

In this paper, bi-level programming is proposed for designing a competitive supply chain network. A two-stage stochastic programming approach has been developed for a multi-product supply chain comprising a capacitated supplier, several distribution centers, retailers and some resellers in the market. The proposed model considers demand’s uncertainty and disruption in distribution centers and t...

This work considers the resolution of the system of fuzzy integer inequalities. It is shown that a system of fuzzy integer inequalities with concave membership functions can be reduced to a regular convex integer programming problem. A modified solution algorithm of the -th power Lagrangian method is introduced to deal with the resulting convex integer programming problem as a sequence of linea...

in this paper, we develop a capacitated location-covering model considering interval values for demand and service parameters. we also consider flexibility on distance standard for covering demand nodes by the servers. we use the satisfaction degree to represent the constraint of service capacity. the proposed model belongs to the class of mixed integer programming models. our model can be redu...