938 resultados para Network piecewise linear programming
Resumo:
"March 1984."
Resumo:
"U.S. Dept. of Agriculture, in cooperation with Iowa Agriculture and Home Economics Experiment Station Center for agricultural and economic adjustment."
Resumo:
Cover title.
Resumo:
Literature cited and selected references: p. 38-41.
Aggregate economic effects of alternative land retirement programs : a linear programming analysis /
Resumo:
Includes bibliographical references (p. 53-54).
Resumo:
Issued May 1980.
Resumo:
Prepared in cooperation with the Center for Agricultural and Economic Development. Iowa Agriculture and Home Economics Experiment Station, Iowa State University.
Resumo:
On cover: Control data, 1604/1604-A computer.
Resumo:
Mode of access: Internet.
Resumo:
Sponsored by Office of Scientific Research of the Air Research and Development Command and held jointly by National Bureau of Standards and the Directorate of Management Analysis, DCS/Comptroller, USAF.
Resumo:
The boundary element method (BEM) was used to study galvanic corrosion using linear and logarithmic boundary conditions. The linear boundary condition was implemented by using the linear approach and the piecewise linear approach. The logarithmic boundary condition was implemented by the piecewise linear approach. The calculated potential and current density distribution were compared with the prior analytical results. For the linear boundary condition, the BEASY program using the linear approach and the piecewise linear approach gave accurate predictions of the potential and the galvanic current density distributions for varied electrolyte conditions, various film thicknesses, various electrolyte conductivities and various area ratio of anode/cathode. The 50-point piecewise linear method could be used with both linear and logarithmic polarization curves.
Resumo:
For a submitted query to multiple search engines finding relevant results is an important task. This paper formulates the problem of aggregation and ranking of multiple search engines results in the form of a minimax linear programming model. Besides the novel application, this study detects the most relevant information among a return set of ranked lists of documents retrieved by distinct search engines. Furthermore, two numerical examples aree used to illustrate the usefulness of the proposed approach.