A Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations
Authors
Abstract:
In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. On the one hand, these constraints enforce conditions on an arbitrary subgraph and then give sufficient conditions for feasibility, on the other hand, they provide a natural way to generalize the applied aspects of the model without increasing the number of the binary variables.
similar resources
a mathematical optimization model for solving minimum ordering problem with constraint analysis and some generalizations
in this paper, a mathematical method is proposed to formulate a generalized ordering problem. this model is formed as a linear optimization model in which some variables are binary. the constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. on the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...
full textA multi-objective mathematical model for nurse scheduling problem with hybrid DEA and augmented ε-constraint method: A case study
The efficient management of nursing personnel is of vital importance in a hospital’s environment comprising a vast share of the hospital’s operational costs. In the nurse scheduling problem (NSP), the target is to allocate shifts to the nurses in order to satisfy the hospital’s demand during the planning horizon by considering different objective functions. This paper presents a multi-objective...
full textAn Optimization Model for Epidemic Mitigation and Some Theoretical and Applied Generalizations
In this paper, we present a binary-linear optimization model to prevent the spread of an infectious disease in a community. The model is based on the remotion of some connections in a contact network in order to separate infected nodes from the others. By using this model we nd an exact optimal solution and determine not only the minimum number of deleted links but also their exact positions. T...
full textSolving Multiobjective Optimization Problem by Constraint Optimization
Multiobjective optimization problems (MOPs) have attracted intensive efforts from AI community and many multiobjective evolutionary algorithms (MOEAs) were proposed to tackle MOPs. In addition, a few researchers exploited MOEAs to solve constraint optimization problems (COPs). In this paper, we investigate how to tackle a MOP by iteratively solving a series of COPs and propose the algorithm nam...
full textA revisit of a mathematical model for solving fully fuzzy linear programming problem with trapezoidal fuzzy numbers
In this paper fully fuzzy linear programming (FFLP) problem with both equality and inequality constraints is considered where all the parameters and decision variables are represented by non-negative trapezoidal fuzzy numbers. According to the current approach, the FFLP problem with equality constraints first is converted into a multi–objective linear programming (MOLP) problem with crisp const...
full textOptimal Ordering and Issuing for Perishable Inventory Management Problem with A Minimum Inventory Volume Constraint
We study a perishable inventory system that requires to maintain a fresh and large quantity of inventory at all times. For example, certain pharmaceuticals are kept for emergency preparedness and response operations. We aim to maximize the profit by optimizing the joint problem of the ordering and issuing policies while maintaining a minimum amount of perishable inventory. First, we consider a ...
full textMy Resources
Journal title
volume 47 issue 1
pages 101- 117
publication date 2016-04-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023