Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

A note on modeling internal technological externalities in linear profit programs

Article Abstract:

The assumption that the production activities in a linear profit maximization model are independent can be relaxed to solve nonlinear objective and structural constraints imposed by the assumption. Resulting collective and private externalities that adversely affect the efficiency of other activities in the production process can be avoided with the use of a linearizing transformation that separates these programs. The analysis presented shows, furthermore, how induced nonlinearity can be solved with geometric programming.

Author: Panik, Michael J.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992

User Contributions:

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

CAPTCHA


Selecting the best choice in the full information group interview problem

Article Abstract:

A study investigated a sequential decision problem where decision makers have full information and value of choices are assumed to be independent, identically distributed random observations from a known distribution function. A rank-based, optimal search and selection strategy was developed that maximizes the probability of selecting the best choice when several groups of choices are presented sequentially for evaluation.

Author: Chun, Young H.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1999
Operations Research, Decision-making, Decision making, Problem solving, Choice (Psychology), Dynamic programming, Search theory

User Contributions:

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

CAPTCHA


A new lower bound for the linear knapsack problem with general integer variables

Article Abstract:

A linear programming algorithm to obtain lower bound for a general instance of Knapsack problem is presented.

Author: Mathur, Kamlesh, Venkateshan, Prahalad
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2007
United States, Management dynamics, Methods, Management, Linear programming, Company business management, Boundary value problems

User Contributions:

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

CAPTCHA


Subjects list: Models, Usage, Mathematical optimization, Optimization theory, Mathematical programming
Similar abstracts:
  • Abstracts: A note on efficient solutions for the linear bilevel programming problem. Investment and harvest strategies of the Finnish forest sector under different forest-tax policies: a differential game approach with computer-based decision aid
  • Abstracts: Made-to-measure cladding. Marine technology in building. Learning about accessibility
  • Abstracts: A matter of timing: minister's tax plan upsets friends and foes. Losing altitude
  • Abstracts: An optimal algorithm for integrating raw materials inventory in a single-product manufacturing system. Quantifying the bullwhip effect in a supply chain with stochastic lead time
  • Abstracts: A fuzzy-linguistic approach to a multi-criteria sequencing problem. Application of a measure of proximity to fuzzy control algorithms
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.