Fix typos and format

Author: fwesselm

CMakeLists.txt

@@ -89,7 +89,7 @@ TEST_CASE("filereader-edge-cases", "[highs_filereader]") {
 
     if (test_garbage_lp) {
       // Since #2316, reading an LP file of garbage yields an empty
-      // model, since the absence of an objecive is (rightly) no
+      // model, since the absence of an objective is (rightly) no
       // longer an error. However the LP file reader should fail due
       // to the requirement that a LP format file must begin with a
       // keyword.

check/TestFilereader.cpp

@@ -28,7 +28,7 @@ TEST_CASE("semi-variable-model", "[highs_test_semi_variables]") {
   lp.col_cost_[semi_col] = semi_col_cost;
   lp.model_name_ = "semi-variable-model";
   optimal_objective_function_value = 6.83333;
-  // Legal to have infinte upper bounds on semi-variables
+  // Legal to have infinite upper bounds on semi-variables
   lp.col_upper_[semi_col] = inf;
   return_status = highs.passModel(model);
   REQUIRE(return_status == HighsStatus::kOk);

check/TestSemiVariables.cpp

@@ -98,7 +98,7 @@
 h.clearLinearObjectives()
 h.addLinearObjective(linear_objective0)
 h.addLinearObjective(linear_objective1)
-# Objectives as before, but absolute tolerence for f0 now -1 (negative
+# Objectives as before, but absolute tolerance for f0 now -1 (negative
 # => ignored) so relative tolerance of 0.05 is used
 #
 # Lexicographically: HiGHS 

examples/multiple_objective.py

@@ -53,8 +53,8 @@ returning from `Highs::run()`.
 
 The `HighsLp` class contains data values and structures that cannot be handled explicitly by the solvers.
 
-- If a variable has an excessivly large objective cost, this is
-  interpreted as being infinte, and handled in
+- If a variable has an excessively large objective cost, this is
+  interpreted as being infinite, and handled in
   `Highs::handleInfCost()` by fixing the variable at its lower or
   upper bound (when finite) according to the sign of the cost and the
   sense of the optimization, and zeroing the cost. After solving the

highs/HighsRun.md

@@ -30,7 +30,7 @@ namespace ipx {
 // The method calls ConstructBasisFromWeights() using the interior point
 // scaling factors as column weights. If a variable gets status BASIC_FREE or
 // NONBASIC_FIXED, then its state in @iterate is changed accordingly to free or
-// fixed. On return info->errflag is nonzero if an error occured.
+// fixed. On return info->errflag is nonzero if an error occurred.
 //
 void StartingBasis(Iterate* iterate, Basis* basis, Info* info);
 

highs/ipm/ipx/starting_basis.h

@@ -1096,11 +1096,11 @@ void HighsMipSolver::run() {
     assert(!nodesInstalled());
 
     // Sync global information
-    profiling_->start(kMipClockDomainPropgate);
+    profiling_->start(kMipClockDomainPropagate);
     syncPools(search_indices);
     syncGlobalDomain(search_indices);
     mipdata_->getDomain().propagate();
-    profiling_->stop(kMipClockDomainPropgate);
+    profiling_->stop(kMipClockDomainPropagate);
 
     profiling_->start(kMipClockPruneInfeasibleNodes);
     mipdata_->pruned_treeweight += mipdata_->nodequeue.pruneInfeasibleNodes(

highs/mip/HighsMipSolver.cpp

@@ -33,7 +33,7 @@ enum iClockMip : int {
   kMipClockPerformAging1,
   kMipClockDive,
   kMipClockOpenNodesToQueue0,
-  kMipClockDomainPropgate,
+  kMipClockDomainPropagate,
   kMipClockPruneInfeasibleNodes,
   kMipClockUpdateLocalDomain,
   kMipClockNodeSearch,
@@ -182,7 +182,7 @@ inline void initialiseMipProfilingNames(std::vector<std::string>& name) {
   name[kMipClockPerformAging1] = "Perform aging 1";
   name[kMipClockDive] = "Dive";
   name[kMipClockOpenNodesToQueue0] = "Open nodes to queue 0";
-  name[kMipClockDomainPropgate] = "Domain propagate";
+  name[kMipClockDomainPropagate] = "Domain propagate";
   name[kMipClockPruneInfeasibleNodes] = "Prune infeasible nodes";
   name[kMipClockUpdateLocalDomain] = "Update local domain";
   name[kMipClockNodeSearch] = "Node search";
@@ -342,7 +342,7 @@ class MipTimer {
     clock[kMipClockDive] = timer_pointer->clock_def("Dive");
     clock[kMipClockOpenNodesToQueue0] =
         timer_pointer->clock_def("Open nodes to queue 0");
-    clock[kMipClockDomainPropgate] =
+    clock[kMipClockDomainPropagate] =
         timer_pointer->clock_def("Domain propagate");
     clock[kMipClockPruneInfeasibleNodes] =
         timer_pointer->clock_def("Prune infeasible nodes");
@@ -546,7 +546,7 @@ class MipTimer {
   void reportMipSearchClock(const HighsTimerClock& mip_timer_clock) {
     const std::vector<HighsInt> mip_clock_list{
         kMipClockPerformAging1,        kMipClockDive,
-        kMipClockOpenNodesToQueue0,    kMipClockDomainPropgate,
+        kMipClockOpenNodesToQueue0,    kMipClockDomainPropagate,
         kMipClockPruneInfeasibleNodes, kMipClockUpdateLocalDomain,
         kMipClockNodeSearch,
         //	kMipClock@

highs/mip/MipTimer.h

@@ -516,7 +516,7 @@ class HPresolve {
   Result removeDoubletonEquations(HighsPostsolveStack& postsolve_stack);
 
   Result strengthenInequalities(HighsPostsolveStack& postsolve_stack,
-                                HighsInt& num_strenghtened);
+                                HighsInt& num_strengthened);
 
   Result detectImpliedIntegers();
 

highs/presolve/HPresolve.h

@@ -2853,7 +2853,7 @@ void HEkkPrimal::shiftBound(const bool lower, const HighsInt iVar,
     double error = std::fabs(new_infeasibility + feasibility);
     highsLogDev(ekk_instance_.options_->log_options, HighsLogType::kInfo,
                 "HEkkPrimal::shiftBound Value(%4d) = %10.4g exceeds %s: "
-                "random_value = %g; value = %g; "
+                "old_bound = %g; random_value = %g; value = %g; "
                 "feasibility = %g; infeasibility = %g; shift = %g; bound = %g; "
                 "new_infeasibility = %g with error %g\n",
                 int(iVar), value, type.c_str(), old_bound, random_value, value,