• Title/Summary/Keyword: Kuhn-Tucker conditions

Search Result 54, Processing Time 0.019 seconds

NECESSARY AND SUFFICIENT OPTIMALITY CONDITIONS FOR FUZZY LINEAR PROGRAMMING

  • Farhadinia, Bahram
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.1_2
    • /
    • pp.337-349
    • /
    • 2011
  • This paper is concerned with deriving necessary and sufficient optimality conditions for a fuzzy linear programming problem. Toward this end, an equivalence between fuzzy and crisp linear programming problems is established by means of a specific ranking function. Under this setting, a main theorem gives optimality conditions which do not seem to be in conflict with the so-called Karush-Kuhn-Tucker conditions for a crisp linear programming problem.

Optimization Method of Building Energy Performance and Construction Cost Using Kuhn-Tucker Conditions (쿤-터커 조건을 이용한 건물의 에너지성능과 비용 최적화방법)

  • Won, Jong-Seo;Koo, Jae-Oh
    • KIEAE Journal
    • /
    • v.3 no.2
    • /
    • pp.51-58
    • /
    • 2003
  • The purpose of this study is to present rational methods of multi-criteria optimization of the shape of energy saving buildings. The object is to determine the optimum dimension of the shape of a building, based on the following criteria: minimum building costs (including the cost of materials and construction) and yearly heating costs. Mathematical model described heat losses and gains in a building during the heating season. It takes into consideration heat losses through wall, roof, floor and windows. Particular attention was paid to have a more detailed description of heat gains due to solar radiation. On the assumption that shape of building is rectangle in order to solve the problem, the proportions of wall length and building height are determined by using non-linear programing methods(Kuhn-Tucker Conditions). The results constitute information for designers on the optimum proportions of wall lengths, height, and the ratios of window to wall areas for energy saving buildings.

THE KARUSH-KUHN-TUCKER OPTIMALITY CONDITIONS IN INTERVAL-VALUED MULTIOBJECTIVE PROGRAMMING PROBLEMS

  • Hosseinzade, Elham;Hassanpour, Hassan
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.5_6
    • /
    • pp.1157-1165
    • /
    • 2011
  • The Karush-Kuhn-Tucker (KKT) necessary optimality conditions for nonlinear differentiable programming problems are also sufficient under suitable convexity assumptions. The KKT conditions in multiobjective programming problems with interval-valued objective and constraint functions are derived in this paper. The main contribution of this paper is to obtain the Pareto optimal solutions by resorting to the sufficient optimality condition.

ON VARIATIONAL PROBLEMS INVOLVING HIGHER ORDER DERIVATIVES

  • HUSAIN I.;JABEEN Z.
    • Journal of applied mathematics & informatics
    • /
    • v.17 no.1_2_3
    • /
    • pp.433-455
    • /
    • 2005
  • Fritz John, and Karush-Kuhn-Tucker type optimality conditions for a constrained variational problem involving higher order derivatives are obtained. As an application of these Karush-Kuhn-Tucker type optimality conditions, Wolfe and Mond-Weir type duals are formulated, and various duality relationships between the primal problem and each of the duals are established under invexity and generalized invexity. It is also shown that our results can be viewed as dynamic generalizations of those of the mathematical programming already reported in the literature.

Incremental SVM for Online Product Review Spam Detection (온라인 제품 리뷰 스팸 판별을 위한 점증적 SVM)

  • Ji, Chengzhang;Zhang, Jinhong;Kang, Dae-Ki
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.05a
    • /
    • pp.89-93
    • /
    • 2014
  • Reviews are very important for potential consumer' making choices. They are also used by manufacturers to find problems of their products and to collect competitors' business information. But someone write fake reviews to mislead readers to make wrong choices. Therefore detecting fake reviews is an important problem for the E-commerce sites. Support Vector Machines (SVMs) are very important text classification algorithms with excellent performance. In this paper, we propose a new incremental algorithm based on weight and the extension of Karush-Kuhn-Tucker(KKT) conditions and Convex Hull for online Review Spam Detection. Finally, we analyze its performance in theory.

  • PDF

Mathematical Proof for Structural Optimization with Equivalent Static Loads Transformed from Dynamic Loads (동하중에서 변환된 등가정하중에 의한 최적화 방법의 수학적 고찰)

  • Park, Gyung-Jin;Kang, Byung-Soo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.2
    • /
    • pp.268-275
    • /
    • 2003
  • Generally, structural optimization is carried out based on external static loads. All forces have dynamic characteristics in the real world. Mathematical optimization with dynamic loads is extremely difficult in a large-scale problem due to the behaviors in the time domain. The dynamic loads are often transformed into static loads by dynamic factors, design codes, and etc. Therefore, the optimization results can give inaccurate solutions. Recently, a systematic transformation has been proposed as an engineering algorithm. Equivalent static loads are made to generate the same displacement field as the one from dynamic loads at each time step of dynamic analysis. Thus, many load cases are used as the multiple leading conditions which are not costly to include in modern structural optimization. In this research, it is mathematically proved that the solution of the algorithm satisfies the Karush-Kuhn-Tucker necessary condition. At first, the solution of the new algorithm is mathematically obtained. Using the termination criteria, it is proved that the solution satisfies the Karush-Kuhn-Tucker necessary condition of the original dynamic response optimization problem. The application of the algorithm is discussed.

OPTIMALITY CRITERIA AND DUALITY FOR MULTIOBJECTIVE VARIATIONAL PROBLEMS INVOLVING HIGHER ORDER DERIVATIVES

  • Husain, I.;Ahmed, A.;Rumana, G. Mattoo
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.1_2
    • /
    • pp.123-137
    • /
    • 2009
  • A multiobjective variational problem involving higher order derivatives is considered and Fritz-John and Karush-Kuhn-Tucker type optimality conditions for this problem are derived. As an application of Karush-Kuhn-Tucker optimality conditions, Wolfe type dual to this variational problem is constructed and various duality results are validated under generalized invexity. Some special cases are mentioned and it is also pointed out that our results can be considered as a dynamic generalization of the already existing results in nonlinear programming.

  • PDF

A Study on the Optimization Method of Building Envelope using Non-linear Programming (비선형계획법을 이용한 건물의 외피최적화 방법)

  • Won, Jong-Seo;Lee, Kyung-Hoi
    • KIEAE Journal
    • /
    • v.3 no.2
    • /
    • pp.17-24
    • /
    • 2003
  • The purpose of this study is to present rational methods of multi-criteria optimization of the envelope of buildings. The object is to determine the optimum R-value of the envelope of a building, based on the following criteria: minimum building costs (including the cost of materials and construction) and yearly heating costs. Mathematical model described heat losses and gains in a building during the heating season. It takes into consideration heat losses through wall, roof, floor and windows. Particular attention was paid to have a more detailed description of heat gains due to solar radiation. On the assumption that shape of building is rectangle in order to solve the problem, optimum R-value of the envelope of a building is determined by using non-linear programing methods(Kuhn-Tucker Conditions). The results constitute information for designers on the optimum R-value of a building envelope for energy saving buildings.

Energy-Efficient Resource Allocation in Multi-User AF Two-Way Relay Channels

  • Kim, Seongjin;Yu, Heejung
    • Journal of Communications and Networks
    • /
    • v.18 no.4
    • /
    • pp.629-638
    • /
    • 2016
  • In this paper, we investigate an energy-efficient resource allocation problem in a two-way relay (TWR) network consisting of multiple user pairs and an amplify-and-forward (AF) relay. As the users and relay have individual energy efficiencies (EE), we formulate a multi-objective optimization problem (MOOP). A single-objective optimization problem (SOOP) of the MOOP is introduced using a weighted-sum method, which achieves a single Pareto optimal point of the MOOP. To derive the algorithm for the SOOP, we propose a more tractable equivalent problem using the Karush-Kuhn-Tucker conditions of the SOOP, which guarantees convergence at the local optimal points. The proposed equivalent problem can be efficiently solved by the proposed iterative algorithm. Numerical results demonstrate the effectiveness of the proposed algorithm in achieving the optimal EE in multi-user AF TWR networks.