Determining Optimal Capacity for Student Admission Among Technological Universities According to a Linear Programming Model
Author(s):
Abstract:
One of the significant problems among higher educated researchers; policy makers and administrators is to consider available possibilities in higher education, how much expansion and capacity for optimal student admission among universities and higher education institutes should be accepted. In this survey, using a linear programming and also with considering three major limitations in expanding higher education, i.e finance (budget), faculty member and campus (teaching physical possibilities), optimal capacity for student admission among eight technological universities affiliated to the Ministry of Science, Research and Technology (MSRT) are determined. Results showed that in 2005-2006 academic year, most of these universities admitted students over their acceptable capacity in different educational fields. In this research its suggested the preferring public higher education and increasing their financial and legal support. Also it is recommended that policy maker planners, decision makers & government should pay more attention to public higher education.
Keywords:
Language:
Persian
Published:
Iranian Journal of Engineering Education, Volume:10 Issue: 40, 2009
Page:
53
magiran.com/p596184
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 990,000ريال میتوانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
- حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران میشود.
- پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانههای چاپی و دیجیتال را به کاربر نمیدهد.
In order to view content subscription is required
Personal subscription
Subscribe magiran.com for 50 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!