فهرست مقالات Branch and bound algorithm

• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  1 - Fuzzy Approach to Solve a Global Mixed Integer Multi-Objective FractionalL Signomial Geometric Programming ‎Problem‎
  Zh. Shirinnejad M. Saraj S. Shokrolahi F. Kiany
  10.30495/ijim.2022.58206.1482
  This study proposes a method for solving mixed integer multi-objective fractional signomial geometric programming (MIMOFSGP) problems. A few methods have been applied in the recent past to convert a fractional signomial objective function into a non-fractional signomial چکیده کامل

  This study proposes a method for solving mixed integer multi-objective fractional signomial geometric programming (MIMOFSGP) problems. A few methods have been applied in the recent past to convert a fractional signomial objective function into a non-fractional signomial objective function to find the optimal solution by use of some common mathematical programming techniques. In this paper, at first a multi-objective fractional signomial programming is converted into a non-fractional multi-objective signomial programming problem by a new convenient reformulation strategy. A convex relaxation is used to reach global solution and then fuzzy programming technique is applied to find the optimal compromise solution. A mixed integer compromise optimal solution of the convex programming problem can finally be found by use of nonlinear branch and bound algorithm. Then 0n using the Spacial branch and bound algorithm, we find a solution that has the shortest distance from the solution of original problem. Finally two illustrative examples are included to demonstrate the correctness and efficiency of the proposed strategy and compare the results with the other solutions obtained by the other methods. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  2 - An Algorithm Based on Theory of Constraints and Branch and Bound for Solving Integrated Product-Mix-Outsourcing Problem
  Esmaeil Mehdizadeh Saeed Jalili
  10.22094/joie.2018.664.1429
  One of the most important decision making problems in many production systems is identification and determination of products and their quantities according to available resources. This problem is called product-mix. However, in the real-world situations, for existing c چکیده کامل

  One of the most important decision making problems in many production systems is identification and determination of products and their quantities according to available resources. This problem is called product-mix. However, in the real-world situations, for existing constrained resources, many companies try to provide some products from external resources to achieve more profits. In this paper, an integrated product-mix-outsourcing problem (IPMO) is considered to answer how many products should be produced inside of the system or purchased from external resources. For this purpose, an algorithm based on Theory of Constraints (TOC) and Branch and Bound (B&B) algorithm is proposed. For investigation of the proposed algorithm, a numerical example is presented. The obtained results show the optimal result by the new algorithm is as same as the results of integer linear programming. پرونده مقاله