Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

On geometric programming problems having negative degrees of difficulty

Article Abstract:

A simple procedure can be adopted to ensure dual feasibility in geometric programming problems with negative difficulty levels. A constant term is added to the primal objective to gain dual feasibility, with the dual in such programming problems usually considered infeasible. The level of infeasibility could be reduced by identifying an approximate dual solution, although there are shortcomings to this procedure. The restricting behaviour of the primal variables is determined by the dual feasible solution.

Author: Rajgopal, Jayant, Bricker, Dennis L., Jae Chul Choi
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1993
Models, Usage, Mathematical optimization

User Contributions:

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

CAPTCHA


On subsidiary problems in geometric programming

Article Abstract:

A generalized linear program to solve the primal optimum without the need to determine the subsidiary problems is described. The algorithm is an alternative to the dual-based procedure in solving geometric programming problems. Analysis shows that the linearized form provides information in all posynomials including those with slack constraints. In addition, optimal primal-dual relationships yield information on the multiple optima characterizing the primal under those conditions.

Author: Rajgopal, Jayant, Bricker, Dennis L.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
Nonlinear programming

User Contributions:

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

CAPTCHA


Investigation of path-following algorithms for signomial geometric programming problems

Article Abstract:

The path-following algorithm that can be used to solve signomial geometric programming (GP) dual problems is found to yield better quality and globally optimal results, given a relaxed stopping criterion for early posynomial GP problems in the sequence. The method can be employed to either the original nonconvex problem or to each of a sequence of convex posynomial GP problems nearly equalling the original problem.

Author: Bricker, Dennis L., Yang, Hsu-Hao
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
Management-Problem Solving, Analysis, Evaluation, Human resource management, Algorithms, Problem solving

User Contributions:

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

CAPTCHA


Subjects list: Research, Geometrical models, Optimization theory, Mathematical programming
Similar abstracts:
  • Abstracts: Back on track. Echoing problems across the market. Slack fourth quarter of intra-European activity
  • Abstracts: Under new management: Ramos order brings shareholdings under state control. Look closely: Manila's fiscal surplus isn't what it seems
  • Abstracts: Open for offers. Boom in progress; liberalization has led to an unprecedented explosion of private investment
  • Abstracts: Feeling the heat. Bottomless pockets: Peking heads for another big fiscal deficit. Overripe fruits
  • Abstracts: A fine line. The grass is greener: non-Asian bourses offer some bargains. Joining the party
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.