### Abstract

This paper considers a fractional functional programming problem with interval coefficients of the type: According to the positivity or negativity of the function two linear programming problems are resulted to be solved to achieve the optimal solution. Combination of the two linear programming problems finally yields a mixed 0-1 linear programming problem which can be used to obtain the optimal solution of an absolute value linear fractional programming problem with interval coefficients in the objective function. A numerical example is given to illustrate the efficiency and the feasibility of the method.2013 Mojtaba Borza et al.

Original language | English |
---|---|

Pages (from-to) | 3641-3653 |

Number of pages | 13 |

Journal | Applied Mathematical Sciences |

Volume | 7 |

Issue number | 73-76 |

DOIs | |

Publication status | Published - 2013 |

### Fingerprint

### Keywords

- Absolute-value linear programming
- Convex combination
- Interval coefficients
- Linear fractional programming
- Mixed 0-1 linear programming

### ASJC Scopus subject areas

- Applied Mathematics

### Cite this

*Applied Mathematical Sciences*,

*7*(73-76), 3641-3653. https://doi.org/10.12988/ams.2013.33196

**Mixed 0-1 linear programming for an absolute value linear fractional programming with interval coefficients in the objective function.** / Borza, Mojtaba; Rambely, Azmin Sham; Saraj, Mansour.

Research output: Contribution to journal › Article

*Applied Mathematical Sciences*, vol. 7, no. 73-76, pp. 3641-3653. https://doi.org/10.12988/ams.2013.33196

}

TY - JOUR

T1 - Mixed 0-1 linear programming for an absolute value linear fractional programming with interval coefficients in the objective function

AU - Borza, Mojtaba

AU - Rambely, Azmin Sham

AU - Saraj, Mansour

PY - 2013

Y1 - 2013

N2 - This paper considers a fractional functional programming problem with interval coefficients of the type: According to the positivity or negativity of the function two linear programming problems are resulted to be solved to achieve the optimal solution. Combination of the two linear programming problems finally yields a mixed 0-1 linear programming problem which can be used to obtain the optimal solution of an absolute value linear fractional programming problem with interval coefficients in the objective function. A numerical example is given to illustrate the efficiency and the feasibility of the method.2013 Mojtaba Borza et al.

AB - This paper considers a fractional functional programming problem with interval coefficients of the type: According to the positivity or negativity of the function two linear programming problems are resulted to be solved to achieve the optimal solution. Combination of the two linear programming problems finally yields a mixed 0-1 linear programming problem which can be used to obtain the optimal solution of an absolute value linear fractional programming problem with interval coefficients in the objective function. A numerical example is given to illustrate the efficiency and the feasibility of the method.2013 Mojtaba Borza et al.

KW - Absolute-value linear programming

KW - Convex combination

KW - Interval coefficients

KW - Linear fractional programming

KW - Mixed 0-1 linear programming

UR - http://www.scopus.com/inward/record.url?scp=84880665147&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84880665147&partnerID=8YFLogxK

U2 - 10.12988/ams.2013.33196

DO - 10.12988/ams.2013.33196

M3 - Article

AN - SCOPUS:84880665147

VL - 7

SP - 3641

EP - 3653

JO - Applied Mathematical Sciences

JF - Applied Mathematical Sciences

SN - 1312-885X

IS - 73-76

ER -