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...

An exact algorithm is developed for the chance-constrained multi-area reserve sizing problem in presence of transmission network constraints. The can be cast as a two-stage stochastic mixed integer linear program using sample approximation. Due to complicated structure problem, existing methods attempt find feasible solution based on heuristics. Existing mixed-integer algorithms that applied di...

this paper is in search of designing the cellular manufacturing systems (cmss) under dynamic and flexible environment. cm is proper for small-to-medium lot production environment that helps the companies to produce variable kind of productions with at least scraps. the most important benefits of cm are decline in material handling, reduction in work-in-process, reduction in set-up time, increme...

Fuzzy description logics (DLs) serve as a tool to handle vagueness in real-world knowledge. There is particular interest in logics implementing Łukasiewicz semantics, which has a number of favourable properties. Current decision procedures for Łukasiewicz fuzzy DLs work by reduction to exponentially large mixed integer programming problems. Here, we present a decision method that stays closer t...

multi objective quadratic fractional programming (moqfp) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the object...

Günlük and Pochet [O. Günlük , Y. Pochet: Mixing mixed integer inequalities. Mathematical Programming 90(2001) 429-457] proposed a procedure to mix mixed integer rounding (MIR) inequalities. The mixed MIR inequalities define the convex hull of the mixing set {(y, . . . , y, v) ∈ Z × R+ : α1y + v ≥ βi, i = 1, . . . ,m} and can also be used to generate valid inequalities for general as well as se...