Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
A Mathematical Framework On Machine Learning: Theory And Application, Bin Shi
A Mathematical Framework On Machine Learning: Theory And Application, Bin Shi
FIU Electronic Theses and Dissertations
The dissertation addresses the research topics of machine learning outlined below. We developed the theory about traditional first-order algorithms from convex opti- mization and provide new insights in nonconvex objective functions from machine learning. Based on the theory analysis, we designed and developed new algorithms to overcome the difficulty of nonconvex objective and to accelerate the speed to obtain the desired result. In this thesis, we answer the two questions: (1) How to design a step size for gradient descent with random initialization? (2) Can we accelerate the current convex optimization algorithms and improve them into nonconvex objective? For application, …
Shift Scheduling Optimization For Psu Library, Aayushi Gupta, Anju Babu, Lipishree Vrushabhendra, Shivani Purwar, Shravankumar Doosa
Shift Scheduling Optimization For Psu Library, Aayushi Gupta, Anju Babu, Lipishree Vrushabhendra, Shivani Purwar, Shravankumar Doosa
Engineering and Technology Management Student Projects
Scheduling is important in any business as it creates an order and flow ensuring that all the tasks are covered at appropriate times. According to experts, scheduling determines the economics of a job, the quality of the team, and the skill-building and motivation of professionals doing the work. Therefore, it is essential to have optimized staff schedules to meet the requirements of staff availability, tasks coverage, shift equity and staff preferences. Though staff scheduling is of such prime importance, it is mostly implemented in traditional ways of manually creating spreadsheets and web calendars proving to be laborious and often leaving …
Minimizing Commute Distance For Small Groups: A Linear Programming Approach, Kevin Payne, Kritika Kumari, Levi Huddleston, Rabi Hassan
Minimizing Commute Distance For Small Groups: A Linear Programming Approach, Kevin Payne, Kritika Kumari, Levi Huddleston, Rabi Hassan
Engineering and Technology Management Student Projects
This paper aims to minimize total drive time between members and their respective group leader. Given a limit on group size and days available, how can a formulation of a group occur such that the sum of the total drive time is minimized. To accomplish this task a Linear Program (LP) is implemented that includes three sets of binary decisions variables summing to 4100 variables and a variety of constraints summing between 4200 and 4341 depending on the constraints enforced. For 200 members and 15 leaders the minimized average commuting time was found to be between 4.99 and 5.36 minutes …