Revisiting Approximate Linear Programming Using a Saddle Point Based Reformulation and Root Finding Solution Approach

2017 ◽  
Author(s):  
Qihang Lin ◽  
Selvaprabu Nadarajah ◽  
Negar Soheili
Keyword(s):  
Linear Programming ◽  
Saddle Point ◽  
Solution Approach ◽  
Root Finding ◽  
Approximate Linear Programming

scholarly journals Max-min solution approach for multi-objective matrix game with fuzzy goals

2016 ◽  
Vol 26 (1) ◽  
pp. 51-60 ◽  
Author(s):  
Sandeep Kumar
Keyword(s):  
Linear Programming ◽  
Linear Programming Problem ◽  
Optimization Problem ◽  
Matrix Game ◽  
Game Model ◽  
Solution Approach ◽  
Multi Objective ◽  
Fuzzy Goals ◽  
Fuzzy Goal ◽  
Zero Sum

In this paper, we consider a multi-objective two person zero-sum matrix game with fuzzy goals, assuming that each player has a fuzzy goal for each of the payoffs. The max-min solution is formulated for this multi-objective game model, in which the optimization problem for each player is a linear programming problem. Every developed model for each player is demonstrated through a numerical example.

NEW IMPROVED METHOD FOR SOLVING THE FUZZY LINEAR PROGRAMMING PROBLEMS WITH VARIABLES GIVEN AS FUZZY NUMBERS

2021 ◽  
Vol 10 (12) ◽  
pp. 3699-3723
Author(s):  
L. Kané ◽  
M. Konaté ◽  
L. Diabaté ◽  
M. Diakité ◽  
H. Bado
Keyword(s):  
Linear Programming ◽  
Fuzzy Numbers ◽  
Optimal Solution ◽  
Fuzzy Linear Programming ◽  
Interval Linear Programming ◽  
Interval Numbers ◽  
Programming Technique ◽  
Solution Approach ◽  
Interval Linear ◽  
Linear Programming Problems

The present paper aims to propose an alternative solution approach in obtaining the fuzzy optimal solution to a fuzzy linear programming problem with variables given as fuzzy numbers with minimum uncertainty. In this paper, the fuzzy linear programming problems with variables given as fuzzy numbers is transformed into equivalent interval linear programming problems with variables given as interval numbers. The solutions to these interval linear programming problems with variables given as interval numbers are then obtained with the help of linear programming technique. A set of six random numerical examples has been solved using the proposed approach.

scholarly journals A Hybrid IP/GA Approach to the Parallel Production Lines Scheduling Problem

2016 ◽  
Vol 2016 ◽  
pp. 1-11
Author(s):  
Huizhi Ren ◽  
Shenshen Sun
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
Time Window ◽  
Valid Inequalities ◽  
Mixed Integer ◽  
Scheduling Problem ◽  
Production Lines ◽  
Solution Approach ◽  
Cp Decomposition

A special parallel production lines scheduling problem is studied in this paper. Considering the time window and technical constraints, a mixed integer linear programming (MILP) model is formulated for the problem. A few valid inequalities are deduced and a hybrid mixed integer linear programming/constraint programming (MILP/CP) decomposition strategy is introduced. Based on them, a hybrid integer programming/genetic algorithm (IP/GA) approach is proposed to solve the problem. At last, the numerical experiments demonstrate that the proposed solution approach is effective and efficient.

Sign in / Sign up

Export Citation Format

Share Document