Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Interdicting the activities of a linear program - a parametric analysis

Article Abstract:

The method of parametric analysis is proposed for simultaneously solving two interdiction problems of a linear program with bounded variables. The two problems, which generalize several versions of the shortest path problems, pertain to the rise of a linear program's optimal value through unit cost increases of its activities. An algorithm for solving the parametric minimum cost network flow problem is also developed for cases when such a linear program is used to model the minimum cost network flow problem.

Author: Chern, Maw-Sheng, Lin, Kao-Cheng
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995
Functions of bounded variation, Bounded variation functions

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


An interactive procedure for multiple objective integer linear programming problems

Article Abstract:

A rapid interactive procedure for the problem of multiple objective integer linear programming can be utilised without the need for special software, while placing few demands on the decision maker. Computational experience is described and a numerical example provided for the procedure. Previously, the constraints and objective functions in practical problems were often represented by linear functions, while only integer values could be used for the decision variables.

Author: Karaivanova, Jasmina N., Narula, Subhash C., Vassilev, Vassil
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1993
Models, Integer programming, Mathematics

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Dual of the sum of a linear and linear fractional program

Article Abstract:

The general problem of a dual of a mathematical programming problem with objective problems being the sum of linear and linear fractional types are subject to linear constraints is proved. It is shown that the linear programming duality theorem holds that, given that the primal maximization problem has an optimal solution, the dual problem also has a corresponding solution with objective function extreme values becoming equal.

Author: Chadha, S.S.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1993

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Research, Linear programming
Similar abstracts:
  • Abstracts: An interactive multiobjective nonlinear programming procedure. Comparative studies in interactive multiple objective mathematical programming
  • Abstracts: An investigation of the use of goal programming to fit response surfaces. Algebraic languages for mathematical programming
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.