Academic maturity of students in an extended programme in mathematics

ABSTRACT

This paper focuses on the students who are registered in the University of Pretoria’s academic development programme, named the Four-year Programme (FYP). The programme was introduced as a gateway for students who are underprepared but have the potential to succeed and then continue their studies into the mainstream science programmes. Our research focuses on measuring the change in the academic maturity of these students. In the theoretical framework that we developed, academic maturity is subdivided into two components namely non-subject based maturity and subject based maturity (mathematical maturity). This paper focuses on measuring non-subject based academic maturity. The survey used for this purpose is called the Student Academic Readiness Survey (STARS), taken at the beginning of the year and after the first semester respectively. The results of the surveys are compared to measure the change in students’ views. Results show that in all constructs there is a surprising decline in students’ perceptions regarding their own abilities over the first semester at university. We use the Dunning–Kruger effect to explain this unexpected decline, in that students seem to develop a more realistic view of their own maturity, which in itself can be seen as a growth in academic maturity.     

Generalization of Murty's direct algorithm to linear and convex quadratic programming

Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments.     

西部开发中能源配置模型的研究

开发西部丰富的能源资源,解决东部地区能源紧缺的矛盾,是东西部经济合作、优势互补、东西联动双赢战略研究的一项重要课题.在国家投资主体和市场经济条件下,以能源消费效益最大为目标,建立了基于边际效益均衡的能源空间配置优化模型;兼顾经济效益与环境效益的能源部门配置优化模型.结果显示,各地区、部门要获得更多的能源,就必须提高能源的使用效率,提高能源消费的边际效益,降低污染排放水平.     

Carathéodory's method for a class of dynamic games

The method of equivalent variational methods, originally due to Carathéodory for free problems in the calculus of variations is extended to investigate feedback Nash equilibria for a class of n-person differential games. Both the finite-horizon and infinite-horizon cases are considered. Examples are given to illustrate the presented results.     

Solving Problems with Min-Type Functions by Disjunctive Programming

We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency.     

Sensitivity analysis for discrete optimal control problems

We present local sensitivity analysis for discrete optimal control problems with varying endpoints in the case when the customary regularity of boundary conditions can be violated. We study the behavior of the optimal solutions subject to parametric perturbations of the problem.     

Maximizing a Linear Fractional Function on a Pareto Efficient Frontier

We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included.     

Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.     

Constraint Programming and Operations Research: Comments from an Operations Researcher

This paper relates the author's personal experience with constraint programming and gives a personal assessment of the relationships between constraint programming and operations research.     

最速下降规则不失为一可用规则

本从统计意义上平均迭代次数的观点出发，指出求解线性规划的最速下降规则是可取的，好用的。