Effect of Health Education Program on Self-Efficacy and Functional Capacity of Patients with Coronary Artery Bypass Surgery in Khartoum State-Sudan, 2015-2019

Coronary heart disease is among the most prevalent and costly of all global health problems. Coronary artery bypass grafting (CABG) has been increasingly used since the 1960s. Coronary heart disease is a leading cause of death worldwide, including Sudan. Self-efficacy and functional capacity is a critical factor for quality of life in patients who has undergone CABG as well as for their caregivers from their families. Aim of the Study: To explore the effects of an educational program on self-efficacy and functional capacity of patients after CABG. 1) There will be no significant difference between the intervention group and control group concerning knowledge regarding Self-efficacy and functional capacity post CABG surgery. 2) The application of our educational program for the patients will enhance the patients with CABG surgery and improve knowledge about Self-efficacy and functional capacity post CABG surgery. 3) There are some socio demographic factors that affect the response to the educational program. Methods: This was a quasi-experimental, interventional and hospital-based study, including pre-test, a post-test and follow-up test, with a control group, conducted during the period from September 2014 to June 2019. Patients were recruited consecutively to the cases and control group using convenience sampling. The sample consisted of 76 patients;41 as cases and 35 as control group. The sample included those who had undergone CABG in Khartoum State. Relevant data were collected using a checklist to monitor the effect of a health education program on self-efficacy and functional capacity of the patients. Result: The results showed marked improvement in patients’ self-efficacy and functional capacity between pretest and posttest for the study group;p-value = (0.001) in the health status of cases in comparison to the control group. The indices were observed to be higher for patients who received a nursing educational program throughout the study period;p-value = (0.002).

A DUAL-RELAX PENALTY FUNCTION APPROACH FOR SOLVING NONLINEAR BILEVEL PROGRAMMING WITH LINEAR LOWER LEVEL PROBLEM

The penalty function method, presented many years ago, is an important nu- merical method for the mathematical programming problems. In this article, we propose a dual-relax penalty function approach, which is significantly different from penalty func- tion approach existing for solving the bilevel programming, to solve the nonlinear bilevel programming with linear lower level problem. Our algorithm will redound to the error analysis for computing an approximate solution to the bilevel programming. The error estimate is obtained among the optimal objective function value of the dual-relax penalty problem and of the original bilevel programming problem. An example is illustrated to show the feasibility of the proposed approach.

NONLINEAR PROGRAMMING VIA AN EXACT PENALTY FUNCTION：CONVERGENCE RATE ANALYSIS

ＮＯＮＬＩＮＥＡＲＰＲＯＧＲＡＭＭＩＮＧＶＩＡＡＮＥＸＡＣＴＰＥＮＡＬＴＹＦＵＮＣＴＩＯＮ：ＣＯＮＶＥＲＧＥＮＣＥＲＡＴＥＡＮＡＬＹＳＩＳＬｉＸｕｅｑｕａｎＬｉＳｏｎｇｒｅｎＨａｎＸｕｉｌｉ（ＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃ...

General Exact Penalty Functions in Integer Programming

In this paper, the general exact penalty functions in integer programming were studied. The conditions which ensure the exact penalty property for the general penalty function with one penalty parameter were given and a general penalty function with two parameters was proposed.

THE CONVERGENCE OF APPROACH PENALTY FUNCTION METHOD FOR APPROXIMATE BILEVEL PROGRAMMING PROBLEM

In this paper, a new algorithm-approximate penalty function method is designed, which can be used to solve a bilevel optimization problem with linear constrained function. In this kind of bilevel optimization problem. the evaluation of the objective function is very difficult, so that only their approximate values can be obtained. This algorithm is obtained by combining penalty function method and approximation in bilevel programming. The presented algorithm is completely different from existing methods. That convergence for this algorithm is proved.

Motor relearning program and Bobath method improve motor function of the upper extremities in patients with stroke

BACKGROUND: In the natural evolution of cerebrovascular disease, unconscious use of affected extremity during drug treatment and daily life can improve the function of affected upper extremity partially, but it is very slow and also accompanied by the formation of abnormal mode. Therefore, functional training should be emphasized in recovering the motor function of extremity. OBJECTIVE: To observe the effects of combination of motor relearning program and Bobath method on motor function of upper extremity of patients with stroke. DESIGN: Comparison of therapeutic effects taking stroke patients as observation subjects. SETTING: Department of Neurology, General Hospital of Beijing Jingmei Group. PARTICIPANTS: Totally 120 stroke patients, including 60 males and 60 females, averaged (59±3) years, who hospitalized in the Department of Neurology, General Hospital of Beijing Jingmei Group between January 2005 and June 2006 were recruited. The involved patients met the following criteria: Stroke attack within 2 weeks; diagnosis criteria of cerebral hemorrhage or infarction made in the 4th National Cerebrovascular Disease Conference; confirmed by skull CT or MRI; Informed consents of therapeutic regimen were obtained. The patients were assigned into 2 groups according to their wills: rehabilitation group and control group, with 30 males and 30 females in each group. Patients in rehabilitation group averaged (59±2)years old, and those in the control group averaged (58±2)years old. METHODS: ① Patients in two groups received routine treatment in the Department of Neurology. When the vital signs of patients in the rehabilitation group were stable, individualized treatment was conducted by combined application of motor relearning program and Bobath method. Meanwhile, training of activity of daily living was performed according to the disease condition changes of patients at different phases, including the nursing and instruction of body posture, the maintenance of good extremity position, bed exercise, bedside sit up and sitting position balance, sit up exercise, dynamic and static balance exercise, walking exercise, active training and passive training. The strength, time and speed of training were increased gradually according to their physical abilities. Patients were trained 45 to 60 minutes once, 5 times a week, within 2 weeks. ② Evaluation criteria of therapeutic effect: The motor function of upper extremity was evaluated by Fugl-Meyer method on the day of beginning and end of treatment. Higher points indicated better function of upper extremity. ③ t test and paired t test were used for comparing the difference of intergroup and intragroup measurement data, respectively. MAIN OUTCOME MEASURES: Changes in Fugl-Meyer scoring of two groups before and after treatment. RESULTS: Totally 120 stroke patients participated in the final analysis. Before treatment, Fugl-Meyer scoring was close between rehabilitation group and control group [(14.47±2.38),(14.16±2.39) points, P > 0.05]; Fugl-Meyer scoring of rehabilitation group after treatment was significantly higher than that before treatment and that of control group[(37.93±2.67),(18.36±2.43) points, t =11.053, 5.408, P < 0.01]; There were no significant differences in Fugl-Meyer scoring between before treatment in the control group and control group (P > 0.05). CONCLUSION: Combined application of motor relearning program and Bobath method can significantly improve the motor function of upper extremity of patients with stroke.

A Feasibility Study of an Individualized Voiding Program in Japan to Improve the Sense of Control in Older People with Functional Urinary Incontinence

Purpose: This study intended to assess the feasibility of an individualized voiding program in Japan aimed at improving the sense of micturition control in older people with functional urinary incontinence. Method: Following the interview guide, FGIs were conducted in two groups (4 - 6 participants) consisting of nurses and care workers with more than 5 years of experience as practitioners of urination care. Data were analyzed using a qualitative descriptive approach. Results: We determined that the program purpose is to “enable caregivers to work as a well-coordinated team to humanely facilitate excretion independence in older people, which is essential for living with dignity”, as this confirmed the importance of maintaining the sense of micturition control in older people for their well-being. In the program outline, we extracted the following five categories: 1) setting selection criteria for recipients considering the status of micturition induction, 2) careful collection of information and assessment of lower urinary tract symptoms in older people in case of environmental changes, 3) examination of methods used for assessing lower urinary tract symptoms according to the facility environment, 4) confirmation of the recipient’s micturition habits and request for assistance, and 5) conducting necessary examination for setting the intervention period and evaluation period according to the target condition. The feedback on the program guide was summarized in the statement—specific successful cases help frame and implement the micturition induction plan. Conclusion: We confirmed the feasibility of the micturition induction plan for improving the sense of control in older people with functional urinary incontinence. Upon evaluating the program guide, we deemed that referring to specific successful cases helps frame and implement the micturition induction plan. It is extremely important to verify the effectiveness of the program going forward.

Two-parameters quasi-filled function algorithm for nonlinear integer programming

A quasi-filled function for nonlinear integer programming problem is given in this paper. This function contains two parameters which are easily to be chosen. Theoretical properties of the proposed quasi-filled function are investigated. Moreover, we also propose a new solution algorithm using this quasi-filled function to solve nonlinear integer programming problem in this paper. The examples with 2 to 6 variables are tested and computational results indicated the efficiency and reliability of the pro- posed quasi-filled function algorithm.

One-parameter quasi-filled function algorithm for nonlinear integer programming

A definition of the quasi-filled function for nonlinear integer programming problem is given in this paper. A quasi-filled function satisfying our definition is presented. This function contains only one parameter. The properties of the pro- posed quasi-filled function and the method using this quasi-filled function to solve nonlinear integer programming problem are also discussed in this paper. Numerical results indicated the efficiency and reliability of the proposed quasi-filled function algo- rithm.

Another Approach to Multiobjective Programming Problems with V-invex Functions

In this paper, optimality conditions for multiobjective programming problems having V-invex objective and constraint functions are considered. An equivalent multiobjective programming problem is constructed by a modification of the objective function.Furthermore, a (α, η)-Lagrange function is introduced for a constructed multiobjective programming problem, and a new type of saddle point is introduced. Some results for the new type of saddle point are given.

A One-parameter Filled Function Method for Nonlinear Integer Programming

This paper gives a new definition of the filled function for nonlinear integer programming problem. A filled function satisfying our definition is presented. This function contains only one parameter. The properties of the proposed filled function and the method using this filled function to solve nonlinear integer programming problem are also discussed. Numerical results indicate the efficiency and reliability of the proposed filled function algorithm.

Continuity of the optimal value function and optimal solutions of parametric mixed-integer quadratic programs

To properly describe and solve complex decision problems, research on theoretical properties and solution of mixed-integer quadratic programs is becoming very important. We establish in this paper different Lipschitz-type continuity results about the optimal value function and optimal solutions of mixed-integer parametric quadratic programs with parameters in the linear part of the objective function and in the right-hand sides of the linear constraints. The obtained results extend some existing results for continuous quadratic programs, and, more importantly, lay the foundation for further theoretical study and corresponding algorithm analysis on mixed-integer quadratic programs.

Development of an accurate nursing program based on function in chronic venous leg ulcers:protocol for matching function status with nursing interventions using the Delphi survey

Objective: Venous leg ulceration(VLU) is one of the complications of lower extremity venous reflux and reflux disorder of severe diseases, with many adverse effects on patient’s work and life. Nowadays, more and more patients with VLU accept wound care in community setting. Clinical nurses generally take care of the patients based on their own experiences. Healing in VLU is an incredibly complex process, which puzzles even experts. The majority of general nurses do not have this level of expertise, especially those nurses serving in community. Function is the basis of nursing activities. Patients always show different clinical manifestations and selfcare abilities due to various function states, which cannot be reflected completely by the existing nursing practice. How to describe nursing practice standardized in order to demonstrate the effectiveness of interventions and facilitate interdisciplinary communication is another urgent problem. Therefore, the aim of this project is to develop an accurate nursing program based on function in chronic venous leg ulcers, which can both satisfy the needs of patients and promote nursing revolution.Methods: This study will use International Classification of Functioning Disability and Health as a framework to choose suitable functions and to filter function classification standards of chronic venous leg ulcers through evidence-based systematic research.Nursing interventions related to VLU are selected based on Nursing Interventions Classification, adding other nursing activities by methods of evidence-based systematic review and clinical observation. Then, nursing interventions and function status are matched through steering committee. Finally, the Delphi survey method is adopted to make nursing program native and scientific.Conclusions: This study is expected to be very significant and meaningful in using standardized nursing terminology. The nursing program established could better meet the needs of both patients with chronic venous leg ulcers and clinical nurses, promoting the development of wound specialist and standardized nursing language.

On Continuous Programming with Support Functions

A second-order Mond-Weir type dual problem is formulated for a class of continuous programming problems in which both objective and constraint functions contain support functions;hence it is nondifferentiable. Under second-order strict pseudoinvexity, second-order pseudoinvexity and second-order quasi-invexity assumptions on functionals, weak, strong, strict converse and converse duality theorems are established for this pair of dual continuous programming problems. Special cases are deduced and a pair of dual continuous problems with natural boundary values is constructed. A close relationship between the duality results of our problems and those of the corresponding (static) nonlinear programming problem with support functions is briefly outlined.

EXACT AUGMENTED LAGRANGIAN FUNCTION FOR NONLINEAR PROGRAMMING PROBLEMS WITH INEQUALITY CONSTRAINTS

An exact augmented Lagrangian function for the nonlinear nonconvex programming problems with inequality constraints was discussed. Under suitable hypotheses, the relationship was established between the local unconstrained minimizers of the augmented Lagrangian function on the space of problem variables and the local minimizers of the original constrained problem. Furthermore, under some assumptions, the relationship was also established between the global solutions of the augmented Lagrangian function on some compact subset of the space of problem variables and the global solutions of the constrained problem. Therefore, f^om the theoretical point of view, a solution of the inequality constrained problem and the corresponding values of the Lagrange multipliers can be found by the well-known method of multipliers which resort to the unconstrained minimization of the augmented Lagrangian function presented.

Second-Order Duality for Continuous Programming Containing Support Functions

A second-order dual problem is formulated for a class of continuous programming problem in which both objective and constrained functions contain support functions, hence it is nondifferentiable. Under second-order invexity and second-order pseudoinvexity, weak, strong and converse duality theorems are established for this pair of dual problems. Special cases are deduced and a pair of dual continuous problems with natural boundary values is constructed. A close relationship between duality results of our problems and those of the corresponding (static) nonlinear programming problem with support functions is briefly outlined.

A Penalty Function Algorithm with Objective Parameters and Constraint Penalty Parameter for Multi-Objective Programming

In this paper, we present an algorithm to solve the inequality constrained multi-objective programming (MP) by using a penalty function with objective parameters and constraint penalty parameter. First, the penalty function with objective parameters and constraint penalty parameter for MP and the corresponding unconstraint penalty optimization problem (UPOP) is defined. Under some conditions, a Pareto efficient solution (or a weakly-efficient solution) to UPOP is proved to be a Pareto efficient solution (or a weakly-efficient solution) to MP. The penalty function is proved to be exact under a stable condition. Then, we design an algorithm to solve MP and prove its convergence. Finally, numerical examples show that the algorithm may help decision makers to find a satisfactory solution to MP.

A RECURSIVE QUADRATIC PROGRAMMING ALGORITHM THAT USES A NEW NONDIFFERENTIABLE PENALTY FUNCTIONS

ＡＲＥＣＵＲＳＩＶＥＱＵＡＤＲＡＴＩＣＰＲＯＧＲＡＭＭＩＮＧＡＬＧＯＲＩＴＨＭＴＨＡＴＵＳＥＳＡＮＥＷＮＯＮＤＩＦＦＥＲＥＮＴＩＡＢＬＥＰＥＮＡＬＴＹＦＵＮＣＴＩＯＮＳ￥ＹＡＮＧＢＯＴＩＮＧＡＮＤＺＨＡＮＧＫＥＣＵＮ（Ｄｅｐｔ．ｏｆＭａｔｈ．，Ｘｉ＇...

Randomized Objective Function Linear Programming in Risk Management

The traditional linear programming model is deterministic. The way that uncertainty is handled is to compute the range of optimality. After the optimal solution is obtained, typically by the simplex method, one considers the effect of varying each objective function coefficient, one at a time. This yields the range of optimality within which the decision variables remain constant. This sensitivity analysis is useful for helping the analyst get a sense for the problem. However, it is unrealistic because objective function coefficients tend not to stand still. They are typically profit contributions from products sold and are subject to randomly varying selling prices. In this paper, a realistic linear program is created for simultaneously randomizing the coefficients from any probability distribution. Furthermore, we present a novel approach for designing a copula of random objective function coefficients according to a specified rank correlation. The corresponding distribution of objective function values is created. This distribution is examined directly for central tendency, spread, skewness and extreme values for the purpose of risk analysis. This enables risk analysis and business analytics, emerging topics in education and preparation for the knowledge economy.

Lipschitz continuity of the optimal value function and KKT solution set in indefinite quadratic programs

When all the involved data in indefinite quadratic programs change simultaneously, we show the locally Lipschtiz continuity of the KKT set of the quadratic programming problem firstly, then we establish the locally Lipschtiz continuity of the KKT solution set. Finally, the similar conclusion for the corresponding optimal value function is obtained.