Showing 1 - 10 of 12,897
This paper presents a sequential solution method to discover efficient trades in an electricity market model. The market model represents deregulated electricity market consisting of four types of participants: independent power producers, retailers, public utilities, and consumers. Our model is...
Persistent link: https://www.econbiz.de/10011825931
Portfolio optimization is a pertinent topic of significant importance in the financial literature. During the portfolio construction, an investor confronts two important steps: portfolio selection and portfolio allocation. This article seeks to investigate portfolio optimization based on the...
Persistent link: https://www.econbiz.de/10014284712
Component commonality - the use of the same version of a component across multiple products - is being increasingly considered as a promising way to offer high external variety while retaining low internal variety in operations. However, increasing commonality has both positive and negative cost...
Persistent link: https://www.econbiz.de/10003839280
Persistent link: https://www.econbiz.de/10009377491
In this paper we describe the extreme points of two closely related polytopes that are assigned to a digraph. The first polytope is the set of all sharing vectors (elements from the unit simplex) such that each node gets at least as much as each of its successors. The second one is the set of...
Persistent link: https://www.econbiz.de/10011335203
Many economic and social situations can be represented by a digraph. Both axiomatic and iterativemethods to determine the strength or power of all the nodes in a digraph have been proposed inthe literature. We propose a new method, where the power of a node is determined by both thenumber of its...
Persistent link: https://www.econbiz.de/10011318587
Persistent link: https://www.econbiz.de/10010239077
Persistent link: https://www.econbiz.de/10010426280
Persistent link: https://www.econbiz.de/10010484023
We study the maximum weighted independent-set problem on interval graphs with uncertainty on the vertex weights. We use the absolute robustness criterion and the min-max regret criterion to evaluate solutions. For a discrete scenario set, we fi nd that the problem is NP-hard for each of the...
Persistent link: https://www.econbiz.de/10013117811