Strictly feasible solutions and strict complementarity in multiple objective linear optimization

4OR ◽  
2016 ◽  
Vol 15 (3) ◽  
pp. 303-326
Author(s):  
N. Mahdavi-Amiri ◽  
F. Salehi Sadaghiani
2017 ◽  
Vol 9 (3) ◽  
pp. 1 ◽  
Author(s):  
Hossein Jamshidi

The Goal Programming (GP) is one of the many models which have been developed to deal with the multiple objectives decision-making problems. This model allows taking into account, simultaneously, many objectives while the decision-maker is seeking the best solution from among a set of feasible solutions. At first, the aim of this study is to compare the objectives of the decision maker based on the Analytical Hierarchy Process (AHP) and to rank the objectives according to the AHP process and once the objectives are set then apply the GP to the facility allocation in a real estate rental property.  The objective of decision maker is not only to maximize profit rather the decision maker has multiple objective to achieve. The methodology presented in this study can help the decision maker to formulate viable location strategies in the volatile and complex facility allocation environment. This is an empirical study applied to a local business developer utilizing multi objective decision analysis tools.


DYNA ◽  
2017 ◽  
Vol 84 (203) ◽  
pp. 257-262
Author(s):  
Orlando Belette-Fuentes ◽  
Rafael Zamora-Matamoros ◽  
Daimel Caballero-Echevarría

A mathematical model’s system for optimizing the efficiency for sampling exploration and exploitation networks in lateritic nickel and cobalt deposits, located in the north-eastern province of Holguin, was developed in the “Centro de Investigaciones del Níquel”. This system includes a new reservoir model based on multivariate substantial classification using the Markov model for discrete stochastic processes. As a result of the application of these models a linear optimization problem was obtained comprising an objective function, several constraints as inequalities and an additional restriction in the form of equality linked to the number of wells to be selected. Thegenerated problem has polynomial computational complexity and because no accurate methods exist to solve it, an automated tool that brings up feasible solutions was developed based on genetic algorithms.


2013 ◽  
Vol 221 (3) ◽  
pp. 190-200 ◽  
Author(s):  
Jörg-Tobias Kuhn ◽  
Thomas Kiefer

Several techniques have been developed in recent years to generate optimal large-scale assessments (LSAs) of student achievement. These techniques often represent a blend of procedures from such diverse fields as experimental design, combinatorial optimization, particle physics, or neural networks. However, despite the theoretical advances in the field, there still exists a surprising scarcity of well-documented test designs in which all factors that have guided design decisions are explicitly and clearly communicated. This paper therefore has two goals. First, a brief summary of relevant key terms, as well as experimental designs and automated test assembly routines in LSA, is given. Second, conceptual and methodological steps in designing the assessment of the Austrian educational standards in mathematics are described in detail. The test design was generated using a two-step procedure, starting at the item block level and continuing at the item level. Initially, a partially balanced incomplete item block design was generated using simulated annealing, whereas in a second step, items were assigned to the item blocks using mixed-integer linear optimization in combination with a shadow-test approach.


2014 ◽  
Author(s):  
Joe W. Tidwell ◽  
Michael Dougherty ◽  
Rick P. Thomas ◽  
Jeffrey S. Chrabaszcz
Keyword(s):  

2020 ◽  
Vol 5 (1) ◽  
pp. 456
Author(s):  
Tolulope Latunde ◽  
Joseph Oluwaseun Richard ◽  
Opeyemi Odunayo Esan ◽  
Damilola Deborah Dare

For twenty decades, there is a visible ever forward advancement in the technology of mobility, vehicles and transportation system in general. However, there is no "cure-all" remedy ideal enough to solve all life problems but mathematics has proven that if the problem can be determined, it is most likely solvable. New methods and applications will keep coming to making sure that life problems will be solved faster and easier. This study is to adopt a mathematical transportation problem in the Coca-Cola company aiming to help the logistics department manager of the Asejire and Ikeja plant to decide on how to distribute demand by the customers and at the same time, minimize the cost of transportation. Here, different algorithms are used and compared to generate an optimal solution, namely; North West Corner Method (NWC), Least Cost Method (LCM) and Vogel’s Approximation Method (VAM). The transportation model type in this work is the Linear Programming as the problems are represented in tables and results are compared with the result obtained on Maple 18 software. The study shows various ways in which the initial basic feasible solutions to the problem can be obtained where the best method that saves the highest percentage of transportation cost with for this problem is the NWC. The NWC produces the optimal transportation cost which is 517,040 units.


2020 ◽  
Vol 21 (4) ◽  
pp. 124-131
Author(s):  
Kalimash Begalinova ◽  
Madina Ashilov ◽  
Alibek Begalinov

Today, regional integration and globalization have added new dimensions to the problems of violence, religious extremism and terrorism that attract a lot of attention in the academic community of many counties. A polyconfessional and polyethnic state, Kazakhstan, where various trends of world religions are inevitably present, is especially aware of the problem of religious extremism. In these conditions, interconfessional relations as a guarantor of internal and external stability in our republic is one of its most important problems. This article presents the aspects related to the religious environment and threats of religious extremism in Kazakhstan and outlines feasible solutions.


Sign in / Sign up

Export Citation Format

Share Document