Abstracts - faqs.org

Abstracts

Business, general

Search abstracts:
Abstracts » Business, general

A fast algorithm for a class of generalized fractional programs

Article Abstract:

There are many decision problems of fractural structure where the criteria are expressed as ratios such as return on investment, liquidity and productivity. Some applications of fractional types of programming can be found in the von Neumann model of economic growth, rational Chebyshev approximation and eigenvalue problems. A new algorithm for the numerical solution of these problems is introduced that differs from the algorithms presented by Crouzeix and Ferland (1991). Unlike the Crouzeix and Ferland solutions, the new algorithm guarantees superlinear speed of convergence. It involves computing a solution and a corresponding dual solution of a convex auxiliary problem in each step, but the sequence of these solutions does not have to be convergent.

Author: Gugat, Martin
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1996
Analysis, Convergence (Mathematics)

User Contributions:

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

CAPTCHA


An algorithm for a class of nonconvex programming problems with nonlinear fractional objectives

Article Abstract:

When modeling decision systems appropriate for either public policy making or capital investment planning, the model maker encounters fractional criterion functions. In such situations the algorithm developed here would be helpful, since it identifies a desirable set of target values for given nonconvex programming problems. The primary and secondary equations for the algorithm developed are provided and explained. The basic concept behind the algorithmic maximization solution is the minimization of penalties occurring when fractional objectives deviate from target values.

Author: Jagannathan, R.
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1985
Research, Models, Case studies, Capital investments, Nonlinear programming

User Contributions:

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

CAPTCHA


Connectedness in Multiple Linear Fractional Rrogramming

Article Abstract:

Efficient and weakly efficient solutions of multiple linear fractional programming problems are studied. Attention is focused on the geometric properties of sets of these solutions. Weakly efficient solutions are path-connected.

Author: Choo, E.U., Atkins, D.R.
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1983
Linear programming, Sets, Mathematics of Computing, Scientific Research, Programming, Mathematical Programming

User Contributions:

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

CAPTCHA


Subjects list: Decision-making, Decision making, Algorithms
Similar abstracts:
  • Abstracts: Models and algorithms for transient queueing congestion at airports. Two models for assessing a federal environmental health policy: the case of radon in U.S. homes
  • Abstracts: A heuristic algorithm for the capacitated multiple supplier inventory grouping problem. Multiperiod capacity expansion in globally dispersed regions
  • Abstracts: Stochastic dominance arguments and the bounding of the generalized concave option price. Option pricing based on the generalized lambda distribution
  • Abstracts: A theory of individual creative action in multiple social domains. Causation and effectuation: toward a theoretical shift from economic inevitability to entrepreneurial contingency
  • Abstracts: A semi-Markov model for primary health care manpower supply prediction. Aggregation in Manpower Planning
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 © 2023 Advameg, Inc.