923 resultados para Mixed integer programming model
Resumo:
Thesis (M.S.)--Illinois.
Resumo:
Originally presented as the author's thesis (M.S.), University of Illinois at Urbana-Champaign.
Resumo:
"January 18, 1971."
Resumo:
"Supported in part by the National Science Foundation under grant no. NSF GJ-503."
Resumo:
Bibliography: p. 41-42.
Resumo:
"Supported in part by ... Grant no. NSF GJ-503."
Resumo:
Bibliographical footnotes.
Resumo:
Bibliography: p. 29.
Resumo:
"Supported in part by ... Grant no. NSF GJ-503."
Resumo:
"March 1984."
Resumo:
Thesis (Ph.D.)--University of Washington, 2016-06
Resumo:
This paper focuses on measuring the extent to which market power has been exercised in a recently deregulated electricity generation sector. Our study emphasises the need to consider the concept of market power in a long-run dynamic context. A market power index is constructed focusing on differences between actual market returns and long-run competitive returns, estimated using a programming model devised by the authors. The market power implications of hedge contracts are briefly considered. The state of Queensland Australia is used as a context for the analysis. The results suggest that generators have exercised significant market power since deregulation.
Resumo:
Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum number of reversals required for rearranging a genome to another when gene duplication is nonexisting. In this paper, we show how to extend the Hannenhalli-Pevzner approach to genomes with multigene families. We propose a new heuristic algorithm to compute the reversal distance between two genomes with multigene families via the concept of binary integer programming without removing gene duplicates. The experimental results on simulated and real biological data demonstrate that the proposed algorithm is able to find the reversal distance accurately. ©2005 IEEE
Resumo:
Purpose – A binary integer programming model for the simple assembly line balancing problem (SALBP), which is well known as SALBP-1, was formulated more than 30 years ago. Since then, a number of researchers have extended the model for the variants of assembly line balancing problem.The model is still prevalent nowadays mainly because of the lower and upper bounds on task assignment. These properties avoid significant increase of decision variables. The purpose of this paper is to use an example to show that the model may lead to a confusing solution. Design/methodology/approach – The paper provides a remedial constraint set for the model to rectify the disordered sequence problem. Findings – The paper presents proof that the assembly line balancing model formulated by Patterson and Albracht may lead to a confusing solution. Originality/value – No one previously has found that the commonly used model is incorrect.