ANALISIS KEBUTUHAN PENGEMBANGAN VIDEO PEMBELAJARAN MATA KULIAH PROGRAM LINIER

Linear Programming is a course under the scope of algebra that must be mastered by mathematics education students. The low ability to solve linear programming problems can affect student performance when they become a teacher. This study aims to analyze the need for developing learning videos in Linear Programming courses for students of the Mathematics Education Study Program. The method used is development research which consists of Preliminary Analysis, Product Prototype, and Assessment. The research subjects were 30 students in the 7th semester of mathematics education and had attended online Linear Programming lectures in the previous semester. Data were collected by conducting written tests, questionnaires, and interviews and analyzed quantitatively descriptively. The results of the written test analysis showed that the students' ability to solve linear programming problems was low. Based on interviews, it is also known that students are not enough just to learn through modules and virtual meetings. Students tend to need learning videos/records to repeat explanations when studying the material independently. Therefore, there is a great need for learning videos that can optimize online learning of Linear Programming courses.

ANALISIS KEBUTUHAN PENGEMBANGAN VIDEO PEMBELAJARAN MATA KULIAH PROGRAM LINIER

Linear Programming is a course under the scope of algebra that must be mastered by mathematics education students. The low ability to solve linear programming problems can affect student performance when they become a teacher. This study aims to analyze the need for developing learning videos in Linear Programming courses for students of the Mathematics Education Study Program. The method used is development research which consists of Preliminary Analysis, Product Prototype, and Assessment. The research subjects were 30 students in the 7th semester of mathematics education and had attended online Linear Programming lectures in the previous semester. Data were collected by conducting written tests, questionnaires, and interviews and analyzed quantitatively descriptively. The results of the written test analysis showed that the students' ability to solve linear programming problems was low. Based on interviews, it is also known that students are not enough just to learn through modules and virtual meetings. Students tend to need learning videos/records to repeat explanations when studying the material independently. Therefore, there is a great need for learning videos that can optimize online learning of Linear Programming courses.

NEW IMPROVED METHOD FOR SOLVING THE FUZZY LINEAR PROGRAMMING PROBLEMS WITH VARIABLES GIVEN AS FUZZY NUMBERS

The present paper aims to propose an alternative solution approach in obtaining the fuzzy optimal solution to a fuzzy linear programming problem with variables given as fuzzy numbers with minimum uncertainty. In this paper, the fuzzy linear programming problems with variables given as fuzzy numbers is transformed into equivalent interval linear programming problems with variables given as interval numbers. The solutions to these interval linear programming problems with variables given as interval numbers are then obtained with the help of linear programming technique. A set of six random numerical examples has been solved using the proposed approach.

Multi-issue bankruptcy problems with crossed claims

In this paper, we introduce a novel model of multi-issue bankruptcy problem inspired from a real problem of abatement of emissions of different pollutants in which pollutants can have more than one effect on atmosphere. In our model, therefore, several perfectly divisible goods (estates) have to be allocated among certain set of agents (claimants) that have exactly one claim which is used in all estates simultaneously. In other words, unlike of the multi-issue bankruptcy problems already existent in the literature, this model study situations with multi-dimensional states, one for each issue and where each agent claims the same to the different issues in which participates. In this context, we present an allocation rule that generalizes the well-known constrained equal awards rule from a procedure derived from analyzing this rule for classical bankruptcy problems as the solution to a sucession of linear programming problems. Next, we carry out an study of its main properties, and we characterize it using the well-known property of consistency.

Apresentação

A Ciência da Computação é uma área de conhecimento que pode transitar com desenvoltura em muitas outras áreas, apresentando aplicações diversas para utilização no cotidiano de todos. As aplicações computacionais ficaram muito mais evidentes em um momento quando muitas pessoas precisaram ficar em casa, em meio a uma crise sanitária, numa tentativa de realizar trabalhos de forma remota, fazendo uso de interfaces que deveriam dar conta da interação humana e também da conexão, transmissão e compartilhamento de dados e/ou informações – estas pessoas eram, em sua maioria, trabalhadoras que lidavam/lidam com a informação e o conhecimento. Neste período também foi evidenciado que há necessidade também de confiabilidade no que é produzido e compartilhado, tendo por origem as respeitadas instituições que produzem conhecimento – as Universidades e os institutos de pesquisa. Em um período que o conhecimento, bem como aqueles que os produzem, sofrem ataques diversos, criando dúvidas onde a ciência já produziu sólidas pesquisas e testes confiáveis, é necessário reafirmar que mantemos a confiança na ciência, nos pesquisadores sérios, responsáveis e comprometidos com a divulgação de conhecimento que ajude as pessoas em diversas instâncias de atuação, para que não tenhamos a impressão de vivermos uma distopia como a que lemos em Fahrenheit 451, de Ray Bradbury. A comunicação em meio digital é, sem dúvida a grande protagonista nesse período da pandemia de covid-19 e neste sentido, a computação continua a transitar pelas diversas áreas de conhecimento, seja contribuindo para a infraestrutura onde serão realizados os trabalhos no formato remoto, seja na interface em que permitirá o uso dessa infraestrutura. Esta é uma edição com apenas 4 (quatro) artigos e que apresentam temas e objetos diversos de estudos, mas marcando a presença digital de mais uma edição da nossa ReCiC. O primeiro artigo desta edição, intitulado “Análise de metadados para inferência da qualidade de artigos da Wikipédia”, de autoria dos pesquisadores Rodrigo S. Nürmberg e Arlindo Amaral Neto, apresenta um estudo realizado a partir do uso de metadados de conteúdos da web, mais especificamente dos textos da Wikipédia, com o objetivo de inferir automaticamente sobre a qualidade destes, a partir de determinados critérios. O segundo artigo, com o título “Linear programming problems in High School using GeoGebra”, escrito por Gonçalo Cerqueira, Velton Pires e Daniel Campos, trazem um conteúdo matemático aplicado por meio de uma interface computacional, criando condições para um melhor entendimento da aplicabilidade da matemática para melhor compreensão de seu conteúdo na educação básica, no Ensino Médio. Já o terceiro artigo, cujo título é “Um sistema de baixo custo para redes inteligentes de transporte público”, traz os resultados do trabalho dos pesquisadores Marlos Marques, Cassio Silva e Jorge Correia que aborda um uso das tecnologias digitais móveis para prover informações úteis aos utilizadores dos serviços de transporte público. E fechando esta edição, o artigo dos pesquisadores da University of Yaounde I (Camarões), C. Nkuimi-Jugnia e P. Pankiti, intitulado “Finitary ideals of direct products in quantales”, aborda uma discussão teórica dentro da Matemática Discreta que embasa teoricamente a Computação, mais detidamente sobre algumas estruturas algébricas parcialmente ordenadas. Os temas abordados são diversos e como a computação, seja como ciência ou como técnica, aplicáveis em nossa realidade de estudos, também diversos. Deixo aqui um agradecimento a todos que contribuíram para que este conteúdo pudesse ser publicado. Uma boa leitura a toda a gente. Gidevaldo Novais dos Santos Editor-Chefe da ReCiC

Linear programming problems in high school using GeoGebra

Many high school teachers when teaching mathe-matical content, face questions from their students about theapplicability of these contents. We will show in this paper thatit is possible to answer some of these questions by relating someof this content to optimization problems, which are modeled aslinear programming problems and solved using GeoGebra as atool.

A study on a new method for solving interval neutrosophic linear programming problems

Neutrosophic set theory is a generalization of the intuitionistic fuzzy set which can be considered as a powerful tool to express the indeterminacy and inconsistent information that exist commonly in engineering applications and real meaningful science activities. In this paper an interval neutrosophic linear programming (INLP) model will be presented, where its parameters are represented by triangular interval neutrosophic numbers (TINNs) and call it INLP problem. Afterward, by using a ranking function we present a technique to convert the INLP problem into a crisp model and then solve it by standard methods

Decision space robustness for multi-objective integer linear programming

In this article we introduce robustness measures in the context of multi-objective integer linear programming problems. The proposed measures are in line with the concept of decision robustness, which considers the uncertainty with respect to the implementation of a specific solution. An efficient solution is considered to be decision robust if many solutions in its neighborhood are efficient as well. This rather new area of research differs from robustness concepts dealing with imperfect knowledge of data parameters. Our approach implies a two-phase procedure, where in the first phase the set of all efficient solutions is computed, and in the second phase the neighborhood of each one of the solutions is determined. The indicators we propose are based on the knowledge of these neighborhoods. We discuss consistency properties for the indicators, present some numerical evaluations for specific problem classes and show potential fields of application.

A Scenario-based Model for Resource Allocation with Price Information

In this paper, we consider the problem of allocating resources among Decision Making Units (DMUs). Regarding the concept of overall (cost) efficiency, we consider three different scenarios and formulate three Resource Allocation (RA) models correspondingly. In the first scenario, we assume that overall efficiency of each unit remains unchanged. The second scenario is related to the case where none of overall efficiency scores is deteriorated. We improve the overall efficiencies by a pre-determined percentage in the last scenario. We formulate Linear Programming problems to allocate resources in all scenarios. All three scenarios are illustrated through numerical and empirical examples.