• 제목/요약/키워드: dual problem

검색결과 711건 처리시간 0.023초

A New Approach to Solve the Rate Control Problem in Wired-cum-Wireless Networks

  • Loi Le Cong;Hwang Won-Joo
    • 한국멀티미디어학회논문지
    • /
    • 제9권12호
    • /
    • pp.1636-1648
    • /
    • 2006
  • In this paper, we propose a new optimization approach to the rate control problem in a wired-cum-wireless network. A primal-dual interior-point(PDIP) algorithm is used to find the solution of the rate optimization problem. We show a comparison between the dual-based(DB) algorithm and PDIP algorithm for solving the rate control problem in the wired-cum-wireless network. The PDIP algorithm performs much better than the DB algorithm. The PDIP can be considered as an attractive method to solve the rate control problem in network. We also present a numerical example and simulation to illustrate our conclusions.

  • PDF

교차분해법을 이용한 이단계유통체계에서의 중간창고의 입지선정 (Cross Decomposition Applied to the Intermediate Warehouse Location Problem)

  • 차동완;정기호;허원수
    • 한국경영과학회지
    • /
    • 제9권2호
    • /
    • pp.3-8
    • /
    • 1984
  • This paper considers the intermediate warehouse location problem in a two stage distribution system where commodities are delivered from the given set of capacitated factories to customers via uncapacitated intermediate warehouses. In order to determine the subset of warehouses to open which minimizes the total distribution costs including the fixed costs associated with opening warehouses, the cross decomposition method for mixed integer programming recently developed by T.J. Van Roy is used. The cross decomposition unifies Benders decomposition and Lagrangean relaxation into a single framework that involves successive solutions to a primal subproblem and a dual subproblem. In our problem model, primal subproblem turns out to be a transshipment problem and dual subproblem turns out to be an intermediate warehouse location problem with uncapacitated factories.

  • PDF

단일연결 제약하의 설비입지를 고려한 망설계 문제의 쌍대기반 해법 (A dual based heuristic for the hub location and network design problem with single assignment constraint)

  • 윤문길
    • 한국경영과학회지
    • /
    • 제25권1호
    • /
    • pp.67-84
    • /
    • 2000
  • In this paper, we address a network design problem including the decision of hub facility locatiions which is typically found in a communicatio and a transportation network design studies. Due to the administrative and the geographical restrictions, it is common to assume that each user should be assigned to only one hub facility. To construct such a network, three types of network costs should be considered: the fixed costs of establishing the hubs and the arcs in the network, and the variable costs associated with transversing the network. The complex problem is formulated as a mixed IP embedding a multicommodity flow problem. Exploiting its special structure, a dual-based heuristic is then developed, which yields near-optimal design plans. The test results indicate that the heuristic is an effective way to solve this computationally complex problem.

  • PDF

ROBUST SEMI-INFINITE INTERVAL-VALUED OPTIMIZATION PROBLEM WITH UNCERTAIN INEQUALITY CONSTRAINTS

  • Jaichander, Rekha R.;Ahmad, Izhar;Kummari, Krishna
    • Korean Journal of Mathematics
    • /
    • 제30권3호
    • /
    • pp.475-489
    • /
    • 2022
  • This paper focuses on a robust semi-infinite interval-valued optimization problem with uncertain inequality constraints (RSIIVP). By employing the concept of LU-optimal solution and Extended Mangasarian-Fromovitz Constraint Qualification (EMFCQ), necessary optimality conditions are established for (RSIIVP) and then sufficient optimality conditions for (RSIIVP) are derived, by using the tools of convexity. Moreover, a Wolfe type dual problem for (RSIIVP) is formulated and usual duality results are discussed between the primal (RSIIVP) and its dual (RSIWD) problem. The presented results are demonstrated by non-trivial examples.

A NEW CLASS OF GENERALIZED CONVEX PROGRAMMING

  • YAN ZHAOXIANG;LI SHIZHENG
    • Journal of applied mathematics & informatics
    • /
    • 제17권1_2_3호
    • /
    • pp.351-360
    • /
    • 2005
  • This paper finds a new class of generalized convex function which satisfies the following properties: It's level set is $\eta$-convex set; Every feasible Kuhn-Tucker point is a global minimum; If Slater's constraint qualification holds, then every minimum point is Kuhn-Tucker point; Weak duality and strong duality hold between primal problem and it's Mond-Weir dual problem.

이행적 인과 경로를 통한 원인 효과에 대한 해명: 구조 방정식에 토대한 인과 모형의 원인 효과 개념에 대한 평가와 대안 (Causal Effects Along Transitive Causal Routes: Reconsidering Two Concepts of Effects Founded on Structural Equation Model)

  • 김준성
    • 논리연구
    • /
    • 제18권1호
    • /
    • pp.83-133
    • /
    • 2015
  • 이 글에서는 상반된 이중 원인 효과를 해명하는 데 히치콕(Hitchcock 2001a)이 제시한 두 가지 원인 효과를 비판적으로 평가하고 그 비판을 상쇄할 대안을 제시한다. 이를 위해 다섯 가지를 논의한다. 첫째, 상반된 이중 원인 효과에 관한 사례를 소개하고 이에 대한 오테(Otte 1985)와 엘스(Eells 1987)의 논쟁을 검토한다. 이 검토는 이중 원인 효과에 대한 이해와 그와 관련해 논의할 히치콕, 카트라이트(Cartwright 1979, 1989, 1995), 엘스(Eells 1991, 1995)의 이론들을 비교, 평가하는 준비가 된다. 둘째, 구조 방정식 모형에서 두 원인 효과에 착안하여, 히치콕이 제시한 원인 효과의 두 개념, 망 효과와 요소 효과를 소개한다. 셋째, 이중 원인 효과를 해명하는 데 카트라이트와 엘스의 논쟁을 논의하면서, 동질적 부분 집단의 역할, 인과 상호 작용의 중요성에 주목한다. 넷째, 이중 원인 효과를 해명하는 데 히치콕이 적용한 두 원인 효과 개념을 비판적으로 검토하고, 엘스의 이론에 대한 히치콕의 비판을 다시 비판한다. 다섯째, 구조 방정식 모형의 조절 효과 개념을 인과에 대한 확률 이론에 응용하여, 이중 원인 효과에서 초래된 인과 상호 작용을 선언(disjunctive) 관계와 반 사실적 요인으로 형식화하여 보여준다. 조절 효과에 대한 논의는 최근에 많은 주목을 받은 구조 방정식 모형에 토대한 인과 모형 이론들이 인과의 문제들을 해결하는 데 기여할 수 있다. 다른 한편으로, 선언 관계, 반 사실적 조건을 이용한 인과 상호 작용에 대한 논의는 통계적 방법론으로서 구조 방정식 모형을 제고하는 데 도움을 줄 수 있다.

  • PDF

Dual Generalized Maximum Entropy Estimation for Panel Data Regression Models

  • Lee, Jaejun;Cheon, Sooyoung
    • Communications for Statistical Applications and Methods
    • /
    • 제21권5호
    • /
    • pp.395-409
    • /
    • 2014
  • Data limited, partial, or incomplete are known as an ill-posed problem. If the data with ill-posed problems are analyzed by traditional statistical methods, the results obviously are not reliable and lead to erroneous interpretations. To overcome these problems, we propose a dual generalized maximum entropy (dual GME) estimator for panel data regression models based on an unconstrained dual Lagrange multiplier method. Monte Carlo simulations for panel data regression models with exogeneity, endogeneity, or/and collinearity show that the dual GME estimator outperforms several other estimators such as using least squares and instruments even in small samples. We believe that our dual GME procedure developed for the panel data regression framework will be useful to analyze ill-posed and endogenous data sets.

ON A MARTINGALE PROBLEM AND A RELAXED CONTROL PROBLEM W.R.T. SDE

  • Cho, Nhan-Sook
    • 대한수학회지
    • /
    • 제33권4호
    • /
    • pp.777-791
    • /
    • 1996
  • Let $S(R^d)$ be the Schwartz space of infinitely differentiable functions on $R^d$ which vanish at $\infty$ and $S'(R^d)$ be its dual space. The theory of stochastic differential equations(SDEs) governing processes that takes values in the dual of countably Hilbertian nuclear space such as $S'(R^d)$ studied by many authors(e.g [M],[KM]). Let M be a martingale measure defined by Walsh[W], then M can be considered as a $S'(R^d)$-valued process in a certain condition i.e. M has a version of $S'(R^d)$-valued martingale process. (See [W] for detailed discussion)

  • PDF

A dual approach to input/output variance constrained control problem

  • Kim, Jac-Hoon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1994년도 Proceedings of the Korea Automatic Control Conference, 9th (KACC) ; Taejeon, Korea; 17-20 Oct. 1994
    • /
    • pp.28-33
    • /
    • 1994
  • An optimal controller, e.g. LQG controller, may not be realistic in the sense that the required control power may not be achieved by existing actuators, and the measured output is not satisfactory. To be realistic, the controller should meet such constraints as sensor or actuator limitation, performance limit, etc. In this paper, the lnput/Output Variance Constrained (IOVC) control problem will be considered from the viewpoint of mathematical programming. A dual version shall be developed to solve the IOVC control problem, whose objective is to find a stabilizing control law attaining a minimum value of a quadratic cost function subject to the inequality constraint on each input and output variance for a stabilizable and detectable plant. One approach to the constrained optimization problem is to use the Kuhn-Tucker necessary conditions for the optimality and to seek an optimal point by an iterative algorithm. However, since the algorithm uses only the necessary conditions, the convergent point may not be optimal solution. Our algorithm will guarantee a sufficiency.

  • PDF