• Title/Summary/Keyword: solution set

Search Result 1,730, Processing Time 0.042 seconds

Minimally Complex Problem Set for an Ab initio Protein Structure Prediction Study

  • Kim RyangGug;Choi Cha-Yong
    • Biotechnology and Bioprocess Engineering:BBE
    • /
    • v.9 no.5
    • /
    • pp.414-418
    • /
    • 2004
  • A 'minimally complex problem set' for ab initio protein Structure prediction has been proposed. As well as consisting of non-redundant and crystallographically determined high-resolution protein structures, without disulphide bonds, modified residues, unusual connectivities and heteromolecules, it is more importantly a collection of protein structures. with a high probability of being the same in the crystal form as in solution. To our knowledge, this is the first attempt at this kind of dataset. Considering the lattice constraint in crystals, and the possible flexibility in solution of crystallographically determined protein structures, our dataset is thought to be the safest starting points for an ab initio protein structure prediction study.

PARAMETRIC GENERALIZED MULTI-VALUED NONLINEAR QUASI-VARIATIONAL INCLUSION PROBLEM

  • Khan, F.A.;Alanazi, A.M.;Ali, Javid;Alanazi, Dalal J.
    • Nonlinear Functional Analysis and Applications
    • /
    • v.26 no.5
    • /
    • pp.917-933
    • /
    • 2021
  • In this paper, we investigate the behavior and sensitivity analysis of a solution set for a parametric generalized multi-valued nonlinear quasi-variational inclusion problem in a real Hilbert space. For this study, we utilize the technique of resolvent operator and the property of a fixed-point set of a multi-valued contractive mapping. We also examine Lipschitz continuity of the solution set with respect to the parameter under some appropriate conditions.

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 Concave Function Minimization Algorithm Under 0-1 Knapsack Constraint using Strong Valid Inequalities (유효 절단 부등식을 이용한 오목함수 0-1 배낭제약식 문제의 해법)

  • 오세호
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.22 no.3
    • /
    • pp.11-22
    • /
    • 1997
  • The aim of this paper is to develop the B & B type algorithms for globally minimizing concave function under 0-1 knapsack constraint. The linear convex envelope underestimating the concave object function is introduced for the bounding operations which locate the vertices of the solution set. And the simplex containing the solution set is sequentially partitioned into the subsimplices over which the convex envelopes are calculated in the candidate problems. The adoption of cutting plane method enhances the efficiency of the algorithm. These mean valid inequalities with respect to the integer solution which eliminate the nonintegral points before the bounding operation. The implementations are effectively concretized in connection with the branching stategys.

  • PDF

A Fuzzy-Goal Programming Approach For Bilevel Linear Multiple Objective Decision Making Problem

  • Arora, S.R.;Gupta, Ritu
    • Management Science and Financial Engineering
    • /
    • v.13 no.2
    • /
    • pp.1-27
    • /
    • 2007
  • This paper presents a fuzzy-goal programming(FGP) approach for Bi-Level Linear Multiple Objective Decision Making(BLL-MODM) problem in a large hierarchical decision making and planning organization. The proposed approach combines the attractive features of both fuzzy set theory and goal programming(GP) for MODM problem. The GP problem has been developed by fixing the weights and aspiration levels for generating pareto-optimal(satisfactory) solution at each level for BLL-MODM problem. The higher level decision maker(HLDM) provides the preferred values of decision vector under his control and bounds of his objective function to direct the lower level decision maker(LLDM) to search for his solution in the right direction. Illustrative numerical example is provided to demonstrate the proposed approach.

ON OPTIMALITY AND DUALITY FOR GENERALIZED NONDIFFERENTIABLE FRACTIONAL OPTIMIZATION PROBLEMS

  • Kim, Moon-Hee;Kim, Gwi-Soo
    • Communications of the Korean Mathematical Society
    • /
    • v.25 no.1
    • /
    • pp.139-147
    • /
    • 2010
  • A generalized nondifferentiable fractional optimization problem (GFP), which consists of a maximum objective function defined by finite fractional functions with differentiable functions and support functions, and a constraint set defined by differentiable functions, is considered. Recently, Kim et al. [Journal of Optimization Theory and Applications 129 (2006), no. 1, 131-146] proved optimality theorems and duality theorems for a nondifferentiable multiobjective fractional programming problem (MFP), which consists of a vector-valued function whose components are fractional functions with differentiable functions and support functions, and a constraint set defined by differentiable functions. In fact if $\overline{x}$ is a solution of (GFP), then $\overline{x}$ is a weakly efficient solution of (MFP), but the converse may not be true. So, it seems to be not trivial that we apply the approach of Kim et al. to (GFP). However, modifying their approach, we obtain optimality conditions and duality results for (GFP).

POSITIVE SOLUTIONS OF A REACTION-DIFFUSION SYSTEM WITH DIRICHLET BOUNDARY CONDITION

  • Ma, Zhan-Ping;Yao, Shao-Wen
    • Bulletin of the Korean Mathematical Society
    • /
    • v.57 no.3
    • /
    • pp.677-690
    • /
    • 2020
  • In this article, we study a reaction-diffusion system with homogeneous Dirichlet boundary conditions, which describing a three-species food chain model. Under some conditions, the predator-prey subsystem (u1 ≡ 0) has a unique positive solution (${\bar{u_2}}$, ${\bar{u_3}}$). By using the birth rate of the prey r1 as a bifurcation parameter, a connected set of positive solutions of our system bifurcating from semi-trivial solution set (r1, (0, ${\bar{u_2}}$, ${\bar{u_3}}$)) is obtained. Results are obtained by the use of degree theory in cones and sub and super solution techniques.

ON THE LOWER SEMICONTINUITY OF THE SOLUTION SETS FOR PARAMETRIC GENERALIZED VECTOR MIXED QUASIVARIATIONAL INEQUALITY PROBLEMS

  • HUNG, NGUYEN VAN
    • Bulletin of the Korean Mathematical Society
    • /
    • v.52 no.6
    • /
    • pp.1777-1795
    • /
    • 2015
  • In this paper, we establish sufficient conditions for the solution set of parametric generalized vector mixed quasivariational inequality problem to have the semicontinuities such as the inner-openness, lower semicontinuity and Hausdorff lower semicontinuity. Moreover, a key assumption is introduced by virtue of a parametric gap function by using a nonlinear scalarization function. Then, by using the key assumption, we establish condition ($H_h$(${\gamma}_0$, ${\lambda}_0$, ${\mu}_0$)) is a sufficient and necessary condition for the Hausdorff lower semicontinuity, continuity and Hausdorff continuity of the solution set for this problem in Hausdorff topological vector spaces with the objective space being infinite dimensional. The results presented in this paper are different and extend from some main results in the literature.

Optical Sensor of Coplanar Structure Study and Design for Intravenous Solution Exhaustion Alarm System (수액 소진 알람시스템을 위한 동일평면형 광센서의 연구 및 제작)

  • Park, Hyo Soon;Kim, Tae Yun;Jung, Eui Sung;Seong, Ki Woong;Kim, Myoung Nam;Cho, Jin-Ho
    • Journal of Sensor Science and Technology
    • /
    • v.24 no.2
    • /
    • pp.113-118
    • /
    • 2015
  • Intravenous (IV) infusion set is one of the most common treatment methods applied to hospitalized patients. However, it is necessary to check the injection of IV solution in order to prevent patients from any possible medical injuries. In this paper, using the optical sensors to detect exhaustion of IV solution was proposed. The optical sensor is coplanar structure composed of LED and photodiode which is installed according to focal distance of the lens. These two elements detect exhaustion of IV solution at the desired point conveniently. Through the results of experiments using various wavelength of LED (R.G.B), the blue LED was selected to the optimum light source. The suggested optical sensor can detect exhaustion of IV solution by the differences in the amount of light which is caused by properties such as total reflection, refractive index and scattering. From the implementation, the detector is applicable to both containers of IV solution, glass bottle and plastic pack. And also the result shows apparent differences according to existence of IV solution even if the IV solution color and illumination were changed.

ON CHARACTERIZATIONS OF SET-VALUED DYNAMICS

  • Chu, Hahng-Yun;Yoo, Seung Ki
    • Bulletin of the Korean Mathematical Society
    • /
    • v.53 no.4
    • /
    • pp.959-970
    • /
    • 2016
  • In this paper, we generalize the stability for an n-dimensional cubic functional equation in Banach space to set-valued dynamics. Let $n{\geq}2$ be an integer. We define the n-dimensional cubic set-valued functional equation given by $$f(2{{\sum}_{i=1}^{n-1}}x_i+x_n){\oplus}f(2{{\sum}_{i=1}^{n-1}}x_i-x_n){\oplus}4{{\sum}_{i=1}^{n-1}}f(x_i)\\=16f({{\sum}_{i=1}^{n-1}}x_i){\oplus}2{{\sum}_{i=1}^{n-1}}(f(x_i+x_n){\oplus}f(x_i-x_n)).$$ We first prove that the solution of the n-dimensional cubic set-valued functional equation is actually the cubic set-valued mapping in [6]. We prove the Hyers-Ulam stability for the set-valued functional equation.