Skip to content. Skip to main navigation.

Profiles

avatar
Professor at Industrial & Manufacturing Systems Engineering
500 West First Street, Arlington, TX

Dr. Corley has worked for both aerospace divisions of IBM and McDonnell Douglas in the Cape Kennedy area, after which he obtained a Ph.D. in systems engineering from  the University of Florida. His expertise includes optimization, decision theory, statistics, network analysis, game theory, fuzzy sets, and stochastic processes, as well as discrete and abstract mathematics. He has developed abstract optimization theories for set-valued functions and for functions whose variables are sets. He has defined the notion of multivariate order statistics, discovered a general family of recursive probability distributions subsuming various standard discrete ones, and established a new type of hybrid fixed-point theorem. He has studied games with vector payoffs, applied multiple criteria to network analysis, and contributed to the theory of fuzzy logic, including the validity of deduction over time. In addition, he has modeled connectivity in scientific and social phenomena with the analytical construction of "small-world" networks. Other work in network theory has been utilized by the U.S. Department of Defense. He has recently developed some constraint selection techniques for linear programming, which appear to be the most efficient solution method for the large-scale problems needed to solve approximate linear models of nonlinear mathematical systems. In addition, he has defined new cooperative equilibria in game theory to address unresolved issues.

The University of Texas at Arlington
Ph.D. Mathematics
The University of Florida
Ph.D.
Systems Engineering
Georgia Institute of Technology
M.S.
Information Science (theoretical computer science)
Georgia Institute of Technology
B.S.
Electrical Engineering
January 1971
Ongoing
Professor
The University of Texas at Arlington
January 1968
January 1969
System Engineer
McDonnell Douglas Astronautics Company
January 1966
January 1967
Systems Engineer
IBM, Federal Systems Division, Cape Canaveral, Florida
September 2010
Ongoing
Membership
IIE (Institute of Industrial Engineers)
September 2001
Ongoing
Membership
ASCE (American Society for Engineering Education)
September 1977
Ongoing
Professional
Texas
May 1972
Ongoing
Membership
INFORMS (Institute for Operations Research and the Management Sciences)
January 2015

A research paper by Industrial, Manufacturing and Systems Engineering professors Bill Corley and Jay Rosenberger has showed that an innovative method can be used to solve a broad class of real-world decision problems that had previously been unsolvable. The paper appeared January 15, 2015, in the journal Applied Mathematics and Computation and is available for download at ScienceDirect. Entitled “Constrained Optimal Selection Techniques (COSTs) for Nonnegative Linear Programming Problems,” it outlines how Corley and Rosenberger’s patented COST approach reduces the number of calculations in solving linear programming problems to obtain solutions many times faster than existing methods for large decision problems with huge numbers of mathematical variables and constraints. In particular, the COST approach can solve linear programming problems in minutes that are too large for the existing standard methods to solve at all.

Expertise

Optimization

Systems Modeling

Decision Theory

Statistics

Network Analysis

Game Theory

Fuzzy Sets

Stochastic Processes

Discrete & Abstract Mathematics

Research

Dr. Corley's expertise includes optimization, decision theory, statistics, network analysis, game theory, fuzzy sets, and stochastic processes, as well as discrete and abstract mathematics. He has developed abstract optimization theories for set-valued functions and for functions whose variables are sets. He has defined the notion of multivariate order statistics, discovered a general family of recursive probability distributions subsuming various standard discrete ones, and established a new type of hybrid fixed-point theorem. He has studied games with vector payoffs, applied multiple criteria to network analysis, and contributed to the theory of fuzzy logic, including the validity of deduction over time. In addition, he has modeled connectivity in scientific and social phenomena with the analytical construction of "small-world" networks. Other work in network theory has been utilized by the U.S. Department of Defense.

Dr. Corley has recently developed some constraint selection techniques for linear programming, which appear to be the most efficient solution method for the large-scale problems needed to solve approximate linear models of nonlinear mathematical systems. In addition, he has defined new equilibria in game theory to address current unresolved issues and to model certain phenomena in physics.

Dr.Corley is co-founder of COSMOS (Center on Stochastic Modeling, Optimization, & Statistics). He also originated,  coordinated, and sponsored the annual Dirty Dozen Puzzle Scholarship Contest for engineering majors from 2000 - 2013.

2015
An Algorithm for All Computing Berge Equilibria, H.W. Corley and Phantipa Kwain, Game Theory, Vol. 2015, 2015, 1-2.  
Journal Article
Published
2015
Constraint Optimal Selection Techniques (COSTs) for Nonnegative Linear Programming Problems, Goh Saito, H.W. Corley, Jay Rosenberger, Alireza Noroziroshan, and T.-K. Sung, Applied Mathematics and Computation, Vol. 251, 2015, 586-598.
Journal Article
Published
2014
Divergence Behavior of the Successive Geometric Mean (SGM) Method of Pairwise Comparison Matrix Generation for a Multiple Stage, Multiple Objective Optimization Problem, P.K. Tarun, V. C. P. Chen, H. W. Corley, Journal of Multi-Criteria Decision Analysis, Vol. 21, 2014, 197-208.
Journal Article
Published
2014
A Framework for Optimizing the Use of Systems Engineering on Proposals, Clement Smartt, Susan Ferreira, Jay Rosenberger and H.W. Corley, Procedia Computer Science, Vol. 28, 2014, 120-129.
Journal Article
Published
2014
A Cooperative Dual to the Nash Equilibrium, H.W. Corley and Phantipa Kwain, Journal of Applied Mathematics, Vol. 2014, 2014, 1-4.
Journal Article
Published
2014
A Scalar Compromise Equilibrium for N-Person Games, H.W. Corley, Surachai Charoensri, Narakorn Engsuwan, Natural Science: Special Issue on Game Theory, Vol. 6, 2014, 1103-1107.
Journal Article
Published
2013
Defining and Addressing the Risk of Undesirable Emergent Properties , S. Ferreira, M. Faezipour, and H.W. Corley, 2013 IEEE International Systems Conference (SysCon), Orlando, FL, 173-178, April, 2013.
Conference Proceeding
Published
2013
Constraint Optimal Selection Techniques (COSTs) for Linear Programming, Goh Saito, H.W. Corley, and Jay Rosenberger, American Journal of Operations Research, Vol. 3, 2013, 53-64.
Journal Article
Published
2012
2012 Dirty Dozen Contest Puzzles, H.W. Corley, College of Engineering, UT Arlington, February, 2012. Published (Book Chapter)
Book Chapter
Published
2012
Neural Network for Detecting Cyclic Behavior in Autocorrelated Processes, Ussanee Purintrapiban and H.W. Corley, Computers & Industrial Engineering, Vol. 62, 2012, 1093 – 1108.
Journal Article
Published
2011
Optimizing Selection of Technologies in a Multiple Stage, P.K. Tarun, V. C. P. Chen, H. W. Corley, and F. Jiang. Journal of Multi-Criteria Decision Analysis, Vol. 18, 2011, 115-142.
Journal Article
Published
2011
2011 Dirty Dozen Contest Puzzles, H.W. Corley, College of Engineering, UT Arlington, February, 2011. Book Chapter.
Book Chapter
Published
2010
2010 Dirty Dozen Contest Puzzles, H.W. Corley, College of Engineering, UT Arlington, February, 2010. Book Chapter.
Book Chapter
Published
2009
2009 Dirty Dozen Contest Puzzles, H.W. Corley, College of Engineering, UT Arlington, February, 2009. Book Chapter.
Book Chapter
Published
2009
H. W. Corley and S. B. Kim. "A Recursive Family of Discrete Distributions with a Normality Conjecture," Oriental Journal of Mathematics, vol. 1, pp. 63-79, 2009.
Journal Article
Published
2009
W. C. Yeh and H. W. Corley. "A Simple Direct Cosine Simplex Algorithm," Applied Mathematics and Computation, vol. 214, pp. 178-186, 2009.
Journal Article
Published
2009
M. S. Sahni, H. W. Corley, and G. Bei. "Application of the HHI in a Probabilistic Framework for a Parametric Approach to Determine Possible Market Power," in Proceedings of the IEEE PES Power Systems Conference, 2009 (Seattle, WA, 2009), pp. 1-8.
Conference Proceeding
Published
2008
P. K. Tarun, V. C. P. Chen, and H. W. Corley. "Incorporating Decision Makers’ Inputs in a Dynamic Multistage Multiobjective Model," in Proceedings of the 2008 IE Research Conference (Vancouver, BC, Canada, 2008).
Conference Proceeding
Published
2008
2008 Dirty Dozen Contest Puzzles, H.W. Corley, College of Engineering, UT Arlington, February, 2008. Book Chapter.
Book Chapter
Published
2007
P. K. Tarun, V. C. P. Chen, and H. W. Corley. "A Dynamic Multiple Stage, Multiple Objective Optimization Model," in Proceedings of the 2007 IE Research Conference (Nashville, TN, 2007).
Conference Proceeding
Published
2007
2007 Dirty Dozen Contest Puzzles, H.W. Corley, College of Engineering, UT Arlington, February, 2007. Book Chapter.
Book Chapter
Published
2007
Chung, K. F., Corley, H. W., & Tarun, P. K. (2007). A Dynamic Programming Approach to the Design of Composite Aircraft Wings. The University of Texas at Arlington, Arlington, TX: COSMOS Technical Report 07-03.
Technical Report
Published
2006
H. W. Corley, J. Rosenberger, T. K. Sung, and W. C. Yeh. "The Cosine Simplex Algorithm," International Journal of Advanced Manufacturing Technology, vol. 27, pp. 1047-1050, 2006.
Journal Article
Published
2006
2006 Dirty Dozen Contest Puzzles, H.W. Corley, College of Engineering, UT Arlington, February, 2006. Book Chapter.
Book Chapter
Published
2005
J. Rosenberger and H. W. Corley. "Mathematical Programming Models for Some Smallest-World Problems," Nonlinear Analysis: Real World Applications, vol. 6, pp. 955-961, 2005.
Journal Article
Published
2005
2005 Dirty Dozen Contest Puzzles, H.W. Corley, College of Engineering, UT Arlington, February, 2005. Book Chapter.
Book Chapter
Under Review
2004
2004 Dirty Dozen Contest Puzzles, H.W. Corley, College of Engineering, UT Arlington, February, 2004. Book Chapter.
Book Chapter
Published
2004
Rosenberger, J. & Corley, H. W. (2004). A Branch-and-Price Method for Solving the Smallest-World Problem. The University of Texas at Arlington: COSMOS Technical Report 04-01.
Technical Report
Published
2004
Rosenberger, J. M. & Corley, H. W. (2004). A Geormetric Active-Set Extension of the Simplex Method. The University of Texas at Arlington: COSMOS Technical Report 04-07.
Technical Report
Published
2003
H. W. Corley. "Playing at Engineering Education: the Dirty Dozen Puzzle Contest," presented at Proceedings of the 2003 ASEE Gulf-Southwest Annual Conference, March 2003.
Conference Paper
Published
2003
2003 Dirty Dozen Contest Puzzles, H.W. Corley, College of Engineering, UT Arlington, February, 2003. Book Chapter.
Book Chapter
Published
2002
2002 Dirty Dozen Contest Puzzles, H.W. Corley, College of Engineering, UT Arlington, February, 2002. Book Chapter.
Book Chapter
Published
2001
2001 Dirty Dozen Contest Puzzles, H.W. Corley, College of Engineering, UT Arlington, February, 2001. Book Chapter.
Book Chapter
Submitted
2000
2000 Dirty Dozen Contest Puzzles, H.W. Corley, College of Engineering, UT Arlington, February, 2000. Book Chapter.
Book Chapter
Published
1999
C. Temponi, F. Fard, and H. W. Corley. "A Fuzzy Decision Model for Color Reproduction," International Journal in Production Economics, vol. 58, pp. 31-37, 1999.
Journal Article
Published
1998
C. Temponi, F. Fard, and H. W. Corley. "A Fuzzy Neural Architecture for Customer Satisfaction Assessment," presented at Prceedings of the North American Fuzzy Information Processing Society, University of South Florida, Tampa, 1998.
Conference Paper
Published
1996
C. Temponi, Y. K. Kuo, and H. W. Corley. "Customer Satisfaction Assessment through a Fuzzy Neural Controller," presented at Proceedings of the North American Fuzzy Information Processing Society, 30th Anniversary Issue, University of California, Berkeley, June 1996.
Conference Paper
Published
1992
W. C. Yeh and H. W. Corley. "A Polynomial Algorithm for the Planar k-Cut Problem," presented at Proceedings of the 1992 CIIE National Conference, 1992.
Conference Paper
Published
1992
W. Pei and H. W. Corley. "Membership Functions for Indexed Fuzzy Control in an Oil Refinery," presented at Proceedings of the Second International Workshop in Industrial Fuzzy Control and Intelligent Systems, Texas A&M University, 1992.
Conference Paper
Published
1989
H. W. Corley. "The Convolved Fibonacci Equation," The Fibonacci Quarterly, vol. 27, pp. 283-284, 1989.
Journal Article
Published
1988
H. W. Corley. "Optimality Conditions for Maximizations of Set-Valued Functions," Journal of Optimization Theory and Applications, vol. 58, pp. 1-10, 1988.
Journal Article
Published
1987
H. W. Corley. "Existence and Lagrangian Duality for Maximizations of Set-Valued Functions," Journal of Optimization Theory and Applications, vol. 54, pp. 489-501, 1987.
Journal Article
Published
1987
H. W. Corley. "Optimization of n-Set Functions," Journal of Mathematical Analysis and Applications, vol. 127, pp. 193-205, 1987.
Journal Article
Published
1986
H. W. Corley. "Some Hybrid Fixed Point Theorems Related to Optimization," Journal of Mathematical Analysis and Applications, vol. 120, pp. 528-532, 1986.
Journal Article
Published
1985
H. W. Corley. "Some Multiple Objective Dynamic Programs," IEEE Transactions on Automatic Control, vol. AC-30, pp. 1221-1222, 1985.
Journal Article
Published
1985
H. W. Corley. "Games with Vectors Payoffs," Journal of Optimization Theory and Applications, vol. 47, pp. 489-496, 1985.
Journal Article
Published
1985
H. W. Corley. "On Optimality Conditions for Maximizations with Respect to Cones," Journal of Optimization Theory and Applications, vol. 46, pp. 67-78, 1985.
Journal Article
Published
1985
H. W. Corley. "Efficient Spanning Trees," Journal of Optimization Theory and Applications, vol. 45, pp. 481-485, 1985.
Journal Article
Published
1985
H. W. Corley and I. D. Moon. "Shortest Paths in Networks with Vector Weights," Journal of Optimization Theory and Applications, vol. 46, pp. 79-86, 1985.
Journal Article
Published
1984
H. W. Corley. "Duality Theory for the Matrix Linear Programming Problem," Journal of Mathematical Analysis and Application, vol. 104, pp. 47-52, 1984.
Journal Article
Published
1984
H. W. Corley. "Multivariate Order Statistics," Communications in Statistics: Theory and Methods, vol. 13, pp. 1299-1304, 1984.
Journal Article
Published
1983
Corley, H. W. "Maximizations with Respect to Cones." Mathematical Modeling in Science and Technology IV, 196-201. Pergamon Press, 1983.
Book Chapter
Published
1983
H. W. Corley and H. Golnabi. "Minimax Trees, Paths, and Cut Sets," Naval Research Logistics Quarterly, vol. 30, pp. 665-666, 1983.
Journal Article
Published
1982
H. W. Corley and D. Sha. "Most Vital Links and Nodes in Weighted Networks," Operations Research Letters, vol. 1, pp. 157-160, 1982.
Journal Article
Published
1982
H. W. Corley. "A Generalized Bottleneck Assignment Problem," Journal of Optimization Theory and Applications, vol. 26, pp. 135-138, 1982.
Journal Article
Published
1981
H. W. Corley. "Duality Theory for Maximizations with Respect to Cones," Journal of Mathematical Analysis and Applications, vol. 84, pp. 560-568, 1981.
Journal Article
Published
1981
H. W. Corley. "A Fixed Point Interpretation of Pareto Optimization," IEEE Transactions on Automatic Control, vol. 46, pp. 766-767, 1981.
Journal Article
Published
1980
H. W. Corley. "A New Scalar Equivalence for Pareto Optimization," IEEE Transactions on Automatic Control, vol. AC-25, pp. 829-830, 1980.
Journal Article
Published
1980
H. W. Corley. "An Existence Result for Maximizations with Respect to Cones," Journal of Optimization Theory and Applications, vol. 31, pp. 277-281, 1980.
Journal Article
Published
1975
H. W. Corley. "Optimal Set Partitioning," Collective Phenomena and the Applications of Physics to Other Fields of Science, N. Chigier and E. Stern, Eds., 1975, pp. 168-177.
Book Chapter
Published
1974
H. W. Corley and H. Chang. "Finding the n Most Vital Nodes in a Flow Network," Management Science, vol. 21, pp. 362-364, 1974.
Journal Article
Published
1972
H. W. Corley. "Duality Relationships for a Partitioning Problem," SIAM Journal of Applied Mathematics, vol. 23, pp. 490-494, 1972.
Journal Article
Published
1972
H. W. Corley and S. D. Roberts. "A Partitioning Problem with Applications in Regional Design," Operations Research, vol. 20, pp. 1010-1019, 1972.
Journal Article
Published
A Non-Nash Equilibrium for Noncooperative Games, H.W. Corley and P. Insuwan, INFORMS 2007 Annual Meeting, Seattle, WA, November 2007.
Uncategorized
A Recursive Family of Discrete Univariate Distributions, H.W. Corley and S.B. Kim, INFORMS 2007 Annual Meeting, Seattle WA, November, 2007.
Uncategorized
A Sequential Response Surface Methodology for the Aircraft Rotation Problem, S. Visoldilokpun, Jay Rosenberger, V.C.P Chen, H.W. Corley, S.B. Kim INFORMS 2006 Annual Meeting, Pittsburg, PA, November, 2006.
Uncategorized
Constraint Optimal Selection Techniques (COSTs) for Large-Scale Linear Programming Problem, H.W. Corley, Jay Rosenberger, T.-K. Sung, INFORMS 2006 Annual Meeting, Pittsburg, PA, November, 2006
Uncategorized
New Non-Nash Equilibria for Noncooperative Games, H.W. Corley, Fifth World Congress of Nonlinear Analysts, Orlando, FL, July, 2008.
Uncategorized
A Non-Nash Equilibrium for Noncooperative Games, H.W. Corley and P. Insuwan, INFORMS 2008 Annual Meeting, Washington, DC, November 2008.
Uncategorized
Application of Three-phase Methodology on the Multistage Multiobjective Wastewater Treatment System, P.K. Tarun, V.C.P Chen, H.W. Corley, INFORMS 2008 Annual Meeting, Washington, DC, November, 2008.
Uncategorized
Incorporating Decision Makers’ Inputs in a Dynamic Multistage Multiobjective Model, P.K. Tarun, V.C.P. Chen, H.W. Corley, IE Research Conference, Vancouver, Canada, April, 2008.
Uncategorized
Application of the HHI in a Probabilistic Framework for a Parametric Approach to Determine Possible Market Power, M.S. Sahni, H.W. Corley, Gou Bei, IEEE PES Power Systems Conference, March 15- 18, 2009.
Uncategorized
Constraint Optimal Selection Techniques (COSTs) for Linear Programming, H.W. Corley, Jay Rosenberger, Goh Saito, INFORMS 2010 Annual Meeting, Austin, TX, November, 2010.
Uncategorized
Divergence of Pairwise Comparison Matrices Computed using the Successive Geometric Mean (SGM) Method, P.K. Tarun, V.C.P. Chen, H.W. Corley, INFORMS 2010 Annual Meeting, Austin, TX, November, 2010.
Uncategorized
The Scalar Equivalence of Optimization Criteria, Surachai Charoensri, H.W. Corley, INFORMS 2010 Annual Meeting, Austin, TX, November, 2010.
Uncategorized
Beyond the Nash Equilibrium, H.W. Corley, INFORMS 2012 Annual Meeting, Phoenix, AZ, October, 2012.
Uncategorized
• The Scalar Equivalence of Optimization Criteria, Surachai Charoensri, H.W. Corley, INFORMS 2011 Annual Meeting, Charlotte, NC, November, 2011.
Uncategorized
January 2007 -
January 2008
TXU Emissions
$100,000
January 2004 -
December 2004
A New Commercial Algorithm for Linear Programming
$28,800
February 2015
• U.S. Patent No. 8,082,549 System, Method and Apparatus for Allocating Resources by Constraint Selection

An active-set, cutting-plane approach called Constraint Optimal Selection Techniques (COSTs) is proposed  for solving a large-scale linear programming problem P. A COST solves an initial linear programiming problem P0 with a single constraint and then a series of relaxations Pr, r=1,2,…, of P0 by adding constraints from P to the previous relaxation. The constraints of Pr are called its operative constraints, while the rest of the constraints are called inoperative constraints. Since the constraints are chosen to form a bounded region, each problem Pr yields an optimal solution xr∗. A relaxed problem Pr+1 is obtained from Pr by adding one or more constraints chosen from the violated inoperative constraints of Pr, i.e., a constraint violated by xr∗. These constraints are selected according to a particular criterion such that the chosen violated inoperative constraints are considered most likely to be binding at optimality for the original problem P. Pr+1 is then solved with the dual simplex algorithm. By continuing in this manner, eventually a solution xr∗ is obtained that satisfies all inoperative constraints for Pr and yields a solution of P. The rationale for any such active-set approach is that a solution to P is determined by relatively few constraints satisfied as equalities — at most n such constraints for the n variables in constraint set. Therefore, the goal is to add only constraints likely to be binding at optimality. Some such COSTs are more than an order of magnitude faster than faster than existing linear programming methods.

Spring 2015
IE 3315 - Operations Research I
Office Hours
DayStartEnd
Monday2:00PM3:00PM
Tuesday2:00PM3:00PM
Thursday2:00PM3:00PM
An introduction to the major deterministic techniques of operations research and their application to decision problems. These techniques include linear programming, integer programming, network analysis, dynamic programming, and nonlinear programming. Course software is used.
Last Updated on January 14, 2015, 4:09 pm
No Documents Attached
Spring 2015
IE 5301 - ADVANCED OPERATIONS RESEARCH
Office Hours
DayStartEnd
Monday2:00PM3:00PM
Tuesday2:00PM3:00PM
Thursday2:00PM3:00PM
A survey of quantitative methods to develop modeling and decision-making skills. Topics include linear programming, the simplex and dual simplex algorithms, integer programming, transportation and assignment problems, goal programming, nonlinear programming, network analysis, decision trees, game theory, Markov chains, and queueing theory.
Last Updated on January 14, 2015, 4:12 pm
No Documents Attached
Spring 2015
IE 5307 - Queueing Theory
Office Hours
DayStartEnd
Monday2:00PM3:00PM
Tuesday2:00PM3:00PM
Thursday2:00PM3:00PM
A survey of quantitative methods to develop modeling and decision-making skills. Topics include linear programming, the simplex and dual simplex algorithms, integer programming, transportation and assignment problems, goal programming, nonlinear programming, network analysis, decision trees, game theory, Markov chains, and queueing theory.
Last Updated on January 14, 2015, 4:18 pm
No Documents Attached
Fall 2014
IE 4315 - Operations Research II
Office Hours
DayStartEnd
Monday1:00PM2:00PM
Tuesday3:30PM5:00PM
Thursday3:30PM5:00PM
A continuation of IE 3315 to probabilistic techniques of operations research and their application to decision models. Topics include z-transforms, linear difference equations, Markov chains, game theory, decision analysis, queuing theory, and non-quantitative aspects of decisions. Group projects are required. Prerequisite: IE 3301, IE 3315, and MATH 3319 (or concurrent enrollment).
Last Updated on August 5, 2014, 9:41 am
No Documents Attached
Fall 2014
IE 5301 - Advanced Operations Research
Office Hours
DayStartEnd
Monday1:00PM2:00PM
Tuesday3:30PM5:00PM
Thursday3:30PM5:00PM
A survey of quantitative methods to develop modeling and decision-making skills. Topics include linear programming, goal programming, the simplex and dual simplex algorithms, transportation and assignment problems, integer programming, network analysis, nonlinear programming, decision trees, Markov Chains, and queuing theory. Prerequisite: IE 3301 or IE 5317 or equivalent.
Last Updated on August 5, 2014, 9:43 am
No Documents Attached
Fall 2014
IE 5311 - Decision Analysis
Office Hours
DayStartEnd
Monday1:00PM2:00PM
Tuesday3:30PM5:00PM
Thursday3:30PM5:00PM
A survey of methods for making optimal decisions. Topics include decision models, formal logic, fuzzy controls, statistical decision theory, game theory, multiobjective decisions, stochastic programming, information theory and qualitative aspects of the decisions. Prerequisites: IE 5301 or concurrent.
Last Updated on August 5, 2014, 9:46 am
No Documents Attached
Summer 2014
IE 5301 - Advanced Operations Research
Office Hours
DayStartEnd
Thursday11:00AM1:00PM
A survey of quantitative methods to develop modeling and decision-making skills. Topics include z-transforms and difference equations, Markov Chains, decision analysis techniques, goal programming, game theory, queuing theory and nonlinear programming.
Last Updated on June 11, 2014, 9:34 am
No Documents Attached
Spring 2014
IE 5301 - Advanced Operations Research
Office Hours
DayStartEnd
Monday2:00PM4:00PM
Wednesday2:00PM4:00PM
A survey of quantitative methods to develop modeling and decision-making skills. Topics include z-transforms and difference equations, Markov Chains, decision analysis techniques, goal programming, game theory, queuing theory and nonlinear programming.
Last Updated on December 20, 2013, 2:17 pm
No Documents Attached
Spring 2014
IE 5309 - Stochastic Processes
Office Hours
DayStartEnd
Monday2:00PM4:00PM
Wednesday2:00PM4:00PM
The study of probabilistic model building including the fundamentals of both discrete and continuous Markov chains, queueing theory and renewal theory.
Last Updated on December 20, 2013, 2:28 pm
No Documents Attached
Fall 2013
IE 4315 - Operations Research II
A continuation of IE 3315 to probabilistic techniques of operations research and their application to decision models. Topics include z-transforms, linear difference equations, Markov chains, game theory, decision analysis, queuing theory, and non-quantitative aspects of decisions. Group projects are required.
Last Updated on August 12, 2013, 1:27 pm
No Documents Attached
Fall 2013
IE 5306 - Ie 5306-001
Dynamic optimization methods including dynamic programming, the calculus of variations, and optimal control theory. Emphasis is on the modeling and solution of practical problems using these techniques.
Last Updated on August 12, 2013, 1:32 pm
No Documents Attached
Spring 2013
IE 5306 - Ie 5306-001
Dynamic optimization methods including dynamic programming, the calculus of variations, and optimal control theory. Emphasis is on the modeling and solution of practical problems using these techniques.
Last Updated on July 25, 2013, 3:47 pm
No Documents Attached
Spring 2013
IE 5307 - Queueing Theory
The fundamentals of queueing theory including Markovian birth-death models, networks of queues, and general arrival and service distributions. Prerequisites: IE 3301 or IE 5317, or equivalent.
Last Updated on May 12, 2013, 1:24 pm
No Documents Attached
Spring 2013
IE 5301 - ADVANCED OPERATIONS RESEARCH
A survey of quantitative methods to develop modeling and decision-making skills. Topics include z-transforms and difference equations, Markov Chains, decision analysis techniques, goal programming, game theory, queuing theory and nonlinear programming. Prerequisites: Both IE 3301 and IE 3315 OR IE 5317 or equivalent.
Last Updated on May 12, 2013, 1:24 pm
No Documents Attached
Fall 2012
IE 3315 - Operations Research
Introduction to the major deterministic techniques of operations research and their application to decision problems. Linear programming, integer programming, network analysis, dynamic programming, nonlinear programming. Course software is used. Project required. Prerequisite: IE 3301 or concurrent enrollment and MATH 2326.
Last Updated on May 12, 2013, 1:24 pm
No Documents Attached
Fall 2012
IE 4315 - OPERATIONS RESEARCH II
A continuation of IE 3315 to probabilistic techniques of operations research and their application to decision models. Topics include z-transforms, linear difference equations, Markov chains, game theory, decision analysis, queuing theory, and non-quantitative aspects of decisions. Group projects are required. Prerequisite: IE 3301, IE 3315, and MATH 3319 (or concurrent enrollment).
Last Updated on May 12, 2013, 1:24 pm
No Documents Attached
Fall 2012
IE 5311 - Decision Analysis
A survey of methods for making optimal decisions. Topics include decision models, formal logic, fuzzy controls, statistical decision theory, game theory, multiobjective decisions, stochastic programming, information theory and qualitative aspects of the decisions. Prerequisites: IE 5301 or concurrent.
Last Updated on May 12, 2013, 1:24 pm
No Documents Attached
Summer 2012
IE 3315 - Operations Research
IE 3315 OPERATIONS RESEARCH I (3-0) Introduction to the major deterministic techniques of operations research and their application to decision problems. Linear programming, integer programming, network analysis, dynamic programming, nonlinear programming. Course software is used. Project required. Prerequisite: IE 3301 or concurrent enrollment and MATH 2326.
No Syllabus Attached!
No Documents Attached
Summer 2012
IE 5301 - ADVANCED OPERATIONS RESEARCH
Description: A survey of quantitative methods to develop modeling and decision-making skills. Topics include z-transforms and difference equations, Markov Chains, decision analysis techniques, goal programming, game theory, queuing theory and nonlinear programming. Prerequisites: IE 3301 and IE 3315, or IE 5317, or equivalent.
No Syllabus Attached!
No Documents Attached
Spring 2012
IE 5309 - Stochastic Processes
The study of probabilistic model building including the fundamentals of both discrete and continuous Markov chains, queueing theory and renewal theory. Prerequisites: IE 3301 or IE 5317, or equivalent.
No Syllabus Attached!
No Documents Attached
Spring 2012
IE 3315 - Operations Research
Introduction to the major deterministic techniques of operations research and their application to decision problems. Linear programming, integer programming, network analysis, dynamic programming, nonlinear programming. Course software is used. Project required. Prerequisite: IE 3301 or concurrent enrollment and MATH 2326.
No Syllabus Attached!
No Documents Attached
Spring 2012
IE 5332 - Nonlinear Programming
Methods for nonlinear optimization including classical theory; gradient methods; sequential unconstrained methods; convex programming; genetic algorithms; simulated annealing; and separable, quadratic, and geometric programming. Prerequisite: graduate standing.
No Syllabus Attached!
No Documents Attached
Fall 2011
IE 3315 - Operations Research
Description: Introduction to the major deterministic techniques of operations research and their application to decision problems. Linear programming, integer programming, network analysis, dynamic programming, nonlinear programming. Course software is used. Prerequisite: IE 3301 or concurrent enrollment and MATH 2326.
No Syllabus Attached!
No Documents Attached
Fall 2011
IE 4315 - OPERATIONS RESEARCH II
Description: A continuation of IE 3315 to probabilistic techniques of operations research and their application to decision models. Topics include z-transforms, linear difference equations, Markov chains, game theory, decision analysis, queuing theory, and non-quantitative aspects of decisions. Group projects are required. Prerequisite: IE 3301, IE 3315, and MATH 3319 (or concurrent enrollment).
No Syllabus Attached!
No Documents Attached
Fall 2011
IE 5306 - Dynamic Optimization
Description: Dynamic optimization methods including dynamic programming, the calculus of variations, and optimal control theory. Emphasis is on the modeling and solution of practical problems using these techniques. Prerequisites: IE 3301 and IE 3315, or equivalent.
No Syllabus Attached!
No Documents Attached
Fall 2011
IE 5306 - Dynamic Optimization
Description: Dynamic optimization methods including dynamic programming, the calculus of variations, and optimal control theory. Emphasis is on the modeling and solution of practical problems using these techniques. Prerequisites: IE 3301 and IE 3315, or equivalent.
No Syllabus Attached!
No Documents Attached
Summer 2011
IE 5307 - Queueing Theory
Description: The fundamentals of queueing theory including Markovian birth-death models, networks of queues, and general arrival and service distributions. Prerequisites: IE 3301 or equivalent.
No Syllabus Attached!
No Documents Attached
Summer 2011
IE 5301 - ADVANCED OPERATIONS RESEARCH
Description: A survey of quantitative methods to develop modeling and decision-making skills. Topics include z-transforms and difference equations, Markov Chains, decision analysis techniques, goal programming, game theory, queuing theory and nonlinear programming. Prerequisites: IE 3301 and IE 3315, or IE 5317, or equivalent.
No Syllabus Attached!
No Documents Attached
Summer 2011
IE 3315 - Operations Research
Introduction to the major deterministic techniques of operations research and their application to decision problems. Linear programming, integer programming, network analysis, dynamic programming, nonlinear programming. Course software is used. Project required. Prerequisite: IE 3301 or concurrent enrollment and MATH 2326.
No Syllabus Attached!
No Documents Attached
Spring 2011
IE 5317 - Introduction to Statistics and Operations Research
Topics include descriptive statistics, set theory, combinatorics, mathematical expectation, probability distributions, confidence interval estimation, linear programming, the simplex and dual simplex algorithms, transportation and assignment problems, integer programming, and network analysis. Prerequisites: graduate standing and permission of advisor.
No Syllabus Attached!
No Documents Attached
Spring 2011
IE 3301 - ENGINEERING PROBABILITY
Topics in industrial engineering that involve random processes. Applications and backgrounds for topics in reliability, inventory systems, and queuing problems, including absoldute and conditional probabiltities, discrete and continuous random variables, parameter estimation, hypothesis testing, linear regression, experimentsl designs and analysis of variance. Prerequisite: MATH 2326 or concurrent enrollment.
No Syllabus Attached!
No Documents Attached
Fall 2010
IE 4315 - OPERATIONS RESEARCH II
A continuation of IE 3315 to probabilistic techniques of operations research and their application to decision models. Topics include z-transforms, linear difference equations, Markov chains, game theory, decision analysis, queueing theory, and non-quantitative aspects of decisions. Group projects are required. Prerequisite: IE 3301, IE 3315, and MATH 3319.
No Syllabus Attached!
No Documents Attached
Fall 2010
IE 5311 - Decision Analysis
A survey of methods for making optimal decisions. Topics include decision models, formal logic, fuzzy controls, statistical decision theory, game theory, multiobjective decisions, stochastic programming, information theory and qualitative aspects of the decisions. Prerequisites: IE 5301 or concurrent.
No Syllabus Attached!
No Documents Attached
Fall 2010
IE 3315 - Operations Research
Introduction to the major deterministic techniques of operations research and their application to decision problems. Linear programming, integer programming, network analysis, dynamic programming, nonlinear programming. Course software is used. Project required. Prerequisite: IE 3301 or concurrent enrollment and MATH 2326.
No Syllabus Attached!
No Documents Attached
Summer 2010
IE 3315 - Operations Research
Introduction to the major deterministic techniques of operations research and their application to decision problems. Linear programming, integer programming, network analysis, dynamic programming, nonlinear programming. Course software is used. Project required. Prerequisite: IE 3301 or concurrent enrollment and MATH 2326.
No Syllabus Attached!
No Documents Attached
Spring 2010
IE 5309 - Stochastic Processes
The study of probabilistic model building including the fundamentals of both discrete and continuous Markov chains, queueing theory and renewal theory. Prerequisites: IE 3301 or equivalent.
No Syllabus Attached!
No Documents Attached
Spring 2010
IE 3301 - ENGINEERING PROBABILITY
Topics in industrial engineering that involve random processes. Applications and backgrounds for topics in reliability, inventory systems, and queuing problems, including absoldute and conditional probabiltities, discrete and continuous random variables, parameter estimation, hypothesis testing, linear regression, experimentsl designs and analysis of variance. Prerequisite: MATH 2326 or concurrent enrollment.
No Syllabus Attached!
No Documents Attached
Fall 2009
IE 4315 - OPERATIONS RESEARCH II
A continuation of IE 3315 to probabilistic techniques of operations research and their application to decision models. Topics include z-transforms, linear difference equations, Markov chains, game theory, decision analysis, queueing theory, and non-quantitative aspects of decisions. Group projects are required. Prerequisite: IE 3301, IE 3315, and MATH 3319.
No Syllabus Attached!
No Documents Attached
Fall 2009
IE 5311 - Decision Analysis
A survey of methods for making optimal decisions. Topics include decision models, formal logic, fuzzy controls, statistical decision theory, game theory, multiobjective decisions, stochastic programming, information theory and qualitative aspects of the decisions. Prerequisites: IE 5301 or concurrent.
No Syllabus Attached!
No Documents Attached
Summer 2009
IE 5332 - Nonlinear Programming
IE5332  NONLINEAR PROGRAMMING (3-0)  Optimization theory for unconstrained, equality constrained, and inequality constrained problems is first developed.  Then, convex programming, geometric programming, quadratic programming, separable programming, and optimum seeking methods are presented.  Prerequisite:  graduate standing
Last Updated on May 12, 2013, 1:24 pm
No Documents Attached
December -
Coordinator of COE Dirty Dozen Puzzle Contest for engineering students during Engineering Week
2000-2009
Uncategorized
December -
Directed 28 Ph.D. dissertations
Uncategorized
December -
Member, College of Engineering Promotion and Tenure Committee
1996-2009
Uncategorized
December -
Chair of IMSE Faculty Search Committee
1999-2009
Uncategorized
December -
University Personnel Benefits Committee
2007-2009
Uncategorized
December -
University Advisory Committee on Student Affairs
2001-2009
Uncategorized
December -
IMSE Graduate Advisor
1999-2005
Uncategorized
September 2013
Ongoing
Associate Department Chair
IMSE Dept., College of Engineering, Office of the Provost and Vice President for Academic Affairs, Office of the President, The University of Texas at Arlington