The Experts below are selected from a list of 1275 Experts worldwide ranked by ideXlab platform

Iheme P. C. - One of the best experts on this subject based on the ideXlab platform.

  • Maximizing Procedures Covering Conduct of Examination in a Potential World Class University using Operational Research Technique
    2016
    Co-Authors: Agarana M. C., Owoloko E. A., Iheme P. C.
    Abstract:

    One of the good qualities of a world class university is their high standard examination procedures. This paper attempts to optimize the examination procedures in a potential world class university by minimizing the major variables: time, cost and human resources involved in the examination conduct. Covenant University, the best private university in Nigeria, is used as a case study. The examination procedures covering conduct of examination at Covenant University, were modelled as a linear programming with time, cost and human resources as our decision variables. The constraint, including the nonnegativity constraint, were carefully formed. The standard form of the model is solved using Simplex method with the aid of a computer software - LIP Solver, which was used to evaluate the feasible solutions from the Initial Tableau. It was observed that some of the decision variables such as time to correct examination questions and address examination misconducts must be deemphasized, while decision variables such as time to admit students into the examination hall and time to verify students’ identity in order to admit them into the examination hall should be given priority in order to optimize the resources related to the examination conduct at Covenant University

  • Maximizing Procedures Covering Conduct of Examination in a Potential World Class University using Operational Research Technique
    2016
    Co-Authors: Agarana M. C., Owoloko E. A., Iheme P. C.
    Abstract:

    One of the good qualities of a world class university is their high standard examination procedures. This paper attempts to optimize the examination procedures in a potential world class university by minimizing the major variables: time, cost and human resources involved in the examination conduct. Covenant University, the best private university in Nigeria, is used as a case study. The examination procedures covering conduct of examination at Covenant University, were modelled as a linear programming with time, cost and human resources as our decision variables. The constraint, including the nonnegativity constraint, were carefully formed. The standard form of the model is solved using Simplex method with the aid of a computer software - LIP Solver, which was used to evaluate the feasible solutions from the Initial Tableau. It was observed that some of the decision variables such as time to correct examination questions and address examination misconducts must be deemphasized, while decision variables such as time to admit students into the examination hall and time to verify students’ identity in order to admit them into the examination hall should be given priority in order to optimize the resources related to the examination conduct at Covenant University

Agarana M. C. - One of the best experts on this subject based on the ideXlab platform.

  • Maximizing Procedures Covering Conduct of Examination in a Potential World Class University using Operational Research Technique
    2016
    Co-Authors: Agarana M. C., Owoloko E. A., Iheme P. C.
    Abstract:

    One of the good qualities of a world class university is their high standard examination procedures. This paper attempts to optimize the examination procedures in a potential world class university by minimizing the major variables: time, cost and human resources involved in the examination conduct. Covenant University, the best private university in Nigeria, is used as a case study. The examination procedures covering conduct of examination at Covenant University, were modelled as a linear programming with time, cost and human resources as our decision variables. The constraint, including the nonnegativity constraint, were carefully formed. The standard form of the model is solved using Simplex method with the aid of a computer software - LIP Solver, which was used to evaluate the feasible solutions from the Initial Tableau. It was observed that some of the decision variables such as time to correct examination questions and address examination misconducts must be deemphasized, while decision variables such as time to admit students into the examination hall and time to verify students’ identity in order to admit them into the examination hall should be given priority in order to optimize the resources related to the examination conduct at Covenant University

  • Maximizing Procedures Covering Conduct of Examination in a Potential World Class University using Operational Research Technique
    2016
    Co-Authors: Agarana M. C., Owoloko E. A., Iheme P. C.
    Abstract:

    One of the good qualities of a world class university is their high standard examination procedures. This paper attempts to optimize the examination procedures in a potential world class university by minimizing the major variables: time, cost and human resources involved in the examination conduct. Covenant University, the best private university in Nigeria, is used as a case study. The examination procedures covering conduct of examination at Covenant University, were modelled as a linear programming with time, cost and human resources as our decision variables. The constraint, including the nonnegativity constraint, were carefully formed. The standard form of the model is solved using Simplex method with the aid of a computer software - LIP Solver, which was used to evaluate the feasible solutions from the Initial Tableau. It was observed that some of the decision variables such as time to correct examination questions and address examination misconducts must be deemphasized, while decision variables such as time to admit students into the examination hall and time to verify students’ identity in order to admit them into the examination hall should be given priority in order to optimize the resources related to the examination conduct at Covenant University

Owoloko E. A. - One of the best experts on this subject based on the ideXlab platform.

  • Maximizing Procedures Covering Conduct of Examination in a Potential World Class University using Operational Research Technique
    2016
    Co-Authors: Agarana M. C., Owoloko E. A., Iheme P. C.
    Abstract:

    One of the good qualities of a world class university is their high standard examination procedures. This paper attempts to optimize the examination procedures in a potential world class university by minimizing the major variables: time, cost and human resources involved in the examination conduct. Covenant University, the best private university in Nigeria, is used as a case study. The examination procedures covering conduct of examination at Covenant University, were modelled as a linear programming with time, cost and human resources as our decision variables. The constraint, including the nonnegativity constraint, were carefully formed. The standard form of the model is solved using Simplex method with the aid of a computer software - LIP Solver, which was used to evaluate the feasible solutions from the Initial Tableau. It was observed that some of the decision variables such as time to correct examination questions and address examination misconducts must be deemphasized, while decision variables such as time to admit students into the examination hall and time to verify students’ identity in order to admit them into the examination hall should be given priority in order to optimize the resources related to the examination conduct at Covenant University

  • Maximizing Procedures Covering Conduct of Examination in a Potential World Class University using Operational Research Technique
    2016
    Co-Authors: Agarana M. C., Owoloko E. A., Iheme P. C.
    Abstract:

    One of the good qualities of a world class university is their high standard examination procedures. This paper attempts to optimize the examination procedures in a potential world class university by minimizing the major variables: time, cost and human resources involved in the examination conduct. Covenant University, the best private university in Nigeria, is used as a case study. The examination procedures covering conduct of examination at Covenant University, were modelled as a linear programming with time, cost and human resources as our decision variables. The constraint, including the nonnegativity constraint, were carefully formed. The standard form of the model is solved using Simplex method with the aid of a computer software - LIP Solver, which was used to evaluate the feasible solutions from the Initial Tableau. It was observed that some of the decision variables such as time to correct examination questions and address examination misconducts must be deemphasized, while decision variables such as time to admit students into the examination hall and time to verify students’ identity in order to admit them into the examination hall should be given priority in order to optimize the resources related to the examination conduct at Covenant University

Wayne Wolfe - One of the best experts on this subject based on the ideXlab platform.

  • SOUTHERN JOURNAL OF AGRICULTURAL ECONOMICS DECEMBER, 1986 A MICROCOMPUTER PACKAGE TO TEACH THE SIMPLEX ALGORITHM
    2015
    Co-Authors: Richard Beilock, Catherine Correal, Evan Drummond, Jim Pheasant, Wayne Wolfe
    Abstract:

    PHILOSOPHY FOR BCDPBasic features of a microcomputer package, BCDP, which is an auto-tutorial designed to The impetus for creating BCDP was the teach the Simplex algorithm are described. observation that classroom and textbook ex-The package may be used to augment lecture planations of the Simplex Algorithm are often and text materials in introductory linear pro- difficult for students to grasp. This is truegramming courses or as a review for advanced both with respect to understanding the cor-math programming courses. Preliminary eval- respondence between geometric and math-uations of the effectiveness of the program ematical representations of LP problems and to augment classroom instruction are very to mastering the mechanics necessary to positive. achieve a solution. Key words: linear programming simplex A classic example of such problems is the K rdsc lnear progr instu sim, confusion which often attends learning thecomputer aided instruction. concept of a shadow price. Suppose that you Linear programming (LP) is one of the are paid $35 per unit for corn silage and $50 primary tools of agricultural economists and per unit for alfalfa. In the Initial Tableau, it several other disciplines. Major universities is relatively easy to believe that the shado

Gerald L Thompson - One of the best experts on this subject based on the ideXlab platform.

  • an integral simplex algorithm for solving combinatorial optimization problems
    Computational Optimization and Applications, 2002
    Co-Authors: Gerald L Thompson
    Abstract:

    In this paper a local integral simplex algorithm will be described which, starting with the Initial Tableau of a set partitioning problem, makes pivots using the pivot on one rule until no more such pivots are possible because a local optimum has been found. If the local optimum is also a global optimum the process stops. Otherwise, a global integral simplex algorithm creates and solves the problems in a search tree consisting of a polynomial number of subproblems, subproblems of subproblems, etc. The solution to at least one of these subproblems is guaranteed to be an optimal solution to the original problem. If that solution has a bounded objective then it is an optimal set partitioning solution of the original problem, but if it has an unbounded objective then the original problem has no feasible solution. It will be shown that the total number of pivots required for the global integral simplex method to solve a set partitioning problem having m rows, where m is an arbitrary but fixed positive integer, is bounded by a polynomial function of n. A method for programming the algorithms in this paper to run on parallel computers is discussed briefly.