Spelling suggestions: "subject:"ionic programming"" "subject:"sonic programming""
1 |
A Mixed Integer Second Order Cone Programming Reformulation For A Congested Location And Capacity Allocation Problem On A Supply Chain NetworkMohammad, Salimian 01 January 2013 (has links) (PDF)
Supply chain network design involves location decisions for production facilities and distribution centers.
We consider a make-to-order supply chain environment where distribution centers serve as crossdocking
terminals. Long waiting times may occur at a cross-docking terminal, unless sucient handling
capacity is installed. In this study, we deal with a facility location problem with congestion
eects at distribution centers. Along with location decisions, we make capacity allocation (service
rate) and demand allocation decisions so that the total cost, including facility opening, transportation
and congestion costs, is minimized.
Response time to customer orders is a critical performance measure for a supply chain network. The
decisions like where the plants and distribution centers are located aect the response time of the
system. Response time is more sensitive to these decisions in a make-to-order business environment.
In a distribution network where distribution centers function as cross-docking terminals, capacity or
the service rate decisions also aect the response time performance.
This study is closely related to a recent work Vidyarthi et al. (2009) which models distribution centers
asM/G/1 queuing systems. They use the average waiting time formula ofM/G/1 queuing model. Thus,
the average waiting time at a distribution center is a nonlinear function of the demand rate allocated to
and the service rate available at the distribution center. The authors Vidyarthi et al. (2009) propose a
linear approximation approach and a Lagrangian based heuristic for the problem.
Dierent than the solution approach proposed in Vidyarthi et al. (2009), we propose a closed form
formulation for the problem. In particular, we show that the waiting time function derived from M/G/1
queuing model can be represented via second order conic inequalities. Then, the problem becomes
a mixed integer second order cone programming problem which can be solved by using commercial
branch-and-bound software such as IBM ILOG CPLEX. Our computational tests show that proposed reformulation can be solved in reasonable CPU times for practical size instances.
|
2 |
Optimization under uncertainty: conic programming representations, relaxations, and approximationsXu, Guanglin 01 August 2017 (has links)
In practice, the presence of uncertain parameters in optimization problems introduces new challenges in modeling and solvability to operations research. There are three main paradigms proposed for optimization problems under uncertainty. These include stochastic programming, robust optimization, and sensitivity analysis. In this thesis, we examine, improve, and combine the latter two paradigms in several relevant models and applications. In the second chapter, we study a two-stage adjustable robust linear optimization problem in which the right-hand sides are uncertain and belong to a compact, convex, and tractable uncertainty set. Under standard and simple assumptions, we reformulate the two-stage problem as a copositive optimization program, which in turns leads to a class of tractable semidefinite-based approximations that are at least as strong as the affine policy, which is a well studied tractable approximation in the literature. We examine our approach over several examples from the literature and the results demonstrate that our tractable approximations significantly improve the affine policy. In particular, our approach recovers the optimal values of a class of instances of increasing size for which the affine policy admits an arbitrary large gap. In the third chapter, we leverage the concept of robust optimization to conduct sensitivity analysis of the optimal value of linear programming (LP). In particular, we propose a framework for sensitivity analysis of LP problems, allowing for simultaneous perturbations in the objective coefficients and right-hand sides, where the perturbations are modeled in a compact, convex, and tractable uncertainty set. This framework unifies and extends multiple approaches for LP sensitivity analysis in the literature and has close ties to worst-case LP and two-stage adjustable linear programming. We define the best-case and worst-case LP optimal values over the uncertainty set. As the concept aligns well with the general spirit of robust optimization, we denote our approach as robust sensitivity analysis. While the best-case and worst-case optimal values are difficult to compute in general, we prove that they equal the optimal values of two separate, but related, copositive programs. We then develop tight, tractable conic relaxations to provide bounds on the best-case and worst case optimal values, respectively. We also develop techniques to assess the quality of the bounds, and we validate our approach computationally on several examples from—and inspired by—the literature. We find that the bounds are very strong in practice and, in particular, are at least as strong as known results for specific cases from the literature. In the fourth chapter of this thesis, we study the expected optimal value of a mixed 0-1 programming problem with uncertain objective coefficients following a joint distribution. We assume that the true distribution is not known exactly, but a set of independent samples can be observed. Using the Wasserstein metric, we construct an ambiguity set centered at the empirical distribution from the observed samples and containing all distributions that could have generated the observed samples with a high confidence. The problem of interest is to investigate the bound on the expected optimal value over the Wasserstein ambiguity set. Under standard assumptions, we reformulate the problem into a copositive programming problem, which naturally leads to a tractable semidefinite-based approximation. We compare our approach with a moment-based approach from the literature for two applications. The numerical results illustrate the effectiveness of our approach.
Finally, we conclude the thesis with remarks on some interesting open questions in the field of optimization under uncertainty. In particular, we point out that some interesting topics that can be potentially studied by copositive programming techniques.
|
3 |
Phasor Measurement Unit Data-based States and Parameters Estimation in Power SystemGhassempour Aghamolki, Hossein 08 November 2016 (has links)
The dissertation research investigates estimating of power system static and dynamic states (e.g. rotor angle, rotor speed, mechanical power, voltage magnitude, voltage phase angle, mechanical reference point) as well as identification of synchronous generator parameters. The research has two focuses:
i. Synchronous generator dynamic model states and parameters estimation using real-time PMU data.
ii.Integrate PMU data and conventional measurements to carry out static state estimation.
The first part of the work focuses on Phasor Measurement Unit (PMU) data-based synchronous generator states and parameters estimation. In completed work, PMU data-based synchronous generator model identification is carried out using Unscented Kalman Filter (UKF). The identification not only gives the states and parameters related to a synchronous generator swing dynamics but also gives the states and parameters related to turbine-governor and primary and secondary frequency control. PMU measurements of active power and voltage magnitude, are treated as the inputs to the system while voltage phasor angle, reactive power, and frequency measurements are treated as the outputs. UKF-based estimation can be carried out at real-time. Validation is achieved through event play back to compare the outputs of the simplified simulation model and the PMU measurements, given the same input data. Case studies are conducted not only for measurements collected from a simulation model, but also for a set of real-world PMU data. The research results have been disseminated in one published article.
In the second part of the research, new state estimation algorithm is designed for static state estimation. The algorithm contains a new solving strategy together with simultaneous bad data detection. The primary challenge in state estimation solvers relates to the inherent non-linearity and non-convexity of measurement functions which requires using of Interior Point algorithm with no guarantee for a global optimum solution and higher computational time. Such inherent non-linearity and non-convexity of measurement functions come from the nature of power flow equations in power systems.
The second major challenge in static state estimation relates to the bad data detection algorithm. In traditional algorithms, Largest Normalized Residue Test (LNRT) has been used to identify bad data in static state estimation. Traditional bad data detection algorithm only can be applied to state estimation. Therefore, in a case of finding any bad datum, the SE algorithm have to rerun again with eliminating found bad data. Therefore, new simultaneous and robust algorithm is designed for static state estimation and bad data identification.
In the second part of the research, Second Order Cone Programming (SOCP) is used to improve solving technique for power system state estimator. However, the non-convex feasible constraints in SOCP based estimator forces the use of local solver such as IPM (interior point method) with no guarantee for quality answers. Therefore, cycle based SOCP relaxation is applied to the state estimator and a least square estimation (LSE) based method is implemented to generate positive semi-definite programming (SDP) cuts. With this approach, we are able to strengthen the state estimator (SE) with SOCP relaxation. Since SDP relaxation leads the power flow problem to the solution of higher quality, adding SDP cuts to the SOCP relaxation makes Problem’s feasible region close to the SDP feasible region while saving us from computational difficulty associated with SDP solvers. The improved solver is effective to reduce the feasible region and get rid of unwanted solutions violate cycle constraints. Different Case studies are carried out to demonstrate the effectiveness and robustness of the method.
After introducing the new solving technique, a novel co-optimization algorithm for simultaneous nonlinear state estimation and bad data detection is introduced in this dissertation. ${\ell}_1$-Norm optimization of the sparse residuals is used as a constraint for the state estimation problem to make the co-optimization algorithm possible. Numerical case studies demonstrate more accurate results in SOCP relaxed state estimation, successful implementation of the algorithm for the simultaneous state estimation and bad data detection, and better state estimation recovery against single and multiple Gaussian bad data compare to the traditional LNRT algorithm.
|
4 |
[en] RELIABILITY ANALYSIS OF SATURATED-UNSATURATED SOIL SLOPES USING LIMIT ANALYSIS IN THE CONIC QUADRATIC SPACE / [pt] ANÁLISE DE CONFIABILIDADE DE TALUDES EM CONDIÇÕES SATURADAS-NÃO SATURADAS VIA ANÁLISE LIMITE NO ESPAÇO CÔNICO QUADRÁTICOMARLENE SUSY TAPIA MORALES 14 July 2014 (has links)
[pt] Este trabalho tem por objetivo a avaliação da estabilidade de taludes de solo quando sometidos a processos de infiltração de chuva, utilizando conceitos de Análise Limite e Análise de Confiabilidade. Primeiramente, determina-se a variação da sução no solo, para isto, emprega-se o Método dos Elementos Finitos e o Método de diferenças finitas na solução da equação de Richards. O modelo de Van Genuchten (1980) é utilizado para a curva característica. Na solução da nãolinearidade, emprega-se o método Picard Modificado. A instabilidade de taludes é estudada mediante o método de Análise Limite Numérica com base no Método de Elementos Finitos e o critério de Mohr Coulomb como critério de escoamento. A solução do problema matemático será realizada no espaço cônico quadrático com o objetivo de tornar a solução mais computacionalmente eficiente. Considerando as propriedades do solo como variáveis aleatórias foi incluída a determinação do Índice de Confiabilidade utilizando as formulações dos métodos de Monte Carlo e FORM (first order reliability method). Inicialmente são introduzidos conceitos básicos associados ao fluxo saturado-não saturado. A seguir são apresentados alguns conceitos. Sobre Análise Limite e sua formulação pelo Método de Elementos Finitos. Finalmente são introduzidos os fundamentos da Análise de
Confiabilidade. Análises de confiabilidade das encostas de Coos Bay no estado de Oregon nos Estados Unidos e da Vista Chinesa no Rio de Janeiro Brasil, são apresentadas devido a que estes taludes sofreram colapso quando submetidos a processos de infiltração de água de chuva. Os resultados deste trabalho mostram que a falha das encostas ocorre quando o índice de confiabilidade atinge um valor perto de dois. / [en] This thesis aims to perform a reliability analysis of the stability of 2D soil slopes when they are submitted to water infiltration due to the rains.The time variation of the soil matric suctions is calculated first. The Finite Element Method is used to transform the Richards differential equation into a system of nonlinear first order equations. The nonlinearity of the problem is due to the use of the characteristic curve proposed by van Genuchten (1980). The Modified Picard Method is applied to solve de time-dependent nonlinear equation system. The responses of the flux-problem are transferred to the stability problem in some instants using the same time-interval (normally days).To estimate the stability of the slopes, limit analysis is used. The limit analyses are performed based on the Inferior Limit Theorem of the Plasticity Theory. The problem is defined as an optimization problem where the load factor is maximized. The equilibrium equations are obtained via Finite Element discretization and the strength criterion of Mohr-Couomb is written in the conic quadratic space. Therefore, a SOCP (Second Order Conic Programming) problem is generated. The problem is solved using an interior point algorithm of the code Mosek.Since the soil properties are random variables a reliability analysis can be performed at each instant of the time-dependent problem. In order to perform the reliability analyses, Response Surfaces for the failure function of the slope are generated. In this work, the Stochastic Collocation Method is used to generate Response Surfaces. The Simulation Monte Carlo Method and the FORM (First Order Reliability Method) are used to obtain both the reliability index and the probability of failure of the slopes.Reliability analyses of the Coos Bay Slope in the state of Oregon in USA and in the Vista Chinesa Slope in Rio de Janeiro, Brazil, are presented because they collapse due to rainfall infiltration. The results show that the soil slope fails when the related reliability index is close to two.
|
5 |
Méthodes numériques pour le calcul à la rupture des structures de génie civil / Numerical methods for the yield design of civil engineering structuresBleyer, Jérémy 17 July 2015 (has links)
Ce travail tente de développer des outils numériques efficaces pour une approche plus rationnelle et moins empirique du dimensionnement à la ruine des ouvrages de génie civil. Contrairement aux approches traditionnelles reposant sur une combinaison de calculs élastiques, l'adoption de coefficients de sécurité et une vérification locale des sections critiques, la théorie du calcul à la rupture nous semble être un outil prometteur pour une évaluation plus rigoureuse de la sécurité des ouvrages. Dans cette thèse, nous proposons de mettre en œuvre numériquement les approches statique par l'intérieur et cinématique par l'extérieur du calcul à la rupture à l'aide d'éléments finis dédiés pour des structures de plaque en flexion et de coque en interaction membrane-flexion. Le problème d'optimisation correspondant est ensuite résolu à l'aide du développement, relativement récents, de solveurs de programmation conique particulièrement efficaces. Les outils développés sont également étendus au contexte de l'homogénéisation périodique en calcul à la rupture, qui constitue un moyen performant de traiter le cas des structures présentant une forte hétérogénéité de matériaux. Des procédures numériques sont spécifiquement développées afin de déterminer puis d'utiliser dans un calcul de structure des critères de résistance homogènes équivalents. Enfin, les potentialités de l'approche par le calcul à la rupture sont illustrées sur deux exemples complexes d'ingénierie : l'étude de la stabilité au feu de panneaux en béton armé de grande hauteur ainsi que le calcul de la marquise de la gare d'Austerlitz / This work aims at developping efficient numerical tools for a more rational and less empirical assessment of civil engineering structures yield design. As opposed to traditionnal methodologies relying on combinations of elastic computations, safety coefficients and local checking of critical members, the yield design theory seems to be a very promising tool for a more rigourous evaluation of structural safety. Lower bound static and upper bound kinematic approaches of the yield design theory are performed numerically using dedicated finite elements for plates in bending and shells in membrane-bending interaction. Corresponding optimization problems are then solved using very efficient conic programming solvers. The proposed tools are also extended to the framework of periodic homogenization in yield design, which enables to tackle the case of strong material heterogeneities. Numerical procedures are specifically tailored to compute equivalent homogeneous strength criteria and to use them, in a second step, in a computation at the structural level. Finally, the potentialities of the yield design approach are illustrated on two complex engineering problems : the stability assessment of high-rise reinforced concrete panels in fire conditions and the computation of the Paris-Austerlitz railway station canopy
|
6 |
Despacho ótimo de geração e controle de potência reativa no sistema elétrico de potência /Yamaguti, Lucas do Carmo. January 2019 (has links)
Orientador: Jose Roberto Sanches Mantovani / Resumo: Neste trabalho são propostos modelos matemáticos determinístico e estocástico de programação cônica de segunda ordem em coordenadas retangulares para o problema de fluxo de potência ótimo de geração e controle de potência reativa no sistemas elétricos de potência, considerando as minimização dos custos de geração de energia, perdas ativas da rede e emissão de poluentes no meio ambiente. Os modelos contemplam as principais características físicas e econômicas do problema estudado, assim como os limites operacionais do sistema elétrico. Os modelos são programados em linguagem AMPL e suas soluções são obtidas através do solver comercial CPLEX. Os sistemas testes IEEE30, IEEE118 e ACTIVSg200 são utilizados nas simulações computacionais dos modelos propostos. Os resultados obtidos pelo modelo determinístico desenvolvido são validados através de comparações com os resultados fornecidos pelo software MATPOWER , onde ambos consideram apenas a existência de gerações termoelétricas. No modelo estocástico utiliza-se a técnica de geração de cenários e considera-se um período de um ano (8760 horas), e geradores que utilizam fontes de geração renováveis e não renováveis. / Abstract: In this work we propose deterministic and stochastic mathematical models of second order conical programming in rectangular coordinates for the optimal power flow problem of reactive power generation and control in electric power systems, considering the minimization of energy generation costs, losses networks and emission of pollutants into the environment. The models contemplate the main physical and economic characteristics of the studied problem, as well as the operational limits of the electric system. The models are programmed in AMPL language and their solutions are obtained through the commercial solver CPLEX. The IEEE30, IEEE118 and ACTIVSg200 test systems are used in the computer simulations of the proposed models. The results obtained by the deterministic model developed are validated through comparisons with the results provided by the software MATPOWERR , where both consider only the existence of thermoelectric generations. The stochastic model uses the scenario generation technique and considers a period of one year (8760 hours), and generators using renewable and non-renewable generation sources. / Mestre
|
7 |
Optimal Reinsurance Designs: from an Insurer’s PerspectiveWeng, Chengguo 09 1900 (has links)
The research on optimal reinsurance design dated back to the 1960’s. For nearly half a century, the quest for optimal reinsurance designs has remained a fascinating subject, drawing significant interests from both academicians and practitioners. Its fascination lies in its potential as an effective risk management tool for the insurers. There are many ways of formulating the optimal design of reinsurance, depending on the chosen objective and constraints. In this thesis, we address the problem of optimal reinsurance designs from an insurer’s perspective. For an insurer, an appropriate use of the reinsurance helps to reduce the adverse risk exposure and improve the overall viability of the underlying business. On the other hand, reinsurance incurs additional cost to the insurer in the form of reinsurance premium. This implies a classical risk and reward tradeoff faced by the insurer.
The primary objective of the thesis is to develop theoretically sound and yet practical solution in the quest for optimal reinsurance designs. In order to achieve such an objective, this thesis is divided into two parts. In the first part, a number of reinsurance models are developed and their optimal reinsurance treaties are derived explicitly. This part focuses on the risk measure minimization reinsurance models and discusses the optimal reinsurance treaties by exploiting two of the most common risk measures known as the Value-at-Risk (VaR) and the Conditional Tail Expectation (CTE). Some additional important economic factors such as the reinsurance premium budget, the insurer’s profitability are also considered. The second part proposes an innovative method in formulating the reinsurance models, which we refer as the empirical approach since it exploits explicitly the insurer’s empirical loss data. The empirical approach has the advantage that it is practical and intuitively appealing. This approach is motivated by the difficulty that the reinsurance models are often infinite dimensional optimization problems and hence the explicit solutions are achievable only in some special cases. The empirical approach effectively reformulates the optimal reinsurance problem into a finite dimensional optimization problem. Furthermore, we demonstrate that the second-order conic programming can be used to obtain the optimal solutions for a wide range of reinsurance models formulated by the empirical approach.
|
8 |
Optimal Reinsurance Designs: from an Insurer’s PerspectiveWeng, Chengguo 09 1900 (has links)
The research on optimal reinsurance design dated back to the 1960’s. For nearly half a century, the quest for optimal reinsurance designs has remained a fascinating subject, drawing significant interests from both academicians and practitioners. Its fascination lies in its potential as an effective risk management tool for the insurers. There are many ways of formulating the optimal design of reinsurance, depending on the chosen objective and constraints. In this thesis, we address the problem of optimal reinsurance designs from an insurer’s perspective. For an insurer, an appropriate use of the reinsurance helps to reduce the adverse risk exposure and improve the overall viability of the underlying business. On the other hand, reinsurance incurs additional cost to the insurer in the form of reinsurance premium. This implies a classical risk and reward tradeoff faced by the insurer.
The primary objective of the thesis is to develop theoretically sound and yet practical solution in the quest for optimal reinsurance designs. In order to achieve such an objective, this thesis is divided into two parts. In the first part, a number of reinsurance models are developed and their optimal reinsurance treaties are derived explicitly. This part focuses on the risk measure minimization reinsurance models and discusses the optimal reinsurance treaties by exploiting two of the most common risk measures known as the Value-at-Risk (VaR) and the Conditional Tail Expectation (CTE). Some additional important economic factors such as the reinsurance premium budget, the insurer’s profitability are also considered. The second part proposes an innovative method in formulating the reinsurance models, which we refer as the empirical approach since it exploits explicitly the insurer’s empirical loss data. The empirical approach has the advantage that it is practical and intuitively appealing. This approach is motivated by the difficulty that the reinsurance models are often infinite dimensional optimization problems and hence the explicit solutions are achievable only in some special cases. The empirical approach effectively reformulates the optimal reinsurance problem into a finite dimensional optimization problem. Furthermore, we demonstrate that the second-order conic programming can be used to obtain the optimal solutions for a wide range of reinsurance models formulated by the empirical approach.
|
9 |
Méthodes numériques pour le calcul à la rupture des structures de génie civil / Numerical methods for the yield design of civil engineering structuresBleyer, Jérémy 17 July 2015 (has links)
Ce travail tente de développer des outils numériques efficaces pour une approche plus rationnelle et moins empirique du dimensionnement à la ruine des ouvrages de génie civil. Contrairement aux approches traditionnelles reposant sur une combinaison de calculs élastiques, l'adoption de coefficients de sécurité et une vérification locale des sections critiques, la théorie du calcul à la rupture nous semble être un outil prometteur pour une évaluation plus rigoureuse de la sécurité des ouvrages. Dans cette thèse, nous proposons de mettre en œuvre numériquement les approches statique par l'intérieur et cinématique par l'extérieur du calcul à la rupture à l'aide d'éléments finis dédiés pour des structures de plaque en flexion et de coque en interaction membrane-flexion. Le problème d'optimisation correspondant est ensuite résolu à l'aide du développement, relativement récents, de solveurs de programmation conique particulièrement efficaces. Les outils développés sont également étendus au contexte de l'homogénéisation périodique en calcul à la rupture, qui constitue un moyen performant de traiter le cas des structures présentant une forte hétérogénéité de matériaux. Des procédures numériques sont spécifiquement développées afin de déterminer puis d'utiliser dans un calcul de structure des critères de résistance homogènes équivalents. Enfin, les potentialités de l'approche par le calcul à la rupture sont illustrées sur deux exemples complexes d'ingénierie : l'étude de la stabilité au feu de panneaux en béton armé de grande hauteur ainsi que le calcul de la marquise de la gare d'Austerlitz / This work aims at developping efficient numerical tools for a more rational and less empirical assessment of civil engineering structures yield design. As opposed to traditionnal methodologies relying on combinations of elastic computations, safety coefficients and local checking of critical members, the yield design theory seems to be a very promising tool for a more rigourous evaluation of structural safety. Lower bound static and upper bound kinematic approaches of the yield design theory are performed numerically using dedicated finite elements for plates in bending and shells in membrane-bending interaction. Corresponding optimization problems are then solved using very efficient conic programming solvers. The proposed tools are also extended to the framework of periodic homogenization in yield design, which enables to tackle the case of strong material heterogeneities. Numerical procedures are specifically tailored to compute equivalent homogeneous strength criteria and to use them, in a second step, in a computation at the structural level. Finally, the potentialities of the yield design approach are illustrated on two complex engineering problems : the stability assessment of high-rise reinforced concrete panels in fire conditions and the computation of the Paris-Austerlitz railway station canopy
|
10 |
[en] SHAPE OPTIMIZATION WITH SYMMETRIC GALERKIN BOUNDARY ELEMENT METHOD / [pt] OTIMIZAÇÃO DE FORMA COM O MÉTODO DE ELEMENTOS DE CONTORNO SIMÉTRICO DE GALERKINHUGO BASTOS DE SA BRUNO 11 September 2017 (has links)
[pt] Esse trabalho propõe uma implementação numérica para otimização de forma em problemas bi-dimensionais de elasticidade. O objetivo principal é propor uma metodologia eficiente e robusta para solução de problemas de otimização de forma considerando a minimização de concentração de tensões. Na implementação proposta, a análise estrutural é realizada pelo Método dos Elementos de Contorno Simétrico de Galerkin (MECSG), evitando-se assim a dispendiosa etapa de geração da malha. A avaliação das tensões no contorno é obtida por meio de um método preciso, ideal para problemas com concentrações de tensões. Outro aspecto relevante na implementação é a adequada partição das equações do MECSG de forma a reduzir, consideravelmente, o esforço computacional associado à etapa da análise estrutural. O problema de otimização é resolvido utilizando-se um método de otimização moderno, conhecido como Programação Cônica de Segunda Orderm (PCSO). Especificamente, busca-se a reposta do problema de otimização não linear por meio da solução de uma sequência de subproblemas de PCSO. / [en] In this work a numerical implementation of shape optimization in two-dimensional linear elasticity problems is proposed. The main goal is to propose a robust and efficient methodology for the solution of shape optimization problems regarding the minimization of stress concentration effects. In the proposed implementation, the structural analysis is performed by the Symmetric Galerkin Boundary Element Method (SGBEM), thus disposing of the mesh generation burden. The boundary stress evaluation is carried out by an accurate approach which is ideally suited for problems with stress concentrations. Another relevant feature of the proposed implementation is a suitable partition of the SGBEM equations which aims at reducing the computational effort associated with the structural analysis stage. The solution for the optimization problem is obtained by means of a modern numerical optimization method, the so-called Second Order Conic Programming (SOCP). Specifically, the solution for the non-linear optimization is sought by solving a sequence of SOCP subproblems.
|
Page generated in 0.0956 seconds