• Title/Summary/Keyword: Relaxation of Restrictions

Search Result 15, Processing Time 0.033 seconds

A comparative legal study on the relaxation of restrictions at the acquisition of own stock in enterprise (기업의 자기주식취득제한 완화에 관한 비교법적 연구)

  • Choi, Yong-Choon
    • The Journal of Information Technology
    • /
    • v.8 no.3
    • /
    • pp.57-71
    • /
    • 2005
  • This thesis is to explore the relaxation of restrictions at the acquisition of own stock, and to get the results from this system many countries' legislations were alluded as model cases for Korean system. In comparing with America, Japan, Europe(EC 2nd Commercial Law), and England, the final suggestion for Korean companies law as follows: The solution of problems which is derived from the acquisition at own stock in enterprise is to make the optimum situation for the economic development and stability of stock market. So, to solve these problems needs the relaxation of restrictions for this system and by the relaxation of restrictions can get the distribution of its profit to stockholder, and the compensation for employers and employees. Furthermore, through this system the company can achieve the protection against M&A and the supply of company funds. In conclusion the relaxation of restrictions at the acquisition of own stock is acknowledged the necessity, but the problems that would be followed must be necessarily minimized, and to do so, the legal system has to be molded for this purpose and the its procedure(that is, accounting deal of own stock, the fictitious dividend, and non-appliance of tendency control) has to be prior to the legal system.

  • PDF

The Maximal Covering Location Problem with Cost Restrictions (비용 제약 하에서 서비스 수준을 최대화화는 설비입지선정에 관한 연구)

  • Hong, Sung Hak;Lee, Young Hoon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.30 no.2
    • /
    • pp.93-106
    • /
    • 2004
  • This paper studied a maximal covering location problem with cost restrictions, to maximize level of service within predetermined cost. It is assumed that all demand have to be met. If the demand node is located within a given range, then its demand is assumed to be covered, but if it is not, then its demand is assumed to be uncovered. An uncovered demand is received a service but at an unsatisfactory level. The objective function is to maximize the sum of covered demand, Two heuristics based on the Lagrangean relaxation of allocation and decoupling are presented and tested. Upper bounds are found through a subgradient optimization and lower bounds are by a cutting algorithm suggested in this paper. The cutting algorithm enables the Lagrangean relaxation to be proceeded continually by allowing infeasible solution temporarily when the feasible solution is not easy to find through iterations. The performances are evaluated through computational experiments. It is shown that both heuristics are able to find the optimal solution in a relatively short computational time for the most instances, and that decoupling relaxation outperformed allocation relaxation.

An Integer Programming Approach to the Problem of Daily Crew Scheduling (일간승무계획문제의 정수계획해법)

  • 변종익;이경식;박성수
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.613-616
    • /
    • 2000
  • This paper considers the problem of subway crew scheduling. Crew scheduling is concerned with finding a minimum number of assignments of crews to a given timetable satisfying various restrictions. Traditionally, crew scheduling problem has been formulated as a set covering or set partitioning problem possessing exponentially many variables, but even the LP relaxation of the problem is hard to solve due to the exponential number of variables. In this paper, we propose two basic techniques that solve the problem in a reasonable time, though the optimality of the solution is not guaranteed. To reduce the number of variables, we adopt column-generation technique. We could develop an algorithm that solves column-generation problem in polynomial time. In addition, the integrality of the solution is accomplished by variable-fixing technique. Computational results show column-generation makes the problem of treatable size, and variable fixing enables us to solve LP relaxation in shorter time without a considerable increase in the optimal value. Finally, we were able to obtain an integer optimal solution of a real instance within a reasonable time.

  • PDF

A Lagrangian Relaxation Method for Parallel Machine Scheduling with Resource Constraints

  • Kim, Dae-Cheol
    • IE interfaces
    • /
    • v.11 no.3
    • /
    • pp.65-75
    • /
    • 1998
  • This research considers the problem of scheduling jobs on parallel machines with non-common due dates and additional resource constraints. The objective is to minimize the total absolute deviation of job completion times about the due dates. Job processing times are assumed to be the same. This problem is motivated by restrictions that occur in the handling and processing of jobs in certain phases of semiconductor manufacturing and other production systems. We examine two problems. For the first of these, the number of different types of additional: resources and resource requirements per job are arbitrary. The problem is formulated as a zero-one integer linear programming and the Lagrangian relaxation approach is used. For the second case, there exists one single type of additional resource and the resource requirements per job are zero or one. We show how to formulate the problem as an assignment problem.

  • PDF

Improvment of Branch and Bound Algorithm for the Integer Generalized Nntwork Problem (정수 일반네트워크문제를 위한 분지한계법의 개선)

  • 김기석;김기석
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.19 no.2
    • /
    • pp.1-19
    • /
    • 1994
  • A generalized network problem is a special class of linear programming problem whose coefficient matrix contains at most two nonzero elements per column. A generalized network problem with 0-1 flow restrictions is called an integer generalized network(IGN) problem. In this paper, we presented a branch and bound algorithm for the IGN that uses network relaxation. To improve the procedure, we develop various strategies, each of which employs different node selection criterion and/or branching variable selection criterion. We test these solution strategies and compare their efficiencies with LINDO on 70 randomly generated problems.

  • PDF

The Birth and Development of High-Rise Buildings in Japan: Focusing on the Historical Development of Height and Floor Area Ratio Regulations

  • Akihiko Osawa
    • International Journal of High-Rise Buildings
    • /
    • v.12 no.3
    • /
    • pp.195-201
    • /
    • 2023
  • This paper reviews the history of the birth and development of the skyscraper in Japan, mainly from the perspective of the legal system, and presents the following points: 1) After 1919, building height was limited to 31 m or less, which continued after the war and defined the skyline of Japan's major cities; 2) The 31-meter height limit became a problem during rapid economic growth. With the development of tall building construction technology, the height limit was eliminated, and skyscrapers were born in Japan in the 1960s; 3) Later, the number of skyscrapers increased more rapidly in the post-bubble period after the collapse of the bubble economy in the 2000s than in the boom years of the 1980s, when the floor-area ratio was relaxed for economic uplift and urban renewal. The number of skyscrapers increased rapidly against the backdrop of the deregulation of the floor-area ratio.

An Integer Programming Approach to the Subway Daily Crew Scheduling Problem (지하철 일간승무계획문제의 정수계획해법)

  • 변종익;이경식;박성수;강성열
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.27 no.4
    • /
    • pp.67-86
    • /
    • 2002
  • This paper considers subway crew scheduling problem. Crew scheduling is concerned with finding a minimum number of assignments of crews to a given timetable satisfying various restrictions. Traditionally, crew scheduling problem has been formulated as a set covering or set partitioning problem possessing exponentially many variables, but even the LP relaxation of the problem is hard to solve due to the exponential number of variables. In this paper. we propose two basic techniques that solve the subway crew scheduling problem in a reasonable time, though the optimality of the solution is not guaranteed. We develop an algorithm that solves the column-generation problem in polynomial time. In addition, the integrality of the solution is accomplished by variable-fixing technique. Computational result for a real instance is reported.

Explanations of the Revised Protection of Cultural Properties Act (개정 문화재보호법 해설 -'99년 1월 ~ 2001년 9월 기간 개정사항-)

  • Cho, hyon-jung
    • Korean Journal of Heritage: History & Science
    • /
    • v.34
    • /
    • pp.222-267
    • /
    • 2001
  • The purpose of this document is to explain the revisions of the Protection of Cultural Properties Act and its sub-laws which have been mad from Jan. 1999 to Sep. 2001. The Protection of Cultural Properties Act and its sub-laws have been revised three times from 1999 to 2001, before and after the Office of Cultural Properties was raised to Cultural Properties Administration on May 24, 1999. The main points of the revisions are as follows. First of all, the role of the local autonomous entities has been increased. The governor of the local autonomous entities is entitled to announce administrative orders related to the preservation of State-designated Cultural Properties. Also, the local autonomous entities has the authorities to examine whether the construction work which will be made in the outer boundaries, which is provided by regulations, of the protected area of the cultural properties might have any effect on preservation of cultural properties or not. Second, preventive actions to protect the cultural properties have been strengthened. If the scale of construction work is more than some scale, the preliminary survey of the surface of the earth to confirm the existence of buried cultural properties and their distribution is obligated. One who is promoting the development plan more than some scale must discuss the plan with the Administrator of Cultural Properties Administration in the process of planning. These actions would be effective to prevent the cultural properties from being damaged because of the development. Third, relaxation of the restrictions has been proceeded. On the basis of regulations which specify the actions to affect the preservation of cultural properties, negative system that does not limit the actions which are not specified in the regulations is introduced. The appropriateness of both protected structure and area should be regularly reviewed and adjusted. Also, most of the restrictions which was made only for administrative convenience and over-regulated the people's living have been revised. Finally, the number of cultural properties to be protected has been increased. Besides the State-designated Cultural Properties, the other cultural properties which are worthy to be protected as City-or-Province-designated Cultural Properties can be designated provisionally and protected. The system of registration and maintenance of the buildings and facilities which are not designated as the Modern Cultural Heritages is established. The penalty for damaging and stealing the cultural Properties which are not designated to be protected was strengthened. Even a dead natural monument can be acknowledged as an natural monument and it is limited to make a specimen or stuffing of the dead natural monument. All of these actions are fit to the high level of understanding of the public about the cultural properties and as the result of these actions, the number of cultural properties to be preserved has been increased. To sum up, the directions of revisions of the Protection of Cultural Properties Act and its sub­laws which have been made from Jan. 1999 to Sep. 2001. are the localization of the protection of the cultural properties, the strengthening of protective actions, the relaxation of various regulations and the increasing of the number fo the protected cultural properties. Also, various problems raised in the processes of implementations of the laws have been reviewed and revised.

Molecular Modeling of Bisphenol-A Polycarbonate and Tetramethyl Bisphenol-A Polycarbonate

  • Kim, Sangil;Juwhan Liu
    • Macromolecular Research
    • /
    • v.9 no.3
    • /
    • pp.129-142
    • /
    • 2001
  • To efficiently demonstrate the molecular motion, physical properties, and mechanical properties of polycarbonates, we studied the differences between bisphenol-A polycarbonate(BPA-PC) and tetramethyl bisphenol-A-polycarbonate(TMBPA-PC) using molecular modeling techniques. To investigate the conformations of BPA-PC and TMBPA-PC and the effect of the conformation on mechanical properties, we performed conformational energy calculation, molecular dynamics calculation, and stress-strain curves based on molecular mechanics method. From the result obtained from conformational energy calculations of each segment, the molecular motions of the carbonate and the phenylene group in BPA-PC were seen to be more vigorous and have lower restriction to mobility than those in TMBPA-PC, respectively. In addition, from the results of radial distribution function, velocity autocorrelation function, and power spectrum, BPA-PC appeared to have higher diffusion constant than TMBPA-PC and is easier to have various conformations because of the less severe restrictions in molecular motion. The result of stress-strain calculation for TMBPA-PC seemed to be in accordance with the experimental value of strain-to-failure ∼4%. From these results of conformational energy calculations of segments, molecular dynamics, and mechanical properties, it can be concluded that TMBPA-PC has higher modulus and brittleness than BPA-PC because the former has no efficient relaxation mode against the external deformations.

  • PDF