Economic Models - Convex Optimization
Economic Models - Convex Optimization
Economic Models - Convex Optimization
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Health Service Management 155<br />
Table 3.<br />
Employees’salary at the initial and final year of the planning period.<br />
Groups (i)<br />
Number<br />
of group<br />
members<br />
(X i )<br />
Annual<br />
salary at<br />
year t 0 ,for<br />
all the<br />
members of<br />
group i (in<br />
thousand )<br />
Annual<br />
rate of<br />
increase,<br />
R i (in %)<br />
R i<br />
Salary at<br />
final year t f ,<br />
for all the<br />
members of<br />
group i<br />
(in )<br />
Average<br />
per person<br />
at each<br />
group (c c i )<br />
1 10 260 6.5 356,222 35,622.2<br />
2 1 24.7 6 33,054 33,054<br />
3 3 54.6 4.5 68,040 22,680<br />
4 14 163.8 4 199,290 14,235<br />
5 3 58.5 4.9 74,307 24,769<br />
6 1 27.3 5.8 36,190 36,190<br />
7 3 32.76 3.8 39,476 13,158.666<br />
8 4 41.6 3.6 49,647 12,411.75<br />
9 4 42.64 3.5 50,643 12,660.75<br />
10 10 101.4 3.4 119,851 11,985.10<br />
Another point of interest refers to the average working hours of the<br />
members of each group. The relative figures are analytically presented in<br />
Table 4.<br />
It can be easily verified that in Table 4, column 5 is obtained by multiplying<br />
the elements of column 4 by 52.<br />
Denoting by X 22+i (i = 1,...,10) the total average working hours per<br />
year for all the group members, then I may write<br />
X 22+i = w i × X i (i = 1,...,10). (4)<br />
3. The Nature of the Problem<br />
Given all the information presented in Tables 1–4, the resultant problem<br />
is, how to formulate a feasible operating plan, which should combine<br />
the desired salary increases and the full utilization of working hours,<br />
the expenses incurred, together with the desired gross profit at the final<br />
year set by the decision maker, in the best possible way with the minimum<br />
sacrifice. This problem can be answered by the goal programming<br />
method, originally developed by Charnes and Cooper (1961). It should