Relevant bibliographies by topics / Dual-simplex

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Dual-simplex'

Author: Grafiati
Published: 5 June 2025
Last updated: 1 August 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Dual-simplex.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Dual-simplex"

1

Safitri, Elfira, Sri Basriati, and Elvina Andiani. "PENERAPAN PROGRAM LINIER MENGGUNAKAN METODE DUAL SIMPLEKS DAN METODE QUICK SIMPLEKS UNTUK MEMINIMUMKAN BIAYA (STUDI KASUS: KELOMPOK WANITA TANI (KWT) SENTOSA SANTUL)." Journal of Fundamental Mathematics and Applications (JFMA) 4, no. 1 (2021): 117–32. http://dx.doi.org/10.14710/jfma.v4i1.8879.

Full text
Abstract:
The Sentosa Santul Women Farmers Group (KWT) is a group of women farmers in Dusun Santul, Kampar Utara District an is engaged in the field of food crops is chili. The Sentosa Santul Women Farmers group (KWT) uses 4 types of fertilizers for chili plant fertilization, namely hydro complex fertilizer, phonska, NPK Zamrud and goat manure.The KWT wants the minimum fertilizer cost but the nutrients in the plants are met. The method used in this research is the dual simplex method and the quick simplex method. The purpose of this study is to determine the minimum costs that must be incurred by the Wo
APA, Harvard, Vancouver, ISO, and other styles
2

Geranis, George, Konstantinos Paparizzos, and Angelo Sifaleras. "A dual exterior point simplex type algorithm for the minimum cost network flow problem." Yugoslav Journal of Operations Research 19, no. 1 (2009): 157–70. http://dx.doi.org/10.2298/yjor0901157g.

Full text
Abstract:
A new dual simplex type algorithm for the Minimum Cost Network Flow Problem (MCNFP) is presented. The proposed algorithm belongs to a special 'exterior- point simplex type' category. Similarly to the classical network dual simplex algorithm (NDSA), this algorithm starts with a dual feasible tree-solution and reduces the primal infeasibility, iteration by iteration. However, contrary to the NDSA, the new algorithm does not always maintain a dual feasible solution. Instead, the new algorithm might reach a basic point (tree-solution) outside the dual feasible area (exterior point - dual infeasibl
APA, Harvard, Vancouver, ISO, and other styles
3

Abdolali, Maryam, Giovanni Barbarino, and Nicolas Gillis. "Dual Simplex Volume Maximization for Simplex-Structured Matrix Factorization." SIAM Journal on Imaging Sciences 17, no. 4 (2024): 2362–91. https://doi.org/10.1137/24m1650600.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Samaras, Nikolaos, Angelo Sifelaras, and Charalampos Triantafyllidis. "A primal-dual exterior point algorithm for linear programming problems." Yugoslav Journal of Operations Research 19, no. 1 (2009): 123–32. http://dx.doi.org/10.2298/yjor0901123s.

Full text
Abstract:
The aim of this paper is to present a new simplex type algorithm for the Linear Programming Problem. The Primal - Dual method is a Simplex - type pivoting algorithm that generates two paths in order to converge to the optimal solution. The first path is primal feasible while the second one is dual feasible for the original problem. Specifically, we use a three-phase-implementation. The first two phases construct the required primal and dual feasible solutions, using the Primal Simplex algorithm. Finally, in the third phase the Primal - Dual algorithm is applied. Moreover, a computational study
APA, Harvard, Vancouver, ISO, and other styles
5

Bixby, Robert E., and Alexander Martin. "Parallelizing the Dual Simplex Method." INFORMS Journal on Computing 12, no. 1 (2000): 45–56. http://dx.doi.org/10.1287/ijoc.12.1.45.11902.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Orlin, James B., Serge A. Plotkin, and Éva Tardos. "Polynomial dual network simplex algorithms." Mathematical Programming 60, no. 1-3 (1993): 255–76. http://dx.doi.org/10.1007/bf01580615.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sousa, Ricardo Silveira, Carla Taviane Lucke da Silva, and Marcos Nereu Arenales. "Métodos do tipo dual simplex para problemas de otimização linear canalizados." Pesquisa Operacional 25, no. 3 (2005): 349–82. http://dx.doi.org/10.1590/s0101-74382005000300004.

Full text
Abstract:
Neste artigo estudamos o problema de otimização linear canalizado (restrições e variáveis canalizadas, chamado formato geral) e desenvolvemos métodos do tipo dual simplex explorando o problema dual, o qual é linear por partes, num certo sentido não-linear. Várias alternativas de busca unidimensional foram examinadas. Experimentos computacionais revelam que a busca unidimensional exata na direção dual simplex apresenta melhor desempenho.
APA, Harvard, Vancouver, ISO, and other styles
8

Nasseri, Seyed Hadi, and Ali Ebrahimnejad. "Sensitivity Analysis on Linear Programming Problems with Trapezoidal Fuzzy Variables." International Journal of Operations Research and Information Systems 2, no. 2 (2011): 22–39. http://dx.doi.org/10.4018/joris.2011040102.

Full text
Abstract:
In the real word, there are many problems which have linear programming models and sometimes it is necessary to formulate these models with parameters of uncertainty. Many numbers from these problems are linear programming problems with fuzzy variables. Some authors considered these problems and have developed various methods for solving these problems. Recently, Mahdavi-Amiri and Nasseri (2007) considered linear programming problems with trapezoidal fuzzy data and/or variables and stated a fuzzy simplex algorithm to solve these problems. Moreover, they developed the duality results in fuzzy e
APA, Harvard, Vancouver, ISO, and other styles
9

Klabjan, Diego, Ellis L. Johnson, and George L. Nemhauser. "A parallel primal–dual simplex algorithm." Operations Research Letters 27, no. 2 (2000): 47–55. http://dx.doi.org/10.1016/s0167-6377(00)00017-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Matsumoto, J., and L. W. Mays. "Dual simplex method for GUB problems." Journal of Optimization Theory and Applications 45, no. 1 (1985): 113–22. http://dx.doi.org/10.1007/bf00940817.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Dual-simplex"

1

Sousa, Ricardo Silveira. "Métodos tipo dual simplex para problemas de otimização linear canalizados." Universidade de São Paulo, 2005. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-21082015-135958/.

Full text
Abstract:
A otimização linear tem sido objeto de intenso estudo desde a publicação do método simplex de Dantzig em 1947, sendo revigorada a partir de 1984 com a publicação de um método de pontos interiores por Karmarkar, o qual demonstrou ser computacionalmente eficiente e com propriedade de convergência polinomial no estudo do pior caso. Embora muitas variantes do método simplex não tenham complexidade polinomial, elas apresentam um comportamento polinomial em termos do número de restrições do problema, para inúmeros problemas práticos, constituindo o chamado \"folclore\"\' simplex. Nos últimos anos, t
APA, Harvard, Vancouver, ISO, and other styles
2

Koberstein, Achim. "The dual simplex method, techniques for a fast and stable implementation." kostenfrei, 2005. http://deposit.ddb.de/cgi-bin/dokserv?idn=978580478.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hu, Jing. "Solving linear programs using primal-dual subproblem simplex method and quasi-explicit matrices." Diss., Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/24863.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Vanderlinde, Jeferson Back [UNESP]. "Planejamento da expansão de sistemas de transmissão usando algoritmos tipo dual simplex especializados em uma estrutura branch and bound." Universidade Estadual Paulista (UNESP), 2013. http://hdl.handle.net/11449/87153.

Full text
Abstract:
Made available in DSpace on 2014-06-11T19:22:33Z (GMT). No. of bitstreams: 0 Previous issue date: 2013-08-30Bitstream added on 2014-06-13T19:47:48Z : No. of bitstreams: 1 vanderlinde_jb_me_ilha.pdf: 817450 bytes, checksum: f55727575f9ad09191bc30a0419b1f24 (MD5)<br>A presente pesquisa considera a análise teórica e a implementação computacional do algoritmo Dual Simplex Canalizado especializado na reotimização eficiente dos subproblemas gerados pelo algoritmo Branch and Bound para resolver problemas de Programação Linear Inteiro Misto. Juntamente com estes algoritmos é implementado o algoritmo
APA, Harvard, Vancouver, ISO, and other styles
5

Vanderlinde, Jeferson Back. "Planejamento da expansão de sistemas de transmissão usando algoritmos tipo dual simplex especializados em uma estrutura branch and bound /." Ilha Solteira, 2013. http://hdl.handle.net/11449/87153.

Full text
Abstract:
Orientador: Rubén Augusto Romero Lázaro<br>Banca: Marina Lavorato de Oliveira<br>Banca: Antonio César Balleiro Alves<br>Resumo: A presente pesquisa considera a análise teórica e a implementação computacional do algoritmo Dual Simplex Canalizado especializado na reotimização eficiente dos subproblemas gerados pelo algoritmo Branch and Bound para resolver problemas de Programação Linear Inteiro Misto. Juntamente com estes algoritmos é implementado o algoritmo Primal Simplex Canalizado para resolver o problema de Programação Linear inicial resultante do problema Programação Linear Inteiro Misto a
APA, Harvard, Vancouver, ISO, and other styles
6

Hashimoto, Selma Helena Marchiori [UNESP]. "Análise e desenvolvimento de algoritmos eficientes de programação linear para o problema de planejamento de sistemas de transmissão a longo prazo." Universidade Estadual Paulista (UNESP), 2005. http://hdl.handle.net/11449/100375.

Full text
Abstract:
Made available in DSpace on 2014-06-11T19:30:52Z (GMT). No. of bitstreams: 0 Previous issue date: 2005-04-29Bitstream added on 2014-06-13T19:00:51Z : No. of bitstreams: 1 hashimoto_shm_dr_ilha.pdf: 3505990 bytes, checksum: 86eb5da27160760afefec6614a16a090 (MD5)<br>Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)<br>O problema de planejamento de sistemas de transmissão é um problema de programação não-linear inteira mista (PNLIM) quando é usado o modelo DC. Praticamente todos os algoritmos usados para resolver este problema utilizam uma subrotina de programação linear (PL) para r
APA, Harvard, Vancouver, ISO, and other styles
7

Vanderlinde, Jeferson Back [UNESP]. "Planejamento da expansão de sistemas de transmissão usando técnicas especializadas de programação inteira mista." Universidade Estadual Paulista (UNESP), 2017. http://hdl.handle.net/11449/152089.

Full text
Abstract:
Submitted by JEFERSON BACK VANDERLINDE null (jefersonbv@yahoo.com.br) on 2017-11-01T16:38:25Z No. of bitstreams: 1 jeferson_tese_final_20171101.pdf: 4860852 bytes, checksum: 2f99c37969be3815f82b1b4455a40230 (MD5)<br>Approved for entry into archive by LUIZA DE MENEZES ROMANETTO (luizamenezes@reitoria.unesp.br) on 2017-11-13T15:38:34Z (GMT) No. of bitstreams: 1 vanderlinde_jb_dr_ilha.pdf: 4860852 bytes, checksum: 2f99c37969be3815f82b1b4455a40230 (MD5)<br>Made available in DSpace on 2017-11-13T15:38:34Z (GMT). No. of bitstreams: 1 vanderlinde_jb_dr_ilha.pdf: 4860852 bytes, checksum: 2f99c37969be3
APA, Harvard, Vancouver, ISO, and other styles
8

Vanderlinde, Jeferson Back. "Planejamento da expansão de sistemas de transmissão usando técnicas especializadas de programação inteira mista /." Ilha Solteira, 2017. http://hdl.handle.net/11449/152089.

Full text
Abstract:
Orientador: Rubén Augusto Romero Lázaro<br>Resumo: Neste trabalho, consideram-se a análise teórica e a implementação computacional dos algoritmos Primal Simplex Canalizado (PSC) e Dual Simplex Canalizado (DSC) especializados. Esses algoritmos foram incorporados em um algoritmo Branch and Bound (B&B) de modo a resolver o problema de Planejamento da Expansão de Sistemas de Transmissão (PEST). Neste caso, o problema PEST foi modelado usando os chamados modelo de Transportes e modelo Linear Disjuntivo (LD), o que produz um problema de Programação Linear Inteiro Misto (PLIM). O algoritmo PSC é util
APA, Harvard, Vancouver, ISO, and other styles
9

Righetto, Edison [UNESP]. "Desenvolvimento de técnicas eficientes de programação linear na utilização de metaheurísticas para o problema de planejamento da expansão de sistemas de transmissão." Universidade Estadual Paulista (UNESP), 2010. http://hdl.handle.net/11449/100321.

Full text
Abstract:
Made available in DSpace on 2014-06-11T19:30:50Z (GMT). No. of bitstreams: 0 Previous issue date: 2010-02-23Bitstream added on 2014-06-13T20:40:36Z : No. of bitstreams: 1 righetto_e_dr_ilha.pdf: 923323 bytes, checksum: f390d9baa00b45f3196dda419f801f19 (MD5)<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)<br>Neste trabalho apresenta-se uma estratégia de programação linear especializada para resolver, de forma eficiente, o problema de planejamento da expansão de sistemas de transmissão de energia elétrica usando o algoritmo de busca em vizinhança variável (VNS). O modelo
APA, Harvard, Vancouver, ISO, and other styles
10

Hashimoto, Selma Helena Marchiori. "Análise e desenvolvimento de algoritmos eficientes de programação linear para o problema de planejamento de sistemas de transmissão a longo prazo /." Ilha Solteira : [s.n.], 2005. http://hdl.handle.net/11449/100375.

Full text
Abstract:
Orientador: Rubén Augusto Romero Lázaro<br>Banca: Jose Roberto Sanches Mantovani<br>Banca: Sergio Azevedo de Oliveira<br>Banca: Antônio César Baleeiro Alves<br>Banca: Eduardo Nobuhiro Asada<br>Resumo: O problema de planejamento de sistemas de transmissão é um problema de programação não-linear inteira mista (PNLIM) quando é usado o modelo DC. Praticamente todos os algoritmos usados para resolver este problema utilizam uma subrotina de programação linear (PL) para resolver problemas de PL resultantes do algoritmo de solução do problema de planejamento. Às vezes a resolução desses problemas de P
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Dual-simplex"

1

Orlin, James B. Polynomial dual network simplex algorithms. Dept. of Computer Science, Stanford University, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Orlin, James B. Polynomial dual network simplex algorithms. Alfred P. Sloan School of Management, Massachusetts Institute of Technology, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Plotkin, Serge A., James B. Orlin, and Sloan School of Management. Polynomial Dual Network Simplex Algorithms. Creative Media Partners, LLC, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Long, Nate. OS82150 Dual-Simplex Reference Design Application Note. Microchip Technology Incorporated, 2016.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Long, Nate. AN1366 OS82150 Dual Simplex Reference Design Application Note. Microchip Technology Incorporated, 2016.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Long, Nate. AN1366 OS82150 Dual-Simplex Reference Design Application Note. Microchip Technology Incorporated, 2016.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Long, Nate. AN1366 OS82150 Dual Simplex Reference Design Application Note. Microchip Technology Incorporated, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Long, Nate. AN1366 OS82150 Dual-Simplex Reference Design Application Note. Microchip Technology Incorporated, 2017.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sepil, Canan A. Dual simplex algorithms on network flow problems and extensions. 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Long, Nate. OS81118 CPHY Dual-Simplex Reference Design for EMC Application Note. Microchip Technology Incorporated, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Dual-simplex"

1

Vasilyev, F. P., and A. Yu Ivanitskiy. "Dual Simplex Method." In In-Depth Analysis of Linear Programming. Springer Netherlands, 2001. http://dx.doi.org/10.1007/978-94-015-9759-3_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bhunia, Asoke Kumar, Laxminarayan Sahoo, and Ali Akbar Shaikh. "Dual Simplex Method." In Springer Optimization and Its Applications. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-32-9967-2_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Paris, Quirino. "The Dual Simplex Algorithm." In An Economic Interpretation of Linear Programming. Palgrave Macmillan US, 2016. http://dx.doi.org/10.1057/9781137573926_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

PAN, Ping-Qi. "Primal-Dual Simplex Method." In Linear Programming Computation. Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-0147-8_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ploskas, Nikolaos, and Nikolaos Samaras. "Revised Dual Simplex Algorithm." In Linear Programming Using MATLAB®. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-65919-0_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

PAN, Ping-Qi. "Dual Simplex Phase-l Method." In Linear Programming Computation. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40754-3_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

PAN, Ping-Qi. "Dual Simplex Phase-l Method." In Linear Programming Computation. Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-0147-8_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

PAN, Ping-Qi. "Duality Principle and Dual Simplex Method." In Linear Programming Computation. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40754-3_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

PAN, Ping-Qi. "Duality Principle and Dual Simplex Method." In Linear Programming Computation. Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-0147-8_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Cottle, Richard W., and Mukund N. Thapa. "DUALITY AND THE DUAL SIMPLEX ALGORITHM." In Linear and Nonlinear Optimization. Springer New York, 2017. http://dx.doi.org/10.1007/978-1-4939-7055-1_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Dual-simplex"

1

Gupta, Abhay, Ashu Varshney, O. V. Gnana Swathika, and S. Hemamalini. "Dual Simplex Algorithm Aided Adaptive Protection of Microgrid." In 2015 International Conference on Computational Intelligence and Communication Networks (CICN). IEEE, 2015. http://dx.doi.org/10.1109/cicn.2015.338.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Azuma, Beatriz, and Aurelio de Oliveira. "Implementação eficiente do método dual simplex em otimização estrutural." In Congresso de Iniciação Científica UNICAMP. Universidade Estadual de Campinas, 2019. http://dx.doi.org/10.20396/revpibic2720191915.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Borzabadi, Akbar Hashemi, and Hossein Alemy. "Dual simplex method for solving fully fuzzy linear programming problems." In 2015 4th Iranian Joint Congress on Fuzzy and Intelligent Systems (CFIS). IEEE, 2015. http://dx.doi.org/10.1109/cfis.2015.7391653.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Madhumitha, R., Parul Sharma, Deepika Mewara, O. V. Gnana Swathika, and S. Hemamalini. "Optimum Coordination of Overcurrent Relays Using Dual Simplex and Genetic Algorithms." In 2015 International Conference on Computational Intelligence and Communication Networks (CICN). IEEE, 2015. http://dx.doi.org/10.1109/cicn.2015.342.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

DOSIOS, K., K. PAPARRIZOS, N. SAMARAS, and A. SIFALERAS. "AN EFFICIENT MODIFICATION OF THE PRIMAL - DUAL TWO PATHS SIMPLEX ALGORITHM." In Proceedings of the International Conference (ICCMSE 2003). WORLD SCIENTIFIC, 2003. http://dx.doi.org/10.1142/9789812704658_0032.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Jun-Hyeok Son and Bo-Hyeok Scriber. "Problem solution of linear programming using dual simplex method neural network." In Proceedings of the Eighth International Conference on Electrical Machines and Systems. IEEE, 2005. http://dx.doi.org/10.1109/icems.2005.202921.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Toy, James W., Paul W. Casper, James W. Breitmeier, and Donald R. Alford. "Design of a 10-km dual-simplex fiber optic HIPPI extender." In OE Fiber - DL tentative, edited by Kadiresan Annamalai. SPIE, 1992. http://dx.doi.org/10.1117/12.134926.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bedekar, Prashant P., Sudhir R. Bhide, and Vijay S. Kale. "Optimum Coordination of Overcurrent Relays in Distribution System Using Dual Simplex Method." In 2009 Second International Conference on Emerging Trends in Engineering & Technology. IEEE, 2009. http://dx.doi.org/10.1109/icetet.2009.164.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kant, Krishna, Mayank Kumar, Rajesh Reddy, Raja Banerjee, Narasimha Mangadoddy, and Surya Vanka. "Numerical Study of Primary Jet Breakup in a Simplex Swirl Atomizer Using Dual Grid Coupled Level Set VOF Method." In ASME 2019 Gas Turbine India Conference. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/gtindia2019-2411.

Full text
Abstract:
Abstract Primary breakup of a liquid jet emanating from a simplex swirl atomizer is numerically studied in this work. The liquid-gas interface is tracked using a coupled Level-Set VOF method. In order to improve the curvature calculation, a dual grid approach is used. Level set function is solved on a grid that is finer than the grid used to solve the rest of the variables. This solver is developed using OpenFOAM libraries and is validated by estimating the pressure profile and spurious velocities across the interface of a static bubble. The validation test shows significant improvement in the
APA, Harvard, Vancouver, ISO, and other styles
10

Jasuja, A. K. "Dual-Orifice Atomizer Performance Under Varying Air Density Conditions." In ASME 1985 International Gas Turbine Conference and Exhibit. American Society of Mechanical Engineers, 1985. http://dx.doi.org/10.1115/85-gt-44.

Full text
Abstract:
The spray quality and spatial distribution characteristics of a pressure atomizer of the dual-orifice type have been experimentally investigated using the well-established, non-intrusive techniques of laser droplet sizing and photography. Tests were conducted on kerosine and gas oil at air pressures up to about 8 atmospheres. The characteristics of spray quality and spatial distribution have been shown to undergo a noticeable change over a wide range of main fuel flows. An increase in the air density results in an improvement in the spray quality, but, is accompanied with a reduction in spray
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Dual-simplex"

1

Orlin, James B., Serge A. Plotkin, and Eva Tardos. Polynomial Dual Network Simplex Algorithms. Defense Technical Information Center, 1991. http://dx.doi.org/10.21236/ada254340.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chen, Hsin-Der, P. M. Pardalos, and M. A. Saunders. The simplex algorithm with a new primal and dual pivot rule. Office of Scientific and Technical Information (OSTI), 1993. http://dx.doi.org/10.2172/10179889.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Dual-simplex' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography