scholarly journals A goal programming procedure for solving fuzzy multiobjective fractional linear programming problems

2014 ◽  
Vol 5 (2) ◽  
pp. 401-414 ◽  
Author(s):  
Tunjo Perić ◽  
Zoran Babić ◽  
Sead Rešić
Keyword(s):  
Linear Programming ◽  
Goal Programming ◽  
Fractional Linear Programming ◽  
Linear Programming Problems

scholarly journals An Improvement for Fuzzy Stochastic Goal Programming Problems

2017 ◽  
Vol 2017 ◽  
pp. 1-9
Author(s):  
Shu-Cheng Lin ◽  
Han-Wen Tuan ◽  
Peterson Julian
Keyword(s):  
Linear Programming ◽  
Goal Programming ◽  
Random Environment ◽  
Solution Process ◽  
Lower Side ◽  
Stochastic Goal Programming ◽  
Linear Programming Problems ◽  
Standard Linear ◽  
Standard Linear Programming

We examined the solution process for linear programming problems under a fuzzy and random environment to transform fuzzy stochastic goal programming problems into standard linear programming problems. A previous paper that revised the solution process with the lower-side attainment index motivated our work. In this paper, we worked on a revision for both-side attainment index to amend its definition and theorems. Two previous examples were used to examine and demonstrate our improvement over previous results. Our findings not only improve the previous paper with both-side attainment index, but also provide a theoretical extension from lower-side attainment index to the both-side attainment index.

A PENALTY METHOD FOR SOLVING BILEVEL LINEAR FRACTIONAL/LINEAR PROGRAMMING PROBLEMS

2004 ◽  
Vol 21 (02) ◽  
pp. 207-224 ◽  
Author(s):  
HERMINIA I. CALVETE ◽  
CARMEN GALÉ
Keyword(s):  
Linear Programming ◽  
Objective Function ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Optimization Approach ◽  
Fractional Linear Programming ◽  
Linear Programming Problems ◽  
Level Problem ◽  
The Relationship ◽  
Planning Problems

Bilevel programming involves two optimization problems where the constraint region of the first-level problem is implicitly determined by another optimization problem. This model has been applied to decentralized planning problems involving a decision process with a hierarchical structure. In this paper, we consider the bilevel linear fractional/linear programming problem, in which the objective function of the first-level is linear fractional, the objective function of the second level is linear, and the common constraint region is a polyhedron. For this problem, taking into account the relationship between the optimization problem of the second level and its dual, a global optimization approach is proposed that uses an exact penalty function based on the duality gap of the second-level problem.

scholarly journals A Solution Algorithm for Interval Transportation Problems via Time-Cost Tradeoff

2018 ◽  
Vol 14 (2) ◽  
pp. 7691-7701
Author(s):  
Inci Albayrak ◽  
Mustafa Sivri ◽  
Gizem Temelcan
Keyword(s):  
Dynamic Programming ◽  
Linear Programming ◽  
Integer Programming ◽  
Goal Programming ◽  
Transportation Problem ◽  
Solution Algorithm ◽  
Time Cost ◽  
Mathematical Methods ◽  
Interval Time ◽  
Linear Programming Problems

In this paper, an algorithm for solving interval time-cost tradeoff transportation problemsis presented. In this problem, all the demands are defined as intervalto determine more realistic duration and cost. Mathematical methods can be used to convert the time-cost tradeoff problems to linear programming, integer programming, dynamic programming, goal programming or multi-objective linear programming problems for determining the optimum duration and cost. Using this approach, the algorithm is developed converting interval time-cost tradeoff transportation problem to the linear programming problem by taking into consideration of decision maker (DM).

Sign in / Sign up

Export Citation Format

Share Document