• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1C
• /
• pp.90-97
• /
• 2009

The advantages of the orthogonal frequency division multiplexing (OFDM) are high spectral efficiency, resiliency to RF interference, and lower multi-path distortion. To further utilize vast channel capacity of the multiuser OFDM, one has to find the efficient adaptive subchannel and bit allocation among users. In this paper, we propose an 0-1 integer programming model formulating the optimal subchannel and bit allocation problem of the multiuser OFDM. We employ a dual-decomposition method that provides a tight linear programming (LP) relaxation bound. Simulation results are provided to show the effectiveness of the 0-1 integer programming model. MATLAB simulation on a system employing M-ary quardarature amplitude modulation (MQAM) assuming a frequency-selective channel consisting of three independent Rayleigh multi-paths are carried with the optimal subchannel and bit allocation solution generated by 0-1 integer programming model.

• Asia-Pacific Journal of Business
• /
• v.9 no.4
• /
• pp.99-117
• /
• 2018

This study has investigated Linear Programming (LP) applications to special decision making problems in managerial accounting with the help of spreadsheet Solver tools. It uses scenario approaches to case examples having three products and three resources in make-and-supply business operations, which is applicable to cases having more variables and constraints. Integer Programmings (IP) are applied in order to model situations when products are better valued in integer values or logical constraints are required. Three cases in one-time-only special order decisions include Goal Programming approach, Knapsack problems with 0/1 selections, and fixed-charge 0/1 integer modelling techniques for set-up operation costs. For the decisions in outsourcing problems, opportunity-costs of resources expressed by shadow-prices are considered to determine their precise contributions. It has also shown that the improvement in work-shop operation for an unprofitable product must overcome its 'reduced cost' by the sum of direct manufacturing cost savings and its shadow-price contributions. This paper has demonstrated how various real situations of special decision problem in managerial accounting can be approached without mistakes by using LP's and IP's, and how students both in accounting and management science can acquire LP skills in their education.

• Journal of Korean Society for Quality Management
• /
• v.24 no.1
• /
• pp.20-31
• /
• 1996

A pure zero-one integer program is formulated for determining where to assign the inspection stations in a multi-stage production system. The objective fuction is formulated to minimize the overall inspection costs. One of the major characteristics of this system is that an assigned inspection station is to inspect only the items produced in previous manufacturing stages. Each inspection station can be assigned to any possible inspection stage between two manufacturing stages. Error-free and screening inspection policy is assumed in this system and the defective items found in any inspection station will be reworked at once. The integer programming model presented in this paper has the advantages in the ease of modeling and modifiing as compared with the existing dymanamic programming methods. The solutions of the model can be easily obtained by the commercially available softwares like LINDO and GAMS.

• Journal of Navigation and Port Research
• /
• v.34 no.1
• /
• pp.59-64
• /
• 2010

This study is to determine an optimal marina's construction location candidate among many alternative candidates in order to obtain the maximized efficiency under the natural conditions. To deal with marina's construction location, the optimal construction location is selected using 10 important factor analysis for 10 candidates in Yeosu city. In this paper, the new model to assign the most reasonable alternative is introduced using 0-1 integer programming. This proposed model has not been applied in the optimal marina's facility candidate selection problem yet. This paper will contribute to determine the most reasonable alternative. Also, this proposal model can be applied to other marina's facility candidate selection problem in other regions.

• Journal of the Korean Institute of Navigation
• /
• v.20 no.4
• /
• pp.59-70
• /
• 1996

A berth assignment problem has a direct impact on assessment of charges made to ships and goods. In this paper, we concerned with of fuzzy mathematical programming models for a berth assignment problem to achieved an efficient berth operation in a fuzzy environment. In this paper, we focus on the berth assignment programming with fuzzy parameters which are based on personal opinions or subjective judgement. From the above point of view, assume that a goal and a constraint are given by fuzzy sets, respectively, which are characterized by membership functions. Let a fuzzy decision be defined as the fuzzy set resulting from the intersection of a goal and constraint. This paper deals with fuzziness in all parameters which are expressed by fuzzy numbers. A fuzzy parameter defined by a fuzzy number means a possibility distribution of the parameters. These fuzzy 0-1 integer programming problems are formulated by fuzzy functions whose concept is also called the extension principle. We deal with a berth assignment problem with triangular fuzzy coefficients and propose a branch and bound algorithm for solving the problem. We suggest three models of berth assignment to minimizing the objective functions such as total port time, total berthing time and maximum berthing time by using a revised Maximum Position Shift(MPS) concept. The berth assignment problem is formulated by min-max and fuzzy 0-1 integer programming. Finally, we gave the numerical solutions of the illustrative examples.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.311-314
• /
• 2005

Supply chain optimization is one of the most important components in the optimization of a company's value chain. This paper considers the problem of designing the supply chain for a product that is represented as an assembly bill of material (BOM). In this problem we are required to identify the locations at which different components of the product arc are produced/assembled. The objective is to minimize the overall cost, which comprises production, inventory holding and transportation costs. We assume that production locations are known and that the inventory policy is a base stock policy. We first formulate the problem as a 0-1 nonlinear integer programming model and show that it can be reformulated as a 0-1 linear integer programming model with an exponential number of decision variables.

• Proceedings of KOSOMES biannual meeting
• /
• 2005.11a
• /
• pp.185-190
• /
• 2005

This study is to determine an optimal reservoir among many alternative proposals in order to obtain the maximized efficiency under the limited budget. There are many alternative proposals which deal with problems to assign reservoir such as water conversion establishment construction, subterranean water, reservoir, submarine pipeline, water bort, and marine water saving base construction. In this paper, the new model to assign the most reasonable alternative is introduced using 0-1 integer programming. This proposed model has not been applied in the optimal reservoir selection problem yet. This paper will contribute to determine the most reasonable alternative to minimize budget under constraints. Also, this proposal model can be applied to other reservoir selection problem in other regions.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.13 no.2 s.29
• /
• pp.127-132
• /
• 2007

This study is to determine an optimal reservoir among many alternative proposals in order to obtain the maximized efficiency under the limited budget. There are many alternative proposals which deal with problems to assign reservoir such as water conversion establishment construction, subterranean water, reservoir, submarine pipeline, water boat, and marine water saving base construction. In this paper, the new model to assign the most reasonable alternative is introduced using 0-1 integer programming. This proposed model has not been applied in the optimal reservoir selection problem yet. This paper will contribute to determine the most reasonable alternative to minimize budget under constraints. Also, this proposal model can be applied to other reservoir selection problem in other regions.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.1
• /
• pp.91-103
• /
• 2006

Given a bill of materials (BOM) tree T labeled by the breadth first search (BFS) order from node 0 to node n and a general network ${\Im}=(V,A)$, where V={1,2,...,m} is the set of production facilities and A is the set of arcs representing transportation links between any of two facilities, we assume that each node of T stands for not only a component. but also a production stage which is a possible stocking point and operates under a periodic review base-stock policy, We also assume that the random demand which can be achieved by a suitable service level only occurs at the root node 0 of T and has a normal distribution $N({\mu},{\sigma}^2)$. Then our integrated model of facility location problems and safety stock optimization problem (FLP&SSOP) is to identify both the facility locations at which partitioned subtrees of T are produced and the optimal assignment of safety stocks so that the sum of production cost, inventory holding cost, and transportation cost is minimized while meeting the pre-specified service level for the final product. In this paper, we first formulate (FLP&SSOP) as a nonlinear integer programming model and show that it can be reformulated as a 0-1 linear integer programming model with an exponential number of decision variables. We then show that the linear programming relaxation of the reformulated model has an integrality property which guarantees that it can be optimally solved by a column generation method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.40
• /
• pp.137-142
• /
• 1996

An algorithm for solving the cardinality constrained linear programming knapsack problem is presented. The algorithm has a convenient structure for a branch-and-bound approach to the integer version, especially to the 0-1 collapsing knapsack problem. A numerical example is given.