An Interactive Fuzzy Satisficing Method for Fuzzy Random Multiobjective 0-1 Programming Problems through Probability Maximization Using Possibility

In this paper, we focus on multiobjective 0-1 programming problems under the situation where stochastic uncertainty and vagueness exist at the same time. We formulate them as fuzzy random multiobjective 0-1 programming problems where coefficients of objective functions are fuzzy random variables. For the formulated problem, we propose an interactive fuzzy satisficing method through probability maximization using of possibility

An Interactive Fuzzy Satisficing Method for Multiobjective Stochastic Integer Programming Problems through Simple Recourse Model

Two major approaches to deal with randomness or impression involved in mathematical programming problems have been developed. The one is called stochastic programming, and the other is called fuzzy programming. In this paper, we focus on multiobjective integer programming problems involving random variable coefficients in constraints. Using the concept of simple recourse, such multiobjective stochastic integer programming problems are transformed into deterministic ones. As a fusion of stochastic programming and fuzzy one, after introducing fuzzy goals to reflect the ambiguity of the decision maker's judgments for objective functions, we propose an interactive fuzzy satisficing method to derive a satisficing solution for the decision maker by updating the reference membership levels

Interactive Fuzzy Programming for Stochastic Two-level Linear Programming Problems through Probability Maximization

This paper considers stochastic two-level linear programming problems. Using the concept of chance constraints and probability maximization, original problems are transformed into deterministic ones. An interactive fuzzy programming method is presented for deriving a satisfactory solution efficiently with considerations of overall satisfactory balance

Interactive Fuzzy Random Two-level Linear Programming through Fractile Criterion Optimization

This paper considers two-level linear programming problems involving fuzzy random variables. Having introduced level sets of fuzzy random variables and fuzzy goals of decision makers, following fractile criterion optimization, fuzzy random two-level programming problems are transformed into deterministic ones. Interactive fuzzy programming is presented for deriving a satisfactory solution efficiently with considerations of overall satisfactory balance

Improved two-phase solution strategy for multiobjective fuzzy stochastic linear programming problems with uncertain probability distribution

Multiobjective Fuzzy Stochastic Linear Programming (MFSLP) problem where the linear inequalities on the probability are fuzzy is called a Multiobjective Fuzzy Stochastic Linear Programming problem with Fuzzy Linear Partial Information on Probability Distribution (MFSLPPFI). The uncertainty presents unique difficulties in constrained optimization problems owing to the presence of conflicting goals and randomness surrounding the data. Most existing solution techniques for MFSLPPFI problems rely heavily on the expectation optimization model, the variance minimization model, the probability maximization model, pessimistic/optimistic values and compromise solution under partial uncertainty of random parameters. Although these approaches recognize the fact that the interval values for probability distribution have important significance, nevertheless they are restricted by the upper and lower limitations of probability distribution and neglected the interior values. This limitation motivated us to search for more efficient strategies for MFSLPPFI which address both the fuzziness of the probability distributions, and the fuzziness and randomness of the parameters. The proposed strategy consists two phases: fuzzy transformation and stochastic transformation. First, ranking function is used to transform the MFSLPPFI to Multiobjective Stochastic Linear Programming Problem with Fuzzy Linear Partial Information on Probability Distribution (MSLPPFI). The problem is then transformed to its corresponding Multiobjective Linear Programming (MLP) problem by using a-cut technique of uncertain probability distribution and linguistic hedges. In addition, Chance Constraint Programming (CCP), and expectation of random coefficients are applied to the constraints and the objectives respectively. Finally, the MLP problem is converted to a single-objective Linear Programming (LP) problem via an Adaptive Arithmetic Average Method (AAAM), and then solved by using simplex method. The algorithm used to obtain the solution requires fewer iterations and faster generation of results compared to existing solutions. Three realistic examples are tested which show that the approach used in this study is efficient in solving the MFSLPPFI

Satisficing solutions for multiobjective stochastic linear programming problems

Multiobjective Stochastic Linear Programming is a relevant topic. As a matter of fact, many real life problems ranging from portfolio selection to water resource management may be cast into this framework. There are severe limitations in objectivity in this field due to the simultaneous presence of randomness and conflicting goals. In such a turbulent environment, the mainstay of rational choice does not hold and it is virtually impossible to provide a truly scientific foundation for an optimal decision. In this thesis, we resort to the bounded rationality and chance-constrained principles to define satisficing solutions for Multiobjective Stochastic Linear Programming problems. These solutions are then characterized for the cases of normal, exponential, chi-squared and gamma distributions. Ways for singling out such solutions are discussed and numerical examples provided for the sake of illustration. Extension to the case of fuzzy random coefficients is also carried out.Decision Science

Observation of temporary accommodation for construction workers according to the code of practice for temporary construction site workers amenities and accommodation (ms2593:2015) in Johor, Malaysia

The Malaysian government is currently improving the quality of workers temporary accommodation by introducing MS2593:2015 (Code of Practice for Temporary Site Workers Amenities and Accommodation) in 2015. It is in line with the initiative in the Construction Industry Transformation Programme (2016-2020) to increase the quality and well-being of construction workers in Malaysia. Thus, to gauge the current practice of temporary accommodation on complying with the particular guideline, this paper has put forth the observation of such accommodation towards elements in Section 3 within MS2593:2015. A total of seventeen (17) temporary accommodation provided by Grade 6 and Grade 7 contractors in Johor were selected and assessed. The results disclosed that most of the temporary accommodation was not complying with the guideline, where only thirteen (13) out of fifty-eight (58) elements have recorded full compliance (100%), and the lowest compliance percentage (5.9%) are discovered in the Section 3.12 (Signage). In a nutshell, given the significant gap of compliance between current practices of temporary accommodation and MS2593:2015, a holistic initiative need to be in place for the guideline to be worthwhile

Possibility/Necessity-Based Probabilistic Expectation Models for Linear Programming Problems with Discrete Fuzzy Random Variables

This paper considers linear programming problems (LPPs) where the objective functions involve discrete fuzzy random variables (fuzzy set-valued discrete random variables). New decision making models, which are useful in fuzzy stochastic environments, are proposed based on both possibility theory and probability theory. In multi-objective cases, Pareto optimal solutions of the proposed models are newly defined. Computational algorithms for obtaining the Pareto optimal solutions of the proposed models are provided. It is shown that problems involving discrete fuzzy random variables can be transformed into deterministic nonlinear mathematical programming problems which can be solved through a conventional mathematical programming solver under practically reasonable assumptions. A numerical example of agriculture production problems is given to demonstrate the applicability of the proposed models to real-world problems in fuzzy stochastic environments

A Distance Based Method for Solving Multi-objective Optimization Problems

A new model for the weighted method of goal programming is proposed based on minimizing the distances between ideal objectives to feasible objective space. It provides the best compromised solution for Multi Objective Linear Programming Problems (MOLPP). The proposed model tackles MOLPP by solving a series of single objective sub-problems, where the objectives are transformed into constraints. The compromise solution so obtained may be improved by defining priorities in terms of the weight. A criterion is also proposed for deciding the best compromise solution. Applications of the algorithm are discussed for transportation and assignment problems involving multiple and conflicting objectives. Numerical illustrations are given for the proposed model