Cost-Volume-Profit Analysis of Intensive Courses in a Higher Education Institute: A Bi-objective Pure Integer Programming Model

In this paper, we address the bi-objective cost-volume-profit problem in a higher education institute in order to maximise the session number of intensive courses as well as the profit of all intensive courses during the semester.In this problem, the intensive courses are predefined in the higher educational system and three main sets including a set of several groups of students to be trained in the classroom (1-2 students, 3-5 students, 6-9 students), a set of teacher's degree (master, PhD), and a set of groups of courses (basic/general courses, specialised/main courses, laboratory/workshop courses) are defined in order to classified the parameters, variables, and constraints concerning to the problem.To solve the problem, a bi-objective pure integer programming (PIP) model is extended, and the -constraint multiobjective algorithm is employed to tackle PIP.For this aim, the proposed approach is illustrated by providing 7 real cases.Then, the proposed algorithm on all instances is run, and an optimum Pareto front (non-dominated solutions) is found for each case.Consequently, the computational experiments state that our proposed model and method create an optimised pattern that is applied as a novel approach of the institute to solve the cost-volume-profit problem.

Authors

Publication Details

Journal
ECONOMIC COMPUTATION AND ECONOMIC CYBERNETICS STUDIES AND RESEARCH
Published
2025-09-18
DOI
https://doi.org/10.24818/18423264/59.3.25.02
Primary Topic
Spreadsheets and End-User Computing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Cost-Volume-Profit Analysis of Intensive Courses in a Higher Education Institute: A Bi-objective Pure Integer Programming Model

Beshir M. Ali, Reza Behmanesh
ECONOMIC COMPUTATION AND ECONOMIC CYBERNETICS STUDIES AND RESEARCH
Spreadsheets and End-User Computing
article

Cost-Volume-Profit Analysis of Intensive Courses in a Higher Education Institute: A Bi-objective Pure Integer Programming Model

Beshir M. Ali, Reza Behmanesh
article en

Abstract

In this paper, we address the bi-objective cost-volume-profit problem in a higher education institute in order to maximise the session number of intensive courses as well as the profit of all intensive courses during the semester.In this problem, the intensive courses are predefined in the higher educational system and three main sets including a set of several groups of students to be trained in the classroom (1-2 students, 3-5 students, 6-9 students), a set of teacher's degree (master, PhD), and a set of groups of courses (basic/general courses, specialised/main courses, laboratory/workshop courses) are defined in order to classified the parameters, variables, and constraints concerning to the problem.To solve the problem, a bi-objective pure integer programming (PIP) model is extended, and the -constraint multiobjective algorithm is employed to tackle PIP.For this aim, the proposed approach is illustrated by providing 7 real cases.Then, the proposed algorithm on all instances is run, and an optimum Pareto front (non-dominated solutions) is found for each case.Consequently, the computational experiments state that our proposed model and method create an optimised pattern that is applied as a novel approach of the institute to solve the cost-volume-profit problem.

ECONOMIC COMPUTATION AND ECONOMIC CYBERNETICS STUDIES AND RESEARCHVol. 59(3/2025)
Openalex Percentile: Top 74%
Spreadsheets and End-User Computing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.