• Title/Summary/Keyword: mathematics problem

Search Result 3,725, Processing Time 0.025 seconds

THE CONDITIONAL COVERING PROBLEM ON UNWEIGHTED INTERVAL GRAPHS

  • Rana, Akul;Pal, Anita;Pal, Madhumangal
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.1_2
    • /
    • pp.1-11
    • /
    • 2010
  • The conditional covering problem is an important variation of well studied set covering problem. In the set covering problem, the problem is to find a minimum cardinality vertex set which will cover all the given demand points. The conditional covering problem asks to find a minimum cardinality vertex set that will cover not only the given demand points but also one another. This problem is NP-complete for general graphs. In this paper, we present an efficient algorithm to solve the conditional covering problem on interval graphs with n vertices which runs in O(n)time.

A NEW RELAXED TSENG METHOD FOR FINDING A COMMON SOLUTION OF FIXED POINT AND SPLIT MONOTONE INCLUSION PROBLEMS

  • Lusanda Mzimela;Akindele Adebayo Mebawondu;Adhir Maharaj;Chinedu Izuchukwu;Ojen Kumar Narain
    • Nonlinear Functional Analysis and Applications
    • /
    • v.29 no.1
    • /
    • pp.225-258
    • /
    • 2024
  • In this paper, we study the problem of finding a common solution to a fixed point problem involving a finite family of ρ-demimetric operators and a split monotone inclusion problem with monotone and Lipschitz continuous operator in real Hilbert spaces. Motivated by the inertial technique and the Tseng method, a new and efficient iterative method for solving the aforementioned problem is introduced and studied. Also, we establish a strong convergence result of the proposed method under standard and mild conditions.

Consideration of Mathematical Modeling as a Problem-based Learning Method (문제 중심 학습의 방법으로서 수학적 모델링에 대한 고찰)

  • Kim, Sun-Hee
    • School Mathematics
    • /
    • v.7 no.3
    • /
    • pp.303-318
    • /
    • 2005
  • If students can use mathematics to solve their problems and learn the mathematical knowledge through it, they may think mathematics useful and valuable. This study is for the teaching through problem solving in mathematics education, which I consider in terms of the problem-based learning and mathematical modeling. 1 think mathematical modeling is applied to teaching mathematics as a problem-based learning. So I developed the teaching model, and showed the example that students learn the formal and hierarchic mathematics through mathematical modeling.

  • PDF

A NEW APPROACH FOR SOLVING THE STOKES PROBLEM

  • Gachpazan, M.;Kerayechian, A.
    • Journal of applied mathematics & informatics
    • /
    • v.8 no.1
    • /
    • pp.151-164
    • /
    • 2001
  • In this paper, a new approach for finding the approximate solution of the Stokes problem is introduced. In this method the problem is transformed to an equivalent optimization problem. Then, by considering it as a distributed parameter control system, the theory of measure is used to approximate values of pressure are obtained by a finite difference scheme.

INVERSE CONSTRAINED MINIMUM SPANNING TREE PROBLEM UNDER HAMMING DISTANCE

  • Jiao, Li;Tang, Heng-Young
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.1_2
    • /
    • pp.283-293
    • /
    • 2010
  • In this paper, inverse constrained minimum spanning tree problem under Hamming distance. Such an inverse problem is to modify the weights with bound constrains so that a given feasible solution becomes an optimal solution, and the deviation of the weights, measured by the weighted Hamming distance, is minimum. We present a strongly polynomial time algorithm to solve the inverse constrained minimum spanning tree problem under Hamming distance.

AN EFFICIENT ALGORITHM TO SOLVE CONNECTIVITY PROBLEM ON TRAPEZOID GRAPHS

  • Ghosh, Prabir K.;Pal, Madhumangal
    • Journal of applied mathematics & informatics
    • /
    • v.24 no.1_2
    • /
    • pp.141-154
    • /
    • 2007
  • The connectivity problem is a fundamental problem in graph theory. The best known algorithm to solve the connectivity problem on general graphs with n vertices and m edges takes $O(K(G)mn^{1.5})$ time, where K(G) is the vertex connectivity of G. In this paper, an efficient algorithm is designed to solve vertex connectivity problem, which takes $O(n^2)$ time and O(n) space for a trapezoid graph.

A Study on the Practical Use of Fairy-tales in Elementary Mathematics Education (초등수학에서 동화의 활용 방안 탐색)

  • 김상룡
    • Education of Primary School Mathematics
    • /
    • v.6 no.1
    • /
    • pp.29-40
    • /
    • 2002
  • Fairy-tales give students opportunities to build connections between a problem-solving situation and mathematics as well as to communicate solutions through writing, symbols, and diagrams. Therefore, the purpose of this paper is to introduce how to use fairy-tales in elementary mathematics classroom in order to develope student's mathematical concepts and process in terms of the following areas: ⑴ reconstructing literature ⑵ understanding concepts ⑶ problem posing activity. To be useful, mathematics should be taught in contexts that are meaningful and relevant to learners. Therefore using fairy-tales as a vehicle to teach mathematics gives students a chance to develope mathematics understanding in a natural, meaningful way, and to enhance problem posing and problem solving ability. Further, future study will continue to foster how fairy-tales literatures will enhance children's mathematics knowledge and influence on their mathematics performance.

  • PDF

Study on Problem Solving in Elementary School Mathematics through Comparative Analysis (종횡비교분석을 통한 초등학교 수학의 문제해결에 대한 검토)

  • Chang, Hye-Won
    • Journal of Educational Research in Mathematics
    • /
    • v.19 no.2
    • /
    • pp.207-231
    • /
    • 2009
  • The purpose of this study is to examine the state of problem solving in Korean elementary mathematics. To do this, we considered the meaning of problem and problem solving in mathematics education, and analyzed the mathematics curricula in the longitudinal-latitudinal dimensions respectively. The longitudinal one consists in examining and comparing the all-time Korean elementary mathematics curricula. Meanwhile the latitudinal one consists in examining and comparing the elementary mathematics curricula of Singapore, the United Kingdom, Japan, and France. As a result of analysis, we selected ten sieves for analysing Korean elementary mathematics textbooks according to the 7th mathematics curriculum. By the analysis, we conclude that we teach problem solving quite positively in school mathematics relative to another countries, in particular we have to reconsider some issues including dealing problem solving as a independent content not a process integrated in other contents.

  • PDF

OPTIMALITY FOR MULTIOBJECTIVE FRACTIONAL VARIATIONAL PROGRAMMING

  • JO, CHEONGLAI;KIM, DOSANG
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.4 no.2
    • /
    • pp.59-66
    • /
    • 2000
  • We consider a multiobjective fractional variational programming problem (P) involving vector valued functions. By using the concept of proper efficiency, a relationship between the primal problem and parametric multiobjective variational problem is indicated.

  • PDF