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

Mojtaba Borza, Azmin Sham Rambely, Mansour Saraj

Research output: Contribution to journalArticle

4 Citations (Scopus)

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 languageEnglish
Pages (from-to)3641-3653
Number of pages13
JournalApplied Mathematical Sciences
Volume7
Issue number73-76
DOIs
Publication statusPublished - 2013

Fingerprint

Fractional Programming
Absolute value
Linear programming
Objective function
Interval
Coefficient
Functional programming
Optimal Solution
Functional Programming
Positivity
Numerical Examples

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

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.

In: Applied Mathematical Sciences, Vol. 7, No. 73-76, 2013, p. 3641-3653.

Research output: Contribution to journalArticle

@article{3a410a04843d4a279957a7c51d5f18f7,
title = "Mixed 0-1 linear programming for an absolute value linear fractional programming with interval coefficients in the objective function",
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.",
keywords = "Absolute-value linear programming, Convex combination, Interval coefficients, Linear fractional programming, Mixed 0-1 linear programming",
author = "Mojtaba Borza and Rambely, {Azmin Sham} and Mansour Saraj",
year = "2013",
doi = "10.12988/ams.2013.33196",
language = "English",
volume = "7",
pages = "3641--3653",
journal = "Applied Mathematical Sciences",
issn = "1312-885X",
publisher = "Hikari Ltd.",
number = "73-76",

}

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 -